/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:42:22,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:42:22,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:42:22,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:42:22,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:42:22,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:42:22,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:42:22,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:42:22,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:42:22,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:42:22,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:42:22,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:42:22,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:42:22,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:42:22,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:42:22,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:42:22,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:42:22,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:42:22,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:42:22,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:42:22,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:42:22,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:42:22,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:42:22,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:42:22,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:42:22,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:42:22,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:42:22,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:42:22,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:42:22,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:42:22,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:42:22,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:42:22,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:42:22,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:42:22,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:42:22,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:42:22,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:42:22,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:42:22,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:42:22,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:42:22,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:42:22,711 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:42:22,725 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:42:22,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:42:22,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:42:22,727 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:42:22,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:42:22,727 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:42:22,727 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:42:22,728 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:42:22,728 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:42:22,728 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:42:22,728 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:42:22,728 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:42:22,729 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:42:22,729 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:42:22,729 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:42:22,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:42:22,729 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:42:22,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:42:22,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:42:22,730 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:42:22,730 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:42:22,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:42:22,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:42:22,731 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:42:22,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:42:22,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:42:22,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:42:22,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:42:22,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:42:22,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:42:22,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:42:22,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:42:22,922 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:42:22,923 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:42:22,924 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:42:22,993 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_HICL4x/tmp/295eec308bf84504949aad1c678136dc/FLAG772844da1 [2020-07-01 12:42:23,335 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:42:23,336 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:42:23,336 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:42:23,343 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_HICL4x/tmp/295eec308bf84504949aad1c678136dc/FLAG772844da1 [2020-07-01 12:42:23,732 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_HICL4x/tmp/295eec308bf84504949aad1c678136dc [2020-07-01 12:42:23,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:42:23,745 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:42:23,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:42:23,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:42:23,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:42:23,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a92508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23, skipping insertion in model container [2020-07-01 12:42:23,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:42:23,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:42:24,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:42:24,035 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:42:24,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:42:24,072 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:42:24,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24 WrapperNode [2020-07-01 12:42:24,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:42:24,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:42:24,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:42:24,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:42:24,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:42:24,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:42:24,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:42:24,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:42:24,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:42:24,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:42:24,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:42:24,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:42:24,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:42:24,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:42:24,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:42:24,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:42:24,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:42:24,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:42:24,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:42:24,491 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:42:24,492 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:42:24,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:42:24 BoogieIcfgContainer [2020-07-01 12:42:24,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:42:24,496 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:42:24,496 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:42:24,498 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:42:24,499 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:42:24" (1/1) ... [2020-07-01 12:42:24,514 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 34 edges [2020-07-01 12:42:24,516 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:42:24,517 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:42:24,517 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:42:24,518 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:42:24,519 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:42:24,520 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:42:24,520 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:42:24,545 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:42:24,578 INFO L200 BlockEncoder]: SBE split 14 edges [2020-07-01 12:42:24,583 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:42:24,585 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:42:24,610 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 12:42:24,613 INFO L70 RemoveSinkStates]: Removed 7 edges and 3 locations by removing sink states [2020-07-01 12:42:24,615 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:42:24,615 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:42:24,615 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:42:24,616 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:42:24,617 INFO L313 BlockEncoder]: Encoded RCFG 22 locations, 39 edges [2020-07-01 12:42:24,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:42:24 BasicIcfg [2020-07-01 12:42:24,617 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:42:24,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:42:24,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:42:24,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:42:24,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:42:23" (1/4) ... [2020-07-01 12:42:24,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af3de4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:42:24, skipping insertion in model container [2020-07-01 12:42:24,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (2/4) ... [2020-07-01 12:42:24,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af3de4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:42:24, skipping insertion in model container [2020-07-01 12:42:24,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:42:24" (3/4) ... [2020-07-01 12:42:24,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af3de4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:42:24, skipping insertion in model container [2020-07-01 12:42:24,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:42:24" (4/4) ... [2020-07-01 12:42:24,626 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:42:24,637 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:42:24,645 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2020-07-01 12:42:24,659 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-07-01 12:42:24,683 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:42:24,683 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:42:24,683 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:42:24,683 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:42:24,684 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:42:24,684 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:42:24,684 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:42:24,684 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:42:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-01 12:42:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:42:24,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:24,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:42:24,722 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 159981130, now seen corresponding path program 1 times [2020-07-01 12:42:24,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:24,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263349577] [2020-07-01 12:42:24,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:24,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263349577] [2020-07-01 12:42:24,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:24,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:42:24,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759445530] [2020-07-01 12:42:24,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:42:24,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:42:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:24,952 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-07-01 12:42:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:25,062 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2020-07-01 12:42:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:42:25,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:42:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:25,079 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:42:25,079 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:42:25,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:25,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:42:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:42:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:42:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. [2020-07-01 12:42:25,122 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 37 transitions. Word has length 5 [2020-07-01 12:42:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:25,123 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 37 transitions. [2020-07-01 12:42:25,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:42:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 37 transitions. [2020-07-01 12:42:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:42:25,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:25,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:42:25,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:42:25,124 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:25,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:25,125 INFO L82 PathProgramCache]: Analyzing trace with hash 159981132, now seen corresponding path program 1 times [2020-07-01 12:42:25,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:25,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690273477] [2020-07-01 12:42:25,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690273477] [2020-07-01 12:42:25,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:25,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:42:25,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923261399] [2020-07-01 12:42:25,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:42:25,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:25,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:42:25,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:25,174 INFO L87 Difference]: Start difference. First operand 21 states and 37 transitions. Second operand 3 states. [2020-07-01 12:42:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:25,247 INFO L93 Difference]: Finished difference Result 22 states and 37 transitions. [2020-07-01 12:42:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:42:25,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:42:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:25,249 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:42:25,249 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:42:25,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:42:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:42:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:42:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2020-07-01 12:42:25,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 5 [2020-07-01 12:42:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:25,255 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. [2020-07-01 12:42:25,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:42:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. [2020-07-01 12:42:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:42:25,256 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:25,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:42:25,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:42:25,256 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash 159981133, now seen corresponding path program 1 times [2020-07-01 12:42:25,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:25,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612680173] [2020-07-01 12:42:25,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612680173] [2020-07-01 12:42:25,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:25,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:42:25,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467586570] [2020-07-01 12:42:25,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:42:25,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:25,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:42:25,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:42:25,295 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 4 states. [2020-07-01 12:42:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:25,352 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-07-01 12:42:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:42:25,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:42:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:25,354 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:42:25,354 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:42:25,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:42:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:42:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:42:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:42:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-07-01 12:42:25,359 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 5 [2020-07-01 12:42:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:25,359 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-07-01 12:42:25,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:42:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2020-07-01 12:42:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:42:25,360 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:25,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:42:25,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:42:25,360 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:25,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash 664446269, now seen corresponding path program 1 times [2020-07-01 12:42:25,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:25,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168622302] [2020-07-01 12:42:25,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168622302] [2020-07-01 12:42:25,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:25,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:42:25,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143576691] [2020-07-01 12:42:25,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:42:25,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:42:25,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:25,394 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 3 states. [2020-07-01 12:42:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:25,450 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2020-07-01 12:42:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:42:25,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:42:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:25,452 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:42:25,452 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:42:25,452 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:42:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:42:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:42:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2020-07-01 12:42:25,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 [2020-07-01 12:42:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:25,457 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. [2020-07-01 12:42:25,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:42:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. [2020-07-01 12:42:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:42:25,458 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:25,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:42:25,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:42:25,458 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 664446271, now seen corresponding path program 1 times [2020-07-01 12:42:25,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:25,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856892632] [2020-07-01 12:42:25,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856892632] [2020-07-01 12:42:25,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:25,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:42:25,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575410218] [2020-07-01 12:42:25,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:42:25,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:25,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:42:25,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:42:25,502 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 4 states. [2020-07-01 12:42:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:25,555 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2020-07-01 12:42:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:42:25,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:42:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:25,557 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:42:25,557 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:42:25,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:42:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:42:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:42:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:42:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2020-07-01 12:42:25,561 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 6 [2020-07-01 12:42:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:25,562 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-07-01 12:42:25,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:42:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2020-07-01 12:42:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:42:25,562 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:25,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:42:25,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:42:25,563 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash 664446272, now seen corresponding path program 1 times [2020-07-01 12:42:25,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:25,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865561456] [2020-07-01 12:42:25,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865561456] [2020-07-01 12:42:25,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:25,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:42:25,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083392095] [2020-07-01 12:42:25,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:42:25,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:25,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:42:25,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:25,604 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 3 states. [2020-07-01 12:42:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:25,663 INFO L93 Difference]: Finished difference Result 19 states and 32 transitions. [2020-07-01 12:42:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:42:25,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:42:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:25,665 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:42:25,665 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:42:25,665 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:42:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:42:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:42:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2020-07-01 12:42:25,669 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 6 [2020-07-01 12:42:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:25,670 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 31 transitions. [2020-07-01 12:42:25,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:42:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 31 transitions. [2020-07-01 12:42:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:42:25,670 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:25,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:25,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:42:25,671 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:25,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:25,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1417236218, now seen corresponding path program 1 times [2020-07-01 12:42:25,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:25,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88943872] [2020-07-01 12:42:25,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88943872] [2020-07-01 12:42:25,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:25,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:42:25,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687975023] [2020-07-01 12:42:25,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:42:25,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:25,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:42:25,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:42:25,732 INFO L87 Difference]: Start difference. First operand 18 states and 31 transitions. Second operand 5 states. [2020-07-01 12:42:25,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:25,837 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2020-07-01 12:42:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:42:25,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 12:42:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:25,838 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:42:25,838 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:42:25,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:42:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:42:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 12:42:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:42:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2020-07-01 12:42:25,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 8 [2020-07-01 12:42:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:25,843 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-07-01 12:42:25,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:42:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 29 transitions. [2020-07-01 12:42:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:42:25,844 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:25,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:25,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:42:25,844 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1417236216, now seen corresponding path program 1 times [2020-07-01 12:42:25,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:25,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484414023] [2020-07-01 12:42:25,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484414023] [2020-07-01 12:42:25,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:25,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:42:25,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029667531] [2020-07-01 12:42:25,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:42:25,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:25,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:42:25,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:42:25,945 INFO L87 Difference]: Start difference. First operand 17 states and 29 transitions. Second operand 7 states. [2020-07-01 12:42:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:26,084 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2020-07-01 12:42:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:42:26,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-07-01 12:42:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:26,085 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:42:26,085 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:42:26,086 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:42:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:42:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:42:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:42:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2020-07-01 12:42:26,091 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 8 [2020-07-01 12:42:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:26,091 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2020-07-01 12:42:26,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:42:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-07-01 12:42:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:42:26,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:26,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:26,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:42:26,092 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:26,093 INFO L82 PathProgramCache]: Analyzing trace with hash -459349044, now seen corresponding path program 1 times [2020-07-01 12:42:26,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:26,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675589512] [2020-07-01 12:42:26,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:26,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675589512] [2020-07-01 12:42:26,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:26,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:42:26,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551998221] [2020-07-01 12:42:26,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:42:26,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:26,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:42:26,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:42:26,138 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 5 states. [2020-07-01 12:42:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:26,213 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-07-01 12:42:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:42:26,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 12:42:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:26,214 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:42:26,214 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:42:26,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:42:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:42:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:42:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:42:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-07-01 12:42:26,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 10 [2020-07-01 12:42:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:26,219 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-07-01 12:42:26,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:42:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-07-01 12:42:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:42:26,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:26,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:26,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:42:26,220 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:26,221 INFO L82 PathProgramCache]: Analyzing trace with hash -459349042, now seen corresponding path program 1 times [2020-07-01 12:42:26,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:26,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032036154] [2020-07-01 12:42:26,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:26,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032036154] [2020-07-01 12:42:26,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:26,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:42:26,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176366515] [2020-07-01 12:42:26,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:42:26,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:42:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:42:26,307 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 7 states. [2020-07-01 12:42:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:26,443 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. [2020-07-01 12:42:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:42:26,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-01 12:42:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:26,444 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:42:26,444 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:42:26,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:42:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:42:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-01 12:42:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:42:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-07-01 12:42:26,449 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2020-07-01 12:42:26,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:26,449 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-07-01 12:42:26,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:42:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2020-07-01 12:42:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:42:26,450 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:26,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:26,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:42:26,451 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash 947221102, now seen corresponding path program 1 times [2020-07-01 12:42:26,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:26,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317026973] [2020-07-01 12:42:26,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:26,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317026973] [2020-07-01 12:42:26,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:26,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:42:26,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917884383] [2020-07-01 12:42:26,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:42:26,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:26,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:42:26,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:26,488 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2020-07-01 12:42:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:26,518 INFO L93 Difference]: Finished difference Result 21 states and 31 transitions. [2020-07-01 12:42:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:42:26,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-01 12:42:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:26,519 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:42:26,519 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:42:26,519 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:42:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:42:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:42:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2020-07-01 12:42:26,523 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 12 [2020-07-01 12:42:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:26,524 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-07-01 12:42:26,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:42:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2020-07-01 12:42:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:42:26,524 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:26,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:26,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:42:26,525 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash 947221103, now seen corresponding path program 1 times [2020-07-01 12:42:26,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:26,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007650214] [2020-07-01 12:42:26,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:26,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007650214] [2020-07-01 12:42:26,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:26,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:42:26,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113906097] [2020-07-01 12:42:26,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:42:26,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:26,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:42:26,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:26,564 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 3 states. [2020-07-01 12:42:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:26,592 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2020-07-01 12:42:26,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:42:26,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-01 12:42:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:26,593 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:42:26,593 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:42:26,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:42:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:42:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:42:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-07-01 12:42:26,597 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 12 [2020-07-01 12:42:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:26,598 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-07-01 12:42:26,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:42:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2020-07-01 12:42:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:42:26,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:26,599 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:26,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:42:26,599 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash -251983389, now seen corresponding path program 1 times [2020-07-01 12:42:26,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:26,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509460329] [2020-07-01 12:42:26,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:26,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509460329] [2020-07-01 12:42:26,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:26,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-01 12:42:26,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751171810] [2020-07-01 12:42:26,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 12:42:26,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 12:42:26,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:42:26,793 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 10 states. [2020-07-01 12:42:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:27,034 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2020-07-01 12:42:27,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:42:27,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-07-01 12:42:27,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:27,035 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:42:27,035 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:42:27,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:42:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:42:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-01 12:42:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:42:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 48 transitions. [2020-07-01 12:42:27,042 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 48 transitions. Word has length 14 [2020-07-01 12:42:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:27,042 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 48 transitions. [2020-07-01 12:42:27,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 12:42:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 48 transitions. [2020-07-01 12:42:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:42:27,043 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:27,043 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:27,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:42:27,044 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:27,044 INFO L82 PathProgramCache]: Analyzing trace with hash -251937133, now seen corresponding path program 1 times [2020-07-01 12:42:27,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:27,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98133041] [2020-07-01 12:42:27,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:27,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98133041] [2020-07-01 12:42:27,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61989215] [2020-07-01 12:42:27,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:27,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 12:42:27,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:27,349 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:42:27,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:42:27,394 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:27,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:42:27,401 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:27,420 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:27,423 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:42:27,424 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 12:42:27,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:27,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-07-01 12:42:27,575 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:27,576 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:42:27,586 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:27,588 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:42:27,591 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:27,592 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:42:27,593 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:42:27,627 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:27,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:27,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2020-07-01 12:42:27,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997871550] [2020-07-01 12:42:27,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:42:27,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:27,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:42:27,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:42:27,632 INFO L87 Difference]: Start difference. First operand 30 states and 48 transitions. Second operand 15 states. [2020-07-01 12:42:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:28,369 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2020-07-01 12:42:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:42:28,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2020-07-01 12:42:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:28,371 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:42:28,371 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:42:28,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2020-07-01 12:42:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:42:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2020-07-01 12:42:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:42:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2020-07-01 12:42:28,381 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 14 [2020-07-01 12:42:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:28,381 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2020-07-01 12:42:28,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:42:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2020-07-01 12:42:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:42:28,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:28,382 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:28,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-01 12:42:28,584 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:28,584 INFO L82 PathProgramCache]: Analyzing trace with hash -251937132, now seen corresponding path program 1 times [2020-07-01 12:42:28,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:28,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908174156] [2020-07-01 12:42:28,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:28,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908174156] [2020-07-01 12:42:28,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466812727] [2020-07-01 12:42:28,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:28,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:42:28,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:28,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:28,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2020-07-01 12:42:28,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361145906] [2020-07-01 12:42:28,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:42:28,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:28,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:42:28,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:42:28,714 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 9 states. [2020-07-01 12:42:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:28,843 INFO L93 Difference]: Finished difference Result 39 states and 63 transitions. [2020-07-01 12:42:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:42:28,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-01 12:42:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:28,845 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:42:28,845 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 12:42:28,845 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:42:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 12:42:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 12:42:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:42:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2020-07-01 12:42:28,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 14 [2020-07-01 12:42:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:28,854 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 59 transitions. [2020-07-01 12:42:28,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:42:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2020-07-01 12:42:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:42:28,855 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:28,855 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:29,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-01 12:42:29,056 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:29,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash -251907342, now seen corresponding path program 1 times [2020-07-01 12:42:29,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:29,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729567898] [2020-07-01 12:42:29,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:29,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729567898] [2020-07-01 12:42:29,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944801199] [2020-07-01 12:42:29,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:29,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 12:42:29,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:29,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:42:29,309 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:29,318 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:29,321 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:42:29,321 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 12:42:29,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:29,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 12:42:29,452 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:29,452 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:42:29,466 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:29,468 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:42:29,471 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:42:29,472 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:42:29,473 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:42:29,473 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2020-07-01 12:42:29,515 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:29,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:29,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2020-07-01 12:42:29,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245392269] [2020-07-01 12:42:29,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:42:29,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:42:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:42:29,521 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. Second operand 15 states. [2020-07-01 12:42:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:31,430 INFO L93 Difference]: Finished difference Result 49 states and 75 transitions. [2020-07-01 12:42:31,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:42:31,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2020-07-01 12:42:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:31,432 INFO L225 Difference]: With dead ends: 49 [2020-07-01 12:42:31,432 INFO L226 Difference]: Without dead ends: 48 [2020-07-01 12:42:31,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2020-07-01 12:42:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-01 12:42:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2020-07-01 12:42:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:42:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2020-07-01 12:42:31,440 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 14 [2020-07-01 12:42:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:31,441 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 59 transitions. [2020-07-01 12:42:31,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:42:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2020-07-01 12:42:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:42:31,442 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:31,442 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:31,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-01 12:42:31,643 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:31,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:31,643 INFO L82 PathProgramCache]: Analyzing trace with hash 709473021, now seen corresponding path program 1 times [2020-07-01 12:42:31,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:31,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616622926] [2020-07-01 12:42:31,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:31,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616622926] [2020-07-01 12:42:31,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812018821] [2020-07-01 12:42:31,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:32,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-01 12:42:32,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:32,014 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_15|], 1=[|v_#valid_22|]} [2020-07-01 12:42:32,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:42:32,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:42:32,020 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:32,030 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:32,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:42:32,038 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:32,047 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:32,048 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:42:32,048 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:42:32,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:42:32,082 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:32,093 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:32,093 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:42:32,094 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-01 12:42:32,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:42:32,137 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:32,154 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:32,156 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:42:32,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-07-01 12:42:32,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:32,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:42:32,279 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:32,280 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:42:32,296 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:32,298 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:42:32,299 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:42:32,300 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:42:32,301 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2020-07-01 12:42:32,394 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:32,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:32,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-07-01 12:42:32,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756011209] [2020-07-01 12:42:32,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-01 12:42:32,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:32,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-01 12:42:32,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2020-07-01 12:42:32,457 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. Second operand 20 states. [2020-07-01 12:42:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:33,561 INFO L93 Difference]: Finished difference Result 87 states and 131 transitions. [2020-07-01 12:42:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 12:42:33,562 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 14 [2020-07-01 12:42:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:33,563 INFO L225 Difference]: With dead ends: 87 [2020-07-01 12:42:33,563 INFO L226 Difference]: Without dead ends: 86 [2020-07-01 12:42:33,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2020-07-01 12:42:33,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-01 12:42:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2020-07-01 12:42:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 12:42:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2020-07-01 12:42:33,575 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 79 transitions. Word has length 14 [2020-07-01 12:42:33,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:33,576 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 79 transitions. [2020-07-01 12:42:33,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-01 12:42:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 79 transitions. [2020-07-01 12:42:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:42:33,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:33,577 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:33,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:33,778 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:33,778 INFO L82 PathProgramCache]: Analyzing trace with hash 709473022, now seen corresponding path program 1 times [2020-07-01 12:42:33,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:33,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14426053] [2020-07-01 12:42:33,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:33,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14426053] [2020-07-01 12:42:33,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123013433] [2020-07-01 12:42:33,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:33,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:42:33,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:33,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:33,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:42:33,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169857556] [2020-07-01 12:42:33,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:42:33,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:33,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:42:33,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:42:33,888 INFO L87 Difference]: Start difference. First operand 50 states and 79 transitions. Second operand 8 states. [2020-07-01 12:42:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:33,992 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2020-07-01 12:42:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:42:33,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-07-01 12:42:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:33,993 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:42:33,993 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 12:42:33,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:42:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 12:42:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-01 12:42:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 12:42:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2020-07-01 12:42:34,003 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 14 [2020-07-01 12:42:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:34,004 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2020-07-01 12:42:34,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:42:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2020-07-01 12:42:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:42:34,005 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:34,005 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:34,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 12:42:34,206 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:34,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2050207448, now seen corresponding path program 2 times [2020-07-01 12:42:34,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:34,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023953174] [2020-07-01 12:42:34,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:34,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023953174] [2020-07-01 12:42:34,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240832993] [2020-07-01 12:42:34,439 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:34,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:42:34,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:42:34,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-01 12:42:34,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:34,514 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:34,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:42:34,515 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:34,531 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 12:42:34,532 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:42:34,532 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 12:42:34,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:42:34,561 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:34,563 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:34,563 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:42:34,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 12:42:34,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:34,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:42:34,643 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:34,644 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:42:34,654 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:34,655 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:42:34,657 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:42:34,657 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-07-01 12:42:34,696 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:42:34,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:34,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2020-07-01 12:42:34,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922218604] [2020-07-01 12:42:34,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-01 12:42:34,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-01 12:42:34,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:42:34,701 INFO L87 Difference]: Start difference. First operand 50 states and 77 transitions. Second operand 16 states. [2020-07-01 12:42:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:35,339 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2020-07-01 12:42:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 12:42:35,340 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2020-07-01 12:42:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:35,340 INFO L225 Difference]: With dead ends: 58 [2020-07-01 12:42:35,340 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:42:35,341 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2020-07-01 12:42:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:42:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2020-07-01 12:42:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:42:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2020-07-01 12:42:35,346 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 18 [2020-07-01 12:42:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:35,346 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2020-07-01 12:42:35,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-01 12:42:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2020-07-01 12:42:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:42:35,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:35,347 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:35,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:35,548 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:42:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:35,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1743781864, now seen corresponding path program 2 times [2020-07-01 12:42:35,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:35,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518221031] [2020-07-01 12:42:35,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:35,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518221031] [2020-07-01 12:42:35,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310530521] [2020-07-01 12:42:35,859 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:35,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:42:35,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:42:35,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-01 12:42:35,914 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:35,918 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_17|], 1=[|v_#valid_23|]} [2020-07-01 12:42:35,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:42:35,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:42:35,922 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:35,928 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:35,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:42:35,933 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:35,939 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:35,939 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:42:35,939 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:42:35,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:42:35,965 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:35,973 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:35,974 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:42:35,974 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-07-01 12:42:36,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:42:36,011 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:36,020 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:36,021 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:42:36,021 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 12:42:36,138 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:36,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:42:36,140 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:36,140 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:42:36,153 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:36,154 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:42:36,155 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:42:36,156 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:42:36,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2020-07-01 12:42:36,226 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:42:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:42:36,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:36,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2020-07-01 12:42:36,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811722619] [2020-07-01 12:42:36,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 12:42:36,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:36,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 12:42:36,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:42:36,231 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 19 states. [2020-07-01 12:42:36,658 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-07-01 12:42:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:38,121 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2020-07-01 12:42:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-01 12:42:38,122 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2020-07-01 12:42:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:38,122 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:42:38,122 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:42:38,123 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2020-07-01 12:42:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:42:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:42:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:42:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:42:38,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2020-07-01 12:42:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:38,124 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:42:38,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 12:42:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:42:38,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:42:38,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:38,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:42:38,608 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 187 [2020-07-01 12:42:46,594 WARN L192 SmtUtils]: Spent 7.90 s on a formula simplification. DAG size of input: 185 DAG size of output: 121 [2020-07-01 12:42:47,413 WARN L192 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 90 [2020-07-01 12:42:47,418 INFO L264 CegarLoopResult]: At program point L25(lines 14 27) the Hoare annotation is: (let ((.cse2 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse21 (select |#length| ULTIMATE.start_cstrspn_~s2.base)) (.cse20 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (<= ULTIMATE.start_cstrspn_~s1.base ULTIMATE.start_cstrspn_~p~0.base)) (.cse11 (= .cse20 ULTIMATE.start_main_~length1~0)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~p~0.base))) (.cse13 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base))) (.cse1 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse20 (- 1))))) (.cse14 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse15 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse4 (= 0 ULTIMATE.start_cstrspn_~s2.offset)) (.cse16 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse5 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse17 (<= 1 .cse21)) (.cse3 (select |#length| ULTIMATE.start_cstrspn_~p~0.base)) (.cse18 (or (and (< 1 ULTIMATE.start_main_~length2~0) .cse2) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse7 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~p~0.base))))) (.cse8 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrspn_~p~0.base) (- 1))) 0)))) (.cse9 (<= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~s1.base)) (.cse10 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse19 (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ .cse21 (- 1))) 0))) (or (let ((.cse6 (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base))) (and .cse0 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~spanp~0.base)) .cse1 .cse2 (<= (+ ULTIMATE.start_cstrspn_~p~0.offset 1) .cse3) .cse4 .cse5 (<= (+ ULTIMATE.start_cstrspn_~spanp~0.offset 1) .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) (+ .cse6 (- 1)))) .cse16 .cse17 .cse18 (<= 1 ULTIMATE.start_main_~length1~0) (<= 1 ULTIMATE.start_cstrspn_~spanp~0.offset) (<= 1 ULTIMATE.start_cstrspn_~p~0.offset) .cse19)) (and .cse0 .cse11 .cse12 .cse13 .cse1 .cse14 .cse15 .cse2 .cse4 .cse16 .cse5 .cse17 (<= 1 .cse3) .cse18 .cse7 .cse8 .cse9 .cse10 .cse19 (= 0 ULTIMATE.start_cstrspn_~p~0.offset) (<= 1 .cse20))))) [2020-07-01 12:42:47,418 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 26) no Hoare annotation was computed. [2020-07-01 12:42:47,418 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-01 12:42:47,418 INFO L268 CegarLoopResult]: For program point L23-3(lines 23 25) no Hoare annotation was computed. [2020-07-01 12:42:47,419 INFO L264 CegarLoopResult]: At program point L23-5(lines 23 25) the Hoare annotation is: (let ((.cse9 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse31 (select |#length| ULTIMATE.start_cstrspn_~s2.base)) (.cse24 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse26 (select |#length| ULTIMATE.start_cstrspn_~p~0.base)) (.cse32 (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base))) (let ((.cse22 (= 0 ULTIMATE.start_cstrspn_~spanp~0.offset)) (.cse23 (exists ((v_prenex_1 Int)) (and (<= ULTIMATE.start_cstrspn_~spanp~0.offset v_prenex_1) (<= (+ v_prenex_1 1) (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) v_prenex_1))))) (.cse0 (<= ULTIMATE.start_cstrspn_~s1.base ULTIMATE.start_cstrspn_~p~0.base)) (.cse25 (= 0 ULTIMATE.start_cstrspn_~c~0)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~spanp~0.base))) (.cse10 (= 0 ULTIMATE.start_cstrspn_~s2.offset)) (.cse12 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse15 (<= (+ ULTIMATE.start_cstrspn_~spanp~0.offset 1) .cse32)) (.cse19 (<= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~s1.base)) (.cse20 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse27 (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (.cse28 (or (<= 2 .cse26) (= 1 .cse26))) (.cse1 (= .cse24 ULTIMATE.start_main_~length1~0)) (.cse29 (<= ULTIMATE.start_cstrspn_~p~0.offset 1)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~p~0.base))) (.cse30 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset))) (.cse4 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base))) (.cse6 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse7 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) (+ .cse32 (- 1))))) (.cse8 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse11 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse13 (<= 1 .cse31)) (.cse14 (or (and (< 1 ULTIMATE.start_main_~length2~0) .cse9) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse16 (<= 1 ULTIMATE.start_cstrspn_~spanp~0.offset)) (.cse18 (<= 1 ULTIMATE.start_cstrspn_~p~0.offset)) (.cse21 (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ .cse31 (- 1))) 0))) (or (and (let ((.cse5 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse24 (- 1))))) (.cse17 (<= 1 ULTIMATE.start_main_~length1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse23 .cse21))) (or .cse25 (<= (+ ULTIMATE.start_cstrspn_~p~0.offset 1) .cse26)) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~p~0.base)))) (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrspn_~p~0.base) (- 1))) 0))) (<= ULTIMATE.start_cstrspn_~p~0.offset .cse26)) (and .cse0 .cse25 .cse2 .cse9 .cse22 .cse10 .cse12 .cse19 .cse20 .cse27 .cse28 .cse1 .cse29 .cse3 .cse30 .cse4 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 .cse18 .cse23 .cse21) (and .cse0 .cse25 .cse2 .cse9 .cse10 .cse12 .cse15 .cse19 .cse20 .cse27 .cse28 (not (= 0 ULTIMATE.start_cstrspn_~sc~0)) .cse1 .cse29 .cse3 .cse30 .cse4 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 .cse16 .cse18 .cse21)))) [2020-07-01 12:42:47,419 INFO L268 CegarLoopResult]: For program point L23-6(lines 23 25) no Hoare annotation was computed. [2020-07-01 12:42:47,419 INFO L268 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2020-07-01 12:42:47,419 INFO L268 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2020-07-01 12:42:47,419 INFO L268 CegarLoopResult]: For program point L32(lines 32 34) no Hoare annotation was computed. [2020-07-01 12:42:47,419 INFO L268 CegarLoopResult]: For program point L32-2(lines 29 43) no Hoare annotation was computed. [2020-07-01 12:42:47,419 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:42:47,419 INFO L268 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-07-01 12:42:47,419 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 12:42:47,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:42:47,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:42:47,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:42:47,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-07-01 12:42:47,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-07-01 12:42:47,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:42:47,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-07-01 12:42:47,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-07-01 12:42:47,420 INFO L268 CegarLoopResult]: For program point L35-1(lines 35 37) no Hoare annotation was computed. [2020-07-01 12:42:47,423 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:42:47,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,445 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,478 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,487 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,487 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,487 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,487 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,488 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,488 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,488 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,488 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,488 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,488 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,489 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,489 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,489 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,490 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,490 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,490 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,490 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,490 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:42:47 BasicIcfg [2020-07-01 12:42:47,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:42:47,522 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:42:47,522 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:42:47,525 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:42:47,526 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:47,526 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:42:23" (1/5) ... [2020-07-01 12:42:47,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3546424c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:42:47, skipping insertion in model container [2020-07-01 12:42:47,527 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:47,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:24" (2/5) ... [2020-07-01 12:42:47,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3546424c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:42:47, skipping insertion in model container [2020-07-01 12:42:47,527 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:47,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:42:24" (3/5) ... [2020-07-01 12:42:47,528 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3546424c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:42:47, skipping insertion in model container [2020-07-01 12:42:47,528 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:47,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:42:24" (4/5) ... [2020-07-01 12:42:47,528 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3546424c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:42:47, skipping insertion in model container [2020-07-01 12:42:47,528 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:47,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:42:47" (5/5) ... [2020-07-01 12:42:47,530 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:42:47,550 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:42:47,550 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:42:47,550 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:42:47,550 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:42:47,550 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:42:47,550 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:42:47,551 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:42:47,551 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:42:47,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-01 12:42:47,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:42:47,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:42:47,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:42:47,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:42:47,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:42:47,563 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:42:47,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-01 12:42:47,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:42:47,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:42:47,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:42:47,565 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:42:47,565 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:42:47,570 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [140] ULTIMATE.startENTRY-->L32: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 17#L32true [92] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 12#L32-2true [78] L32-2-->L35-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 22#L35-1true [111] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 10#L40true [61] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 7#L40-1true [141] L40-1-->L25: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_5) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 v_ULTIMATE.start_cstrspn_~p~0.offset_6) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_7|) (= v_ULTIMATE.start_cstrspn_~p~0.base_7 v_ULTIMATE.start_cstrspn_~s1.base_5) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_6, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_6, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_6|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_4|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_8|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_6, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_7|, #length=|v_#length_12|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_7|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_6, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~p~0.offset, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, #memory_int, ULTIMATE.start_cstrspn_#in~s1.base, ULTIMATE.start_cstrspn_~s2.base] 24#L25true [2020-07-01 12:42:47,570 INFO L796 eck$LassoCheckResult]: Loop: 24#L25true [72] L25-->L22: Formula: (and (= |v_ULTIMATE.start_cstrspn_#t~post0.base_2| v_ULTIMATE.start_cstrspn_~p~0.base_4) (= |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| v_ULTIMATE.start_cstrspn_~p~0.offset_4) (= v_ULTIMATE.start_cstrspn_~p~0.base_3 |v_ULTIMATE.start_cstrspn_#t~post0.base_2|) (= v_ULTIMATE.start_cstrspn_~p~0.offset_3 (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_4, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_4} OutVars{ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_2|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_2|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_3, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_~p~0.offset] 19#L22true [142] L22-->L23-5: Formula: (and (= v_ULTIMATE.start_cstrspn_~s2.base_5 v_ULTIMATE.start_cstrspn_~spanp~0.base_7) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) v_ULTIMATE.start_cstrspn_~c~0_7) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|)) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrspn_~s2.offset_5 v_ULTIMATE.start_cstrspn_~spanp~0.offset_7) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_9|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_8|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_7, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_7|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset] 9#L23-5true [76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base] 20#L23-1true [143] L23-1-->L23-3: Formula: (and (= (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|) |v_ULTIMATE.start_cstrspn_#t~mem3_7|) (= 1 (select |v_#valid_21| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (= |v_ULTIMATE.start_cstrspn_#t~mem3_7| v_ULTIMATE.start_cstrspn_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_9, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_#t~mem3] 14#L23-3true [136] L23-3-->L24: Formula: (< 0 v_ULTIMATE.start_cstrspn_~sc~0_5) InVars {ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_#t~mem3] 23#L24true [90] L24-->L25: Formula: (= v_ULTIMATE.start_cstrspn_~sc~0_6 v_ULTIMATE.start_cstrspn_~c~0_4) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_6} OutVars{ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_6} AuxVars[] AssignedVars[] 24#L25true [2020-07-01 12:42:47,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:47,571 INFO L82 PathProgramCache]: Analyzing trace with hash 688013858, now seen corresponding path program 1 times [2020-07-01 12:42:47,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:47,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099560457] [2020-07-01 12:42:47,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:47,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099560457] [2020-07-01 12:42:47,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:47,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:42:47,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839649924] [2020-07-01 12:42:47,586 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:42:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1212618916, now seen corresponding path program 1 times [2020-07-01 12:42:47,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:47,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592907404] [2020-07-01 12:42:47,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:42:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:42:47,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:42:47,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:47,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:42:47,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:47,707 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-07-01 12:42:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:47,746 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. [2020-07-01 12:42:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:42:47,749 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:42:47,752 INFO L168 Benchmark]: Toolchain (without parser) took 24007.30 ms. Allocated memory was 514.9 MB in the beginning and 724.0 MB in the end (delta: 209.2 MB). Free memory was 438.6 MB in the beginning and 668.9 MB in the end (delta: -230.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:42:47,752 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:42:47,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.16 ms. Allocated memory was 514.9 MB in the beginning and 562.0 MB in the end (delta: 47.2 MB). Free memory was 437.9 MB in the beginning and 528.1 MB in the end (delta: -90.2 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:47,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.17 ms. Allocated memory is still 562.0 MB. Free memory was 528.1 MB in the beginning and 526.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:47,753 INFO L168 Benchmark]: Boogie Preprocessor took 29.64 ms. Allocated memory is still 562.0 MB. Free memory was 526.1 MB in the beginning and 524.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:47,754 INFO L168 Benchmark]: RCFGBuilder took 349.17 ms. Allocated memory is still 562.0 MB. Free memory was 524.1 MB in the beginning and 503.3 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:47,754 INFO L168 Benchmark]: BlockEncodingV2 took 121.32 ms. Allocated memory is still 562.0 MB. Free memory was 503.3 MB in the beginning and 494.5 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:47,755 INFO L168 Benchmark]: TraceAbstraction took 22902.66 ms. Allocated memory was 562.0 MB in the beginning and 709.4 MB in the end (delta: 147.3 MB). Free memory was 493.1 MB in the beginning and 404.8 MB in the end (delta: 88.4 MB). Peak memory consumption was 246.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:47,755 INFO L168 Benchmark]: BuchiAutomizer took 228.98 ms. Allocated memory was 709.4 MB in the beginning and 724.0 MB in the end (delta: 14.7 MB). Free memory was 404.8 MB in the beginning and 668.9 MB in the end (delta: -264.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:42:47,757 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 34 edges - StatisticsResult: Encoded RCFG 22 locations, 39 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 326.16 ms. Allocated memory was 514.9 MB in the beginning and 562.0 MB in the end (delta: 47.2 MB). Free memory was 437.9 MB in the beginning and 528.1 MB in the end (delta: -90.2 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.17 ms. Allocated memory is still 562.0 MB. Free memory was 528.1 MB in the beginning and 526.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 29.64 ms. Allocated memory is still 562.0 MB. Free memory was 526.1 MB in the beginning and 524.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * RCFGBuilder took 349.17 ms. Allocated memory is still 562.0 MB. Free memory was 524.1 MB in the beginning and 503.3 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 121.32 ms. Allocated memory is still 562.0 MB. Free memory was 503.3 MB in the beginning and 494.5 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 22902.66 ms. Allocated memory was 562.0 MB in the beginning and 709.4 MB in the end (delta: 147.3 MB). Free memory was 493.1 MB in the beginning and 404.8 MB in the end (delta: 88.4 MB). Peak memory consumption was 246.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 228.98 ms. Allocated memory was 709.4 MB in the beginning and 724.0 MB in the end (delta: 14.7 MB). Free memory was 404.8 MB in the beginning and 668.9 MB in the end (delta: -264.1 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2020-07-01 12:42:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,786 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,786 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,786 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,786 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,786 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,786 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,787 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-07-01 12:42:47,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,797 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,797 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,797 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,797 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,797 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,798 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((((((((((s1 <= p && unknown-#length-unknown[nondetString1] == length1) && 1 == \valid[spanp]) && 1 == \valid[p]) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && !(nondetString1 == nondetString2)) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 1 == \valid[nondetString2]) && unknown-#length-unknown[nondetString2] == length2) && 0 == s2) && 0 == nondetString2) && 0 == nondetString1) && 1 <= unknown-#length-unknown[s2]) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && spanp + 1 <= unknown-#length-unknown[spanp]) && 1 <= spanp) && 1 <= length1) && 1 <= p) && p <= s1) && 1 == \valid[nondetString1]) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) || (((((((((((((((((((((s1 <= p && unknown-#length-unknown[nondetString1] == length1) && 1 == \valid[spanp]) && 1 == \valid[p]) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && unknown-#length-unknown[nondetString2] == length2) && 0 == spanp) && 0 == s2) && 0 == nondetString2) && 0 == nondetString1) && 1 <= unknown-#length-unknown[s2]) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 1 <= length1) && 1 <= p) && p <= s1) && 1 == \valid[nondetString1]) && (\exists v_prenex_1 : int :: (spanp <= v_prenex_1 && v_prenex_1 + 1 <= unknown-#length-unknown[spanp]) && 0 == unknown-#memory_int-unknown[spanp][v_prenex_1])) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0)) && (0 == c || p + 1 <= unknown-#length-unknown[p])) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[p][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[p] + -1] == 0)) && p <= unknown-#length-unknown[p]) || ((((((((((((((((((((((((s1 <= p && 0 == c) && 1 == \valid[spanp]) && unknown-#length-unknown[nondetString2] == length2) && 0 == spanp) && 0 == s2) && 0 == nondetString1) && p <= s1) && 1 == \valid[nondetString1]) && 1 == nondetString1 + length1) && (2 <= unknown-#length-unknown[p] || 1 == unknown-#length-unknown[p])) && unknown-#length-unknown[nondetString1] == length1) && p <= 1) && 1 == \valid[p]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 1 == \valid[nondetString2]) && 0 == nondetString2) && 1 <= unknown-#length-unknown[s2]) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 1 <= p) && (\exists v_prenex_1 : int :: (spanp <= v_prenex_1 && v_prenex_1 + 1 <= unknown-#length-unknown[spanp]) && 0 == unknown-#memory_int-unknown[spanp][v_prenex_1])) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0)) || (((((((((((((((((((((((((s1 <= p && 0 == c) && 1 == \valid[spanp]) && unknown-#length-unknown[nondetString2] == length2) && 0 == s2) && 0 == nondetString1) && spanp + 1 <= unknown-#length-unknown[spanp]) && p <= s1) && 1 == \valid[nondetString1]) && 1 == nondetString1 + length1) && (2 <= unknown-#length-unknown[p] || 1 == unknown-#length-unknown[p])) && !(0 == sc)) && unknown-#length-unknown[nondetString1] == length1) && p <= 1) && 1 == \valid[p]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 1 == \valid[nondetString2]) && 0 == nondetString2) && 1 <= unknown-#length-unknown[s2]) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 1 <= spanp) && 1 <= p) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:42:47,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:42:47,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:42:47,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:42:47,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:42:47,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:47,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((((((s1 <= p && 1 == \valid[spanp]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#length-unknown[nondetString2] == length2) && p + 1 <= unknown-#length-unknown[p]) && 0 == s2) && 0 == nondetString1) && spanp + 1 <= unknown-#length-unknown[spanp]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[p][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[p] + -1] == 0)) && p <= s1) && 1 == \valid[nondetString1]) && unknown-#length-unknown[nondetString1] == length1) && 1 == \valid[p]) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 0 == nondetString2) && 1 <= unknown-#length-unknown[s2]) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 1 <= length1) && 1 <= spanp) && 1 <= p) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) || ((((((((((((((((((((s1 <= p && unknown-#length-unknown[nondetString1] == length1) && 1 == \valid[p]) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && unknown-#length-unknown[nondetString2] == length2) && 0 == s2) && 0 == nondetString2) && 0 == nondetString1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[p]) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[p][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[p] + -1] == 0)) && p <= s1) && 1 == \valid[nondetString1]) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 0 == p) && 1 <= unknown-#length-unknown[nondetString1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 9 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.6s, OverallIterations: 20, TraceHistogramMax: 3, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 140 SDtfs, 1109 SDslu, 794 SDs, 0 SdLazy, 1888 SolverSat, 293 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 72 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 21 NumberOfFragments, 950 HoareAnnotationTreeSize, 2 FomulaSimplifications, 18029 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 2 FomulaSimplificationsInter, 11907 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 296 ConstructedInterpolants, 19 QuantifiedInterpolants, 43077 SizeOfPredicates, 73 NumberOfNonLiveVariables, 815 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 8/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:42:20.447 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_HICL4x/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:42:48.054 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check