./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4f285607323e922caa9bbc912c8526475badf88 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 05:06:32,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:06:32,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:06:32,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:06:32,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:06:32,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:06:32,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:06:32,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:06:32,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:06:32,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:06:32,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:06:32,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:06:32,560 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:06:32,561 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:06:32,562 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:06:32,563 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:06:32,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:06:32,567 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:06:32,569 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:06:32,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:06:32,573 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:06:32,574 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:06:32,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:06:32,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:06:32,578 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:06:32,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:06:32,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:06:32,582 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:06:32,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:06:32,584 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:06:32,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:06:32,585 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:06:32,585 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:06:32,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:06:32,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:06:32,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:06:32,588 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:06:32,605 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:06:32,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:06:32,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:06:32,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:06:32,607 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:06:32,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:06:32,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:06:32,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:06:32,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:06:32,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:06:32,609 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:06:32,609 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:06:32,609 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:06:32,609 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:06:32,609 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:06:32,610 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:06:32,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:06:32,611 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:06:32,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:06:32,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:06:32,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:06:32,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:06:32,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:06:32,612 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:06:32,612 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:06:32,612 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:06:32,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:06:32,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:06:32,612 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4f285607323e922caa9bbc912c8526475badf88 [2018-12-31 05:06:32,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:06:32,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:06:32,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:06:32,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:06:32,672 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:06:32,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-31 05:06:32,733 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9764d11/a5720f83dc9a4e6cb719430a932df5b2/FLAG6c695df41 [2018-12-31 05:06:33,337 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:06:33,338 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-31 05:06:33,364 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9764d11/a5720f83dc9a4e6cb719430a932df5b2/FLAG6c695df41 [2018-12-31 05:06:33,579 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9764d11/a5720f83dc9a4e6cb719430a932df5b2 [2018-12-31 05:06:33,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:06:33,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:06:33,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:06:33,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:06:33,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:06:33,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:06:33" (1/1) ... [2018-12-31 05:06:33,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e11ba17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:33, skipping insertion in model container [2018-12-31 05:06:33,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:06:33" (1/1) ... [2018-12-31 05:06:33,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:06:33,676 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:06:34,097 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:06:34,109 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:06:34,247 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:06:34,312 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:06:34,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34 WrapperNode [2018-12-31 05:06:34,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:06:34,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:06:34,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:06:34,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:06:34,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... [2018-12-31 05:06:34,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... [2018-12-31 05:06:34,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:06:34,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:06:34,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:06:34,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:06:34,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... [2018-12-31 05:06:34,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... [2018-12-31 05:06:34,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... [2018-12-31 05:06:34,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... [2018-12-31 05:06:34,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... [2018-12-31 05:06:34,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... [2018-12-31 05:06:34,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... [2018-12-31 05:06:34,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:06:34,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:06:34,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:06:34,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:06:34,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:06:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 05:06:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 05:06:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 05:06:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 05:06:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 05:06:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 05:06:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 05:06:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-31 05:06:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:06:34,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:06:35,119 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:06:35,119 INFO L280 CfgBuilder]: Removed 22 assue(true) statements. [2018-12-31 05:06:35,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:06:35 BoogieIcfgContainer [2018-12-31 05:06:35,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:06:35,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:06:35,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:06:35,124 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:06:35,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:06:33" (1/3) ... [2018-12-31 05:06:35,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40614e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:06:35, skipping insertion in model container [2018-12-31 05:06:35,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:06:34" (2/3) ... [2018-12-31 05:06:35,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40614e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:06:35, skipping insertion in model container [2018-12-31 05:06:35,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:06:35" (3/3) ... [2018-12-31 05:06:35,128 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-31 05:06:35,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:06:35,148 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:06:35,166 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:06:35,196 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:06:35,197 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:06:35,197 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:06:35,197 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:06:35,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:06:35,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:06:35,198 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:06:35,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:06:35,198 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:06:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-12-31 05:06:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 05:06:35,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:06:35,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:06:35,224 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:06:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:06:35,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1676857006, now seen corresponding path program 1 times [2018-12-31 05:06:35,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:06:35,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:06:35,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:35,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:06:35,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:06:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:06:35,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:06:35,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 05:06:35,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 05:06:35,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 05:06:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:06:35,438 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-12-31 05:06:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:06:35,501 INFO L93 Difference]: Finished difference Result 58 states and 84 transitions. [2018-12-31 05:06:35,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 05:06:35,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-31 05:06:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:06:35,513 INFO L225 Difference]: With dead ends: 58 [2018-12-31 05:06:35,514 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 05:06:35,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:06:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 05:06:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-12-31 05:06:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 05:06:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-31 05:06:35,553 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2018-12-31 05:06:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:06:35,553 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-31 05:06:35,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 05:06:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-12-31 05:06:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 05:06:35,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:06:35,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:06:35,555 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:06:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:06:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash -819702280, now seen corresponding path program 1 times [2018-12-31 05:06:35,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:06:35,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:06:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:35,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:06:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:06:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:06:35,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:06:35,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:06:35,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:06:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:06:35,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:06:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:06:35,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 05:06:35,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-31 05:06:35,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:06:35,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:06:35,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:06:35,954 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 5 states. [2018-12-31 05:06:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:06:36,177 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-12-31 05:06:36,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:06:36,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-31 05:06:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:06:36,178 INFO L225 Difference]: With dead ends: 52 [2018-12-31 05:06:36,179 INFO L226 Difference]: Without dead ends: 31 [2018-12-31 05:06:36,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:06:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-31 05:06:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-31 05:06:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 05:06:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-12-31 05:06:36,185 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2018-12-31 05:06:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:06:36,186 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-12-31 05:06:36,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:06:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-12-31 05:06:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 05:06:36,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:06:36,187 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:06:36,188 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:06:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:06:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -685873075, now seen corresponding path program 1 times [2018-12-31 05:06:36,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:06:36,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:06:36,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:06:36,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:06:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 05:06:36,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:06:36,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 05:06:36,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 05:06:36,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 05:06:36,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:06:36,606 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 8 states. [2018-12-31 05:06:37,053 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-31 05:06:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:06:37,342 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-31 05:06:37,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:06:37,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-12-31 05:06:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:06:37,344 INFO L225 Difference]: With dead ends: 43 [2018-12-31 05:06:37,344 INFO L226 Difference]: Without dead ends: 40 [2018-12-31 05:06:37,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-31 05:06:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-31 05:06:37,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2018-12-31 05:06:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 05:06:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-31 05:06:37,353 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 25 [2018-12-31 05:06:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:06:37,353 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-31 05:06:37,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 05:06:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-31 05:06:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 05:06:37,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:06:37,355 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:06:37,355 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:06:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:06:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash -685871401, now seen corresponding path program 1 times [2018-12-31 05:06:37,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:06:37,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:06:37,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:37,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:06:37,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:06:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 05:06:37,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:06:37,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 05:06:37,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 05:06:37,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 05:06:37,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 05:06:37,878 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 9 states. [2018-12-31 05:06:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:06:38,403 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-12-31 05:06:38,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 05:06:38,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-12-31 05:06:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:06:38,406 INFO L225 Difference]: With dead ends: 40 [2018-12-31 05:06:38,406 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 05:06:38,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-31 05:06:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 05:06:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2018-12-31 05:06:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 05:06:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-31 05:06:38,414 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 25 [2018-12-31 05:06:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:06:38,415 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-31 05:06:38,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 05:06:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-31 05:06:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 05:06:38,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:06:38,416 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:06:38,417 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:06:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:06:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1992386520, now seen corresponding path program 1 times [2018-12-31 05:06:38,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:06:38,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:06:38,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:38,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:06:38,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:06:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 05:06:38,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:06:38,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 05:06:38,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 05:06:38,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 05:06:38,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-31 05:06:38,788 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 11 states. [2018-12-31 05:06:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:06:39,287 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-12-31 05:06:39,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 05:06:39,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-12-31 05:06:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:06:39,290 INFO L225 Difference]: With dead ends: 54 [2018-12-31 05:06:39,290 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 05:06:39,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2018-12-31 05:06:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 05:06:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-31 05:06:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 05:06:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-31 05:06:39,297 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 27 [2018-12-31 05:06:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:06:39,298 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-31 05:06:39,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 05:06:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-31 05:06:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 05:06:39,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:06:39,299 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:06:39,299 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:06:39,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:06:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash 176881439, now seen corresponding path program 1 times [2018-12-31 05:06:39,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:06:39,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:06:39,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:39,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:06:39,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:06:40,016 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-12-31 05:06:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 05:06:40,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:06:40,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 05:06:40,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 05:06:40,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 05:06:40,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-31 05:06:40,323 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 11 states. [2018-12-31 05:06:40,770 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-12-31 05:06:41,066 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-12-31 05:06:41,291 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2018-12-31 05:06:41,832 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-12-31 05:06:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:06:42,255 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-12-31 05:06:42,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 05:06:42,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-12-31 05:06:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:06:42,257 INFO L225 Difference]: With dead ends: 47 [2018-12-31 05:06:42,258 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 05:06:42,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-12-31 05:06:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 05:06:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2018-12-31 05:06:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 05:06:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-31 05:06:42,267 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2018-12-31 05:06:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:06:42,268 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-31 05:06:42,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 05:06:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-31 05:06:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 05:06:42,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:06:42,269 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:06:42,269 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:06:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:06:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash 176883113, now seen corresponding path program 1 times [2018-12-31 05:06:42,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:06:42,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:06:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:42,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:06:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:06:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:06:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:06:43,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:06:43,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:06:43,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:06:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:06:43,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:06:43,736 INFO L478 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 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-31 05:06:43,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:43,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:43,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-31 05:06:44,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-31 05:06:44,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-12-31 05:06:44,146 INFO L478 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 22 treesize of output 19 [2018-12-31 05:06:44,158 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-31 05:06:44,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 14 [2018-12-31 05:06:44,174 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,203 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:42, output treesize:27 [2018-12-31 05:06:44,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-31 05:06:44,262 INFO L478 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 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-31 05:06:44,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:23 [2018-12-31 05:06:44,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-31 05:06:44,547 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-31 05:06:44,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 35 [2018-12-31 05:06:44,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-31 05:06:44,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,778 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:06:44,785 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:06:44,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-31 05:06:44,874 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-31 05:06:44,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 35 [2018-12-31 05:06:44,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:44,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-31 05:06:44,927 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,942 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,955 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:44,973 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:45,028 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:06:45,033 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:06:45,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 53 [2018-12-31 05:06:45,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 39 [2018-12-31 05:06:45,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-12-31 05:06:45,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-12-31 05:06:45,256 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:45,483 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:45,545 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:45,596 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-31 05:06:45,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 31 [2018-12-31 05:06:45,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:45,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-31 05:06:45,621 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:45,640 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:45,671 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:45,688 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:45,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:45,730 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:147, output treesize:91 [2018-12-31 05:06:46,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:06:46,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:06:46,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:46,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:46,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 190 [2018-12-31 05:06:46,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 188 [2018-12-31 05:06:46,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-12-31 05:06:47,656 INFO L478 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 170 treesize of output 169 [2018-12-31 05:06:47,657 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:48,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:48,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:48,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 177 [2018-12-31 05:06:48,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-31 05:06:48,595 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:48,635 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:49,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:49,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:49,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 185 [2018-12-31 05:06:49,539 INFO L303 Elim1Store]: Index analysis took 142 ms [2018-12-31 05:06:49,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 175 treesize of output 208 [2018-12-31 05:06:49,571 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-12-31 05:06:49,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 151 [2018-12-31 05:06:49,978 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-31 05:06:50,225 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-31 05:06:50,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:50,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 139 [2018-12-31 05:06:50,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:50,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-12-31 05:06:50,699 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:50,730 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:50,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:50,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 134 [2018-12-31 05:06:50,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 39 [2018-12-31 05:06:50,766 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:50,791 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:50,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:06:51,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 182 [2018-12-31 05:06:51,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:51,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 157 treesize of output 168 [2018-12-31 05:06:51,104 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:51,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:51,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 130 treesize of output 141 [2018-12-31 05:06:51,308 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:51,480 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:06:51,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 137 [2018-12-31 05:06:51,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:51,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 70 [2018-12-31 05:06:51,615 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-31 05:06:51,665 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:06:51,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 172 [2018-12-31 05:06:51,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:51,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 163 [2018-12-31 05:06:51,922 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:52,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:52,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 165 [2018-12-31 05:06:52,035 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-12-31 05:06:52,112 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:06:52,257 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:06:52,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 114 [2018-12-31 05:06:52,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:52,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 31 [2018-12-31 05:06:52,282 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:52,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-12-31 05:06:52,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:52,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:52,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-12-31 05:06:52,333 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:52,345 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:52,367 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:52,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:52,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:52,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 187 [2018-12-31 05:06:52,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 160 [2018-12-31 05:06:52,546 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:52,761 INFO L478 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 0 case distinctions, treesize of input 162 treesize of output 161 [2018-12-31 05:06:52,762 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:52,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:52,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 164 [2018-12-31 05:06:53,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2018-12-31 05:06:53,017 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:53,086 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:53,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,246 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:06:53,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 147 [2018-12-31 05:06:53,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2018-12-31 05:06:53,286 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-12-31 05:06:53,356 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:06:53,584 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:06:53,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,624 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:06:53,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 125 [2018-12-31 05:06:53,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,639 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:06:53,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-12-31 05:06:53,640 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:53,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,700 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:06:53,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 56 [2018-12-31 05:06:53,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-12-31 05:06:53,748 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:53,796 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:53,819 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:53,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,828 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:06:53,833 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:06:53,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 141 [2018-12-31 05:06:53,851 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:06:53,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 48 [2018-12-31 05:06:53,853 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:53,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:53,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 61 [2018-12-31 05:06:53,900 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:06:53,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-12-31 05:06:53,903 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:53,919 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:53,940 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-31 05:06:54,065 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 6 variables, input treesize:225, output treesize:348 [2018-12-31 05:06:54,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:54,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2018-12-31 05:06:54,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 15 [2018-12-31 05:06:54,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-12-31 05:06:54,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:54,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-12-31 05:06:54,515 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 05:06:54,516 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:54,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:54,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 166 [2018-12-31 05:06:54,630 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 153 [2018-12-31 05:06:54,631 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 121 [2018-12-31 05:06:54,756 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,836 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 113 [2018-12-31 05:06:54,837 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,917 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 114 [2018-12-31 05:06:54,918 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:54,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:55,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 102 [2018-12-31 05:06:55,005 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:55,100 INFO L267 ElimStorePlain]: Start of recursive call 7: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:06:55,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:55,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:55,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 89 [2018-12-31 05:06:55,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 82 treesize of output 71 [2018-12-31 05:06:55,280 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:55,349 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2018-12-31 05:06:55,349 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:55,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 59 treesize of output 47 [2018-12-31 05:06:55,404 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:06:55,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:55,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2018-12-31 05:06:55,497 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 05:06:55,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-12-31 05:06:55,596 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:55,656 INFO L267 ElimStorePlain]: Start of recursive call 13: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-31 05:06:55,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:55,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:55,807 INFO L303 Elim1Store]: Index analysis took 150 ms [2018-12-31 05:06:55,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 85 [2018-12-31 05:06:55,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-31 05:06:55,837 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:56,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 23 treesize of output 14 [2018-12-31 05:06:56,098 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:56,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 [2018-12-31 05:06:56,215 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:06:56,229 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:06:56,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:56,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 97 [2018-12-31 05:06:56,446 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 05:06:56,447 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:56,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:56,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2018-12-31 05:06:56,475 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:56,496 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:56,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:06:56,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2018-12-31 05:06:56,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-12-31 05:06:56,624 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:56,640 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-12-31 05:06:56,640 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:56,649 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:06:56,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-12-31 05:06:56,755 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 10 variables, input treesize:381, output treesize:79 [2018-12-31 05:06:56,968 INFO L478 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 19 [2018-12-31 05:06:56,983 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-31 05:06:56,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:57,013 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-12-31 05:06:57,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:57,024 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 05:06:57,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 05:06:57,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:06:57,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:06:57,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:18, output treesize:11 [2018-12-31 05:06:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:06:57,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:06:57,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-12-31 05:06:57,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-31 05:06:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-31 05:06:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1281, Unknown=0, NotChecked=0, Total=1406 [2018-12-31 05:06:57,129 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 38 states. [2018-12-31 05:06:58,041 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2018-12-31 05:06:58,575 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2018-12-31 05:06:58,930 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2018-12-31 05:06:59,111 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-12-31 05:06:59,348 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-12-31 05:06:59,802 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 99 [2018-12-31 05:07:00,589 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2018-12-31 05:07:01,257 WARN L181 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 135 [2018-12-31 05:07:02,134 WARN L181 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 157 [2018-12-31 05:07:02,943 WARN L181 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 163 [2018-12-31 05:07:03,743 WARN L181 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 165 [2018-12-31 05:07:04,649 WARN L181 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 159 [2018-12-31 05:07:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:07:04,732 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-12-31 05:07:04,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 05:07:04,735 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 28 [2018-12-31 05:07:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:07:04,736 INFO L225 Difference]: With dead ends: 47 [2018-12-31 05:07:04,736 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 05:07:04,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=657, Invalid=2535, Unknown=0, NotChecked=0, Total=3192 [2018-12-31 05:07:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 05:07:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 05:07:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 05:07:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 05:07:04,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-12-31 05:07:04,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:07:04,739 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 05:07:04,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-31 05:07:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 05:07:04,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 05:07:04,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 05:07:04,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:07:04,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:07:05,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:07:05,105 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 208 [2018-12-31 05:07:05,900 WARN L181 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-12-31 05:07:06,143 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-12-31 05:07:06,939 WARN L181 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 134 [2018-12-31 05:07:07,304 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 111 [2018-12-31 05:07:07,734 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 56 [2018-12-31 05:07:07,870 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-12-31 05:07:08,356 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 57 [2018-12-31 05:07:08,358 INFO L444 ceAbstractionStarter]: At program point L576-2(lines 576 585) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_dll_create_~new_head~0.base))) (.cse1 (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1)) (.cse3 (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1)) (.cse5 (not (= 0 ULTIMATE.start_node_create_~temp~0.base))) (.cse7 (not (= 0 ULTIMATE.start_dll_create_~head~0.base))) (.cse8 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_node_create_~temp~0.base))) (.cse10 (not (= 0 |ULTIMATE.start_node_create_#res.base|))) (.cse6 (= ULTIMATE.start_main_~data~0 1)) (.cse2 (<= (+ |ULTIMATE.start_main_~#s~0.base| 1) |#StackHeapBarrier|)) (.cse11 (= ULTIMATE.start_main_~data~0 ULTIMATE.start_dll_create_~data)) (.cse4 (= 0 |ULTIMATE.start_main_~#s~0.offset|)) (.cse12 (= 0 ULTIMATE.start_dll_create_~head~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 1 ULTIMATE.start_dll_create_~len)) (and (= ULTIMATE.start_dll_create_~new_head~0.offset 0) .cse0 .cse1 .cse2 .cse3 .cse4 (< |#StackHeapBarrier| ULTIMATE.start_dll_create_~new_head~0.base) .cse5 (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| ULTIMATE.start_dll_create_~new_head~0.base) ULTIMATE.start_dll_create_~new_head~0.offset)) .cse6 (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| ULTIMATE.start_dll_create_~head~0.base) 0)) .cse7 .cse8 .cse9 (< |#StackHeapBarrier| ULTIMATE.start_dll_create_~head~0.base) .cse10 .cse11 .cse12) (and .cse6 (= ULTIMATE.start_dll_create_~head~0.base 0) (= ULTIMATE.start_dll_create_~len 2) .cse2 .cse11 .cse4 .cse12))) [2018-12-31 05:07:08,359 INFO L448 ceAbstractionStarter]: For program point L576-3(lines 576 585) no Hoare annotation was computed. [2018-12-31 05:07:08,359 INFO L444 ceAbstractionStarter]: At program point L572(lines 564 573) the Hoare annotation is: (let ((.cse2 (not (= 0 ULTIMATE.start_node_create_~temp~0.base))) (.cse3 (= ULTIMATE.start_main_~data~0 1)) (.cse4 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_node_create_~temp~0.base))) (.cse0 (<= (+ |ULTIMATE.start_main_~#s~0.base| 1) |#StackHeapBarrier|)) (.cse6 (not (= 0 |ULTIMATE.start_node_create_#res.base|))) (.cse7 (= ULTIMATE.start_main_~data~0 ULTIMATE.start_dll_create_~data)) (.cse1 (= 0 |ULTIMATE.start_main_~#s~0.offset|))) (or (and (not (= ULTIMATE.start_dll_create_~head~0.base ULTIMATE.start_node_create_~temp~0.base)) (not (= 0 ULTIMATE.start_dll_create_~new_head~0.base)) (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1) (not (= ULTIMATE.start_dll_create_~head~0.base |ULTIMATE.start_node_create_#res.base|)) .cse0 (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1) .cse1 (< |#StackHeapBarrier| ULTIMATE.start_node_create_~temp~0.base) .cse2 (= 0 ULTIMATE.start_node_create_~temp~0.offset) .cse3 (not (= 0 ULTIMATE.start_dll_create_~head~0.base)) .cse4 .cse5 (< |#StackHeapBarrier| |ULTIMATE.start_node_create_#res.base|) .cse6 .cse7 (<= 1 ULTIMATE.start_dll_create_~len) (= |ULTIMATE.start_node_create_#res.offset| 0)) (and .cse2 .cse3 (= ULTIMATE.start_dll_create_~head~0.base 0) .cse4 .cse5 (= ULTIMATE.start_dll_create_~len 2) .cse0 .cse6 .cse7 .cse1 (= 0 ULTIMATE.start_dll_create_~head~0.offset)))) [2018-12-31 05:07:08,359 INFO L444 ceAbstractionStarter]: At program point L572-1(lines 564 573) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_#res.base|)) (.cse1 (+ |ULTIMATE.start_node_create_#res.offset| 8)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_#res.base|)) (.cse2 (+ |ULTIMATE.start_node_create_#res.offset| 4)) (.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0.base|) |ULTIMATE.start_main_~#s~0.offset|))) (and (not (= 0 |ULTIMATE.start_dll_create_#res.base|)) (= (select .cse0 .cse1) 0) (= ULTIMATE.start_main_~data~0 ULTIMATE.start_node_create_~data) (not (= 0 ULTIMATE.start_dll_create_~new_head~0.base)) (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_append_~head.base) ULTIMATE.start_dll_append_~head.offset) |ULTIMATE.start_node_create_#res.base|)) (= 0 (select .cse0 .cse2)) (= 0 |ULTIMATE.start_dll_create_#res.offset|) (= ULTIMATE.start_node_create_~temp~0.offset 0) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| |ULTIMATE.start_dll_create_#res.base|) 0)) (= (select (select |#memory_int| ULTIMATE.start_dll_create_~new_head~0.base) ULTIMATE.start_dll_create_~new_head~0.offset) ULTIMATE.start_main_~data~0) (not (= 0 ULTIMATE.start_dll_create_~head~0.base)) (< |#StackHeapBarrier| ULTIMATE.start_dll_create_~head~0.base) (= (select .cse3 .cse1) 0) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| |ULTIMATE.start_node_create_#res.base|) |ULTIMATE.start_node_create_#res.offset|)) (<= (+ |ULTIMATE.start_main_~#s~0.base| 2) .cse4) (not (= 0 |ULTIMATE.start_node_create_#res.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_dll_create_#res.base|) (= (select .cse3 .cse2) 0) (not (= ULTIMATE.start_dll_create_~head~0.base ULTIMATE.start_node_create_~temp~0.base)) (= ULTIMATE.start_dll_create_~new_head~0.offset 0) (= |ULTIMATE.start_main_~#s~0.base| ULTIMATE.start_dll_append_~head.base) (< |ULTIMATE.start_main_~#s~0.base| |#StackHeapBarrier|) (not (= ULTIMATE.start_dll_create_~head~0.base |ULTIMATE.start_node_create_#res.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_#res.base|) 1) (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1) (= 0 |ULTIMATE.start_main_~#s~0.offset|) (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1) (< |#StackHeapBarrier| ULTIMATE.start_node_create_~temp~0.base) (= ULTIMATE.start_dll_append_~head.offset |ULTIMATE.start_main_~#s~0.offset|) (< |#StackHeapBarrier| ULTIMATE.start_dll_create_~new_head~0.base) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| .cse4) 0)) (not (= 0 ULTIMATE.start_node_create_~temp~0.base)) (= ULTIMATE.start_main_~data~0 1) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| ULTIMATE.start_dll_create_~head~0.base) 0)) (not (= .cse4 ULTIMATE.start_node_create_~temp~0.base)) (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_dll_append_~head.base) ULTIMATE.start_dll_append_~head.offset)) (< |#StackHeapBarrier| |ULTIMATE.start_node_create_#res.base|) (not (= 0 .cse4)) (= ULTIMATE.start_main_~data~0 ULTIMATE.start_dll_create_~data) (= 0 ULTIMATE.start_dll_create_~head~0.offset) (= |ULTIMATE.start_node_create_#res.offset| 0))) [2018-12-31 05:07:08,359 INFO L448 ceAbstractionStarter]: For program point L601-1(lines 601 603) no Hoare annotation was computed. [2018-12-31 05:07:08,360 INFO L444 ceAbstractionStarter]: At program point L601-3(lines 601 603) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_#res.base|)) (.cse3 (+ |ULTIMATE.start_main_~#s~0.base| 2)) (.cse9 (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_append_~head.base) ULTIMATE.start_dll_append_~head.offset)) (.cse1 (+ |ULTIMATE.start_node_create_#res.offset| 8)) (.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_#res.base|)) (.cse2 (+ |ULTIMATE.start_node_create_#res.offset| 4)) (.cse5 (select |#memory_$Pointer$.offset| ULTIMATE.start_dll_append_~new_last~0.base)) (.cse8 (+ ULTIMATE.start_dll_append_~new_last~0.offset 8)) (.cse7 (select |#memory_$Pointer$.base| ULTIMATE.start_dll_append_~new_last~0.base)) (.cse6 (+ ULTIMATE.start_dll_append_~new_last~0.offset 4)) (.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0.base|) |ULTIMATE.start_main_~#s~0.offset|))) (and (= (select .cse0 .cse1) 0) (= ULTIMATE.start_main_~data~0 ULTIMATE.start_node_create_~data) (not (= 0 ULTIMATE.start_dll_create_~new_head~0.base)) (= 0 (select .cse0 .cse2)) (<= .cse3 .cse4) (not (= 0 |ULTIMATE.start_node_create_#res.base|)) (= (select .cse5 .cse6) 0) (<= .cse3 ULTIMATE.start_dll_append_~new_last~0.base) (= 0 (select .cse7 .cse8)) (< |#StackHeapBarrier| |ULTIMATE.start_dll_create_#res.base|) (not (= ULTIMATE.start_dll_create_~head~0.base ULTIMATE.start_node_create_~temp~0.base)) (= (select |#valid| |ULTIMATE.start_dll_create_#res.base|) 1) (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1) (< |#StackHeapBarrier| ULTIMATE.start_node_create_~temp~0.base) (< |#StackHeapBarrier| ULTIMATE.start_dll_create_~new_head~0.base) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| ULTIMATE.start_dll_create_~head~0.base) 0)) (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1) (not (= .cse9 ULTIMATE.start_dll_append_~new_last~0.base)) (not (= 0 |ULTIMATE.start_dll_create_#res.base|)) (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1) (not (= .cse9 |ULTIMATE.start_node_create_#res.base|)) (= 0 |ULTIMATE.start_dll_create_#res.offset|) (= ULTIMATE.start_node_create_~temp~0.offset 0) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| ULTIMATE.start_dll_append_~new_last~0.base) ULTIMATE.start_dll_append_~new_last~0.offset)) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| |ULTIMATE.start_dll_create_#res.base|) 0)) (= (select (select |#memory_int| ULTIMATE.start_dll_create_~new_head~0.base) ULTIMATE.start_dll_create_~new_head~0.offset) ULTIMATE.start_main_~data~0) (not (= 0 ULTIMATE.start_dll_create_~head~0.base)) (< |#StackHeapBarrier| ULTIMATE.start_dll_create_~head~0.base) (= (select .cse10 .cse1) 0) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| |ULTIMATE.start_node_create_#res.base|) |ULTIMATE.start_node_create_#res.offset|)) (= 0 ULTIMATE.start_dll_append_~new_last~0.offset) (= (select .cse10 .cse2) 0) (= (select .cse5 .cse8) 0) (= ULTIMATE.start_dll_create_~new_head~0.offset 0) (= |ULTIMATE.start_main_~#s~0.base| ULTIMATE.start_dll_append_~head.base) (< |ULTIMATE.start_main_~#s~0.base| |#StackHeapBarrier|) (not (= ULTIMATE.start_dll_create_~head~0.base |ULTIMATE.start_node_create_#res.base|)) (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1) (= 0 |ULTIMATE.start_main_~#s~0.offset|) (= ULTIMATE.start_dll_append_~head.offset |ULTIMATE.start_main_~#s~0.offset|) (= 0 (select .cse7 .cse6)) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| .cse4) 0)) (not (= 0 ULTIMATE.start_node_create_~temp~0.base)) (= ULTIMATE.start_main_~data~0 1) (not (= .cse4 ULTIMATE.start_node_create_~temp~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_dll_append_~head.base) ULTIMATE.start_dll_append_~head.offset)) (< |#StackHeapBarrier| |ULTIMATE.start_node_create_#res.base|) (not (= 0 ULTIMATE.start_dll_append_~new_last~0.base)) (not (= 0 .cse4)) (= ULTIMATE.start_main_~data~0 ULTIMATE.start_dll_create_~data) (= 0 ULTIMATE.start_dll_create_~head~0.offset) (= |ULTIMATE.start_node_create_#res.offset| 0))) [2018-12-31 05:07:08,360 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 606) no Hoare annotation was computed. [2018-12-31 05:07:08,360 INFO L448 ceAbstractionStarter]: For program point L601-4(lines 601 603) no Hoare annotation was computed. [2018-12-31 05:07:08,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 627) no Hoare annotation was computed. [2018-12-31 05:07:08,360 INFO L451 ceAbstractionStarter]: At program point L589-2(lines 589 593) the Hoare annotation is: true [2018-12-31 05:07:08,360 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 05:07:08,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 05:07:08,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 05:07:08,361 INFO L444 ceAbstractionStarter]: At program point L623(lines 608 629) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_dll_create_#res.base|)) (not (= ULTIMATE.start_dll_create_~head~0.base ULTIMATE.start_node_create_~temp~0.base)) (= ULTIMATE.start_main_~data~0 ULTIMATE.start_node_create_~data) (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1) (not (= 0 ULTIMATE.start_dll_create_~new_head~0.base)) (= |ULTIMATE.start_main_~#s~0.base| ULTIMATE.start_dll_append_~head.base) (not (= ULTIMATE.start_dll_create_~head~0.base |ULTIMATE.start_node_create_#res.base|)) (<= (+ |ULTIMATE.start_main_~#s~0.base| 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1) (= 0 |ULTIMATE.start_main_~#s~0.offset|) (< |#StackHeapBarrier| ULTIMATE.start_node_create_~temp~0.base) (not (= 0 ULTIMATE.start_node_create_~temp~0.base)) (= 0 ULTIMATE.start_node_create_~temp~0.offset) (= ULTIMATE.start_main_~data~0 1) (not (= 0 ULTIMATE.start_dll_create_~head~0.base)) (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1) (= 1 (select |#valid| ULTIMATE.start_node_create_~temp~0.base)) (= |ULTIMATE.start_main_~#s~0.offset| ULTIMATE.start_dll_append_~head.offset) (not (= 0 ULTIMATE.start_dll_append_~new_last~0.base)) (< |#StackHeapBarrier| |ULTIMATE.start_node_create_#res.base|) (not (= 0 |ULTIMATE.start_node_create_#res.base|)) (= ULTIMATE.start_main_~data~0 ULTIMATE.start_dll_create_~data) (= |ULTIMATE.start_node_create_#res.offset| 0)) [2018-12-31 05:07:08,361 INFO L444 ceAbstractionStarter]: At program point L586(lines 574 587) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_dll_create_#res.base|)) (= ULTIMATE.start_dll_create_~new_head~0.offset 0) (not (= 0 ULTIMATE.start_dll_create_~new_head~0.base)) (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1) (<= (+ |ULTIMATE.start_main_~#s~0.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_#res.base|) 1) (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1) (= 0 |ULTIMATE.start_main_~#s~0.offset|) (= 0 |ULTIMATE.start_dll_create_#res.offset|) (< |#StackHeapBarrier| ULTIMATE.start_dll_create_~new_head~0.base) (not (= 0 ULTIMATE.start_node_create_~temp~0.base)) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| ULTIMATE.start_dll_create_~new_head~0.base) ULTIMATE.start_dll_create_~new_head~0.offset)) (= ULTIMATE.start_main_~data~0 1) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| ULTIMATE.start_dll_create_~head~0.base) 0)) (not (= 0 ULTIMATE.start_dll_create_~head~0.base)) (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1) (= 1 (select |#valid| ULTIMATE.start_node_create_~temp~0.base)) (< |#StackHeapBarrier| ULTIMATE.start_dll_create_~head~0.base) (= ULTIMATE.start_main_~data~0 (select (select |#memory_int| |ULTIMATE.start_dll_create_#res.base|) |ULTIMATE.start_dll_create_#res.offset|)) (not (= 0 |ULTIMATE.start_node_create_#res.base|)) (= ULTIMATE.start_main_~data~0 ULTIMATE.start_dll_create_~data) (= 0 ULTIMATE.start_dll_create_~head~0.offset) (< |#StackHeapBarrier| |ULTIMATE.start_dll_create_#res.base|)) [2018-12-31 05:07:08,361 INFO L444 ceAbstractionStarter]: At program point L615-2(lines 615 621) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_dll_create_#res.base|)) (not (= ULTIMATE.start_dll_create_~head~0.base ULTIMATE.start_node_create_~temp~0.base)) (= ULTIMATE.start_main_~data~0 ULTIMATE.start_node_create_~data) (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1) (not (= 0 ULTIMATE.start_dll_create_~new_head~0.base)) (= |ULTIMATE.start_main_~#s~0.base| ULTIMATE.start_dll_append_~head.base) (<= (+ |ULTIMATE.start_main_~#s~0.base| 1) |#StackHeapBarrier|) (not (= ULTIMATE.start_dll_create_~head~0.base |ULTIMATE.start_node_create_#res.base|)) (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1) (= 0 |ULTIMATE.start_main_~#s~0.offset|) (< |#StackHeapBarrier| ULTIMATE.start_node_create_~temp~0.base) (= ULTIMATE.start_dll_append_~head.offset |ULTIMATE.start_main_~#s~0.offset|) (not (= 0 ULTIMATE.start_node_create_~temp~0.base)) (= 0 ULTIMATE.start_node_create_~temp~0.offset) (= ULTIMATE.start_main_~data~0 1) (not (= 0 ULTIMATE.start_dll_create_~head~0.base)) (= 1 (select |#valid| ULTIMATE.start_node_create_~temp~0.base)) (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1) (not (= 0 ULTIMATE.start_dll_append_~new_last~0.base)) (< |#StackHeapBarrier| |ULTIMATE.start_node_create_#res.base|) (not (= 0 |ULTIMATE.start_node_create_#res.base|)) (= ULTIMATE.start_main_~data~0 ULTIMATE.start_dll_create_~data) (= |ULTIMATE.start_node_create_#res.offset| 0)) [2018-12-31 05:07:08,361 INFO L448 ceAbstractionStarter]: For program point L615-3(lines 608 629) no Hoare annotation was computed. [2018-12-31 05:07:08,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 05:07:08,361 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-12-31 05:07:08,362 INFO L448 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-12-31 05:07:08,362 INFO L448 ceAbstractionStarter]: For program point L566-2(lines 566 568) no Hoare annotation was computed. [2018-12-31 05:07:08,362 INFO L451 ceAbstractionStarter]: At program point L628(lines 608 629) the Hoare annotation is: true [2018-12-31 05:07:08,362 INFO L448 ceAbstractionStarter]: For program point L566-3(lines 566 568) no Hoare annotation was computed. [2018-12-31 05:07:08,362 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 607) no Hoare annotation was computed. [2018-12-31 05:07:08,362 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-12-31 05:07:08,362 INFO L451 ceAbstractionStarter]: At program point L562-1(line 562) the Hoare annotation is: true [2018-12-31 05:07:08,362 INFO L448 ceAbstractionStarter]: For program point L616(lines 616 618) no Hoare annotation was computed. [2018-12-31 05:07:08,362 INFO L448 ceAbstractionStarter]: For program point L588(lines 588 594) no Hoare annotation was computed. [2018-12-31 05:07:08,362 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 582) no Hoare annotation was computed. [2018-12-31 05:07:08,362 INFO L448 ceAbstractionStarter]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2018-12-31 05:07:08,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,394 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,395 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,396 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,396 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,398 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,398 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,399 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,399 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,430 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,434 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,435 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,435 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,435 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,439 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,439 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,439 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,452 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,452 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,452 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,468 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,468 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,469 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,469 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,469 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,470 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,470 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,476 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,476 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,476 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,489 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,490 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,491 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,492 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,492 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,496 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:07:08 BoogieIcfgContainer [2018-12-31 05:07:08,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:07:08,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:07:08,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:07:08,536 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:07:08,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:06:35" (3/4) ... [2018-12-31 05:07:08,543 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 05:07:08,558 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-31 05:07:08,558 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 05:07:08,560 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 05:07:08,587 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(0 == new_head) && \valid[head] == 1) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[new_head] == 1) && 0 == s) && !(0 == temp)) && data == 1) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && !(0 == \result)) && data == data) && 1 <= len) || (((((((((((((((((new_head == 0 && !(0 == new_head)) && \valid[head] == 1) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[new_head] == 1) && 0 == s) && unknown-#StackHeapBarrier-unknown < new_head) && !(0 == temp)) && data == unknown-#memory_int-unknown[new_head][new_head]) && data == 1) && data == unknown-#memory_int-unknown[head][0]) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && unknown-#StackHeapBarrier-unknown < head) && !(0 == \result)) && data == data) && 0 == head)) || ((((((data == 1 && head == 0) && len == 2) && s + 1 <= unknown-#StackHeapBarrier-unknown) && data == data) && 0 == s) && 0 == head) [2018-12-31 05:07:08,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(0 == \result) && new_head == 0) && !(0 == new_head)) && \valid[head] == 1) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[\result] == 1) && \valid[new_head] == 1) && 0 == s) && 0 == \result) && unknown-#StackHeapBarrier-unknown < new_head) && !(0 == temp)) && data == unknown-#memory_int-unknown[new_head][new_head]) && data == 1) && data == unknown-#memory_int-unknown[head][0]) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && unknown-#StackHeapBarrier-unknown < head) && data == unknown-#memory_int-unknown[\result][\result]) && !(0 == \result)) && data == data) && 0 == head) && unknown-#StackHeapBarrier-unknown < \result [2018-12-31 05:07:08,588 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(head == temp) && !(0 == new_head)) && \valid[head] == 1) && !(head == \result)) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[new_head] == 1) && 0 == s) && unknown-#StackHeapBarrier-unknown < temp) && !(0 == temp)) && 0 == temp) && data == 1) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == \result)) && data == data) && 1 <= len) && \result == 0) || ((((((((((!(0 == temp) && data == 1) && head == 0) && \valid[\result] == 1) && 1 == \valid[temp]) && len == 2) && s + 1 <= unknown-#StackHeapBarrier-unknown) && !(0 == \result)) && data == data) && 0 == s) && 0 == head) [2018-12-31 05:07:08,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((!(0 == \result) && #memory_$Pointer$[\result][\result + 8] == 0) && data == data) && !(0 == new_head)) && \valid[head] == 1) && !(#memory_$Pointer$[head][head] == \result)) && 0 == #memory_$Pointer$[\result][\result + 4]) && 0 == \result) && temp == 0) && data == unknown-#memory_int-unknown[\result][0]) && unknown-#memory_int-unknown[new_head][new_head] == data) && !(0 == head)) && unknown-#StackHeapBarrier-unknown < head) && #memory_$Pointer$[\result][\result + 8] == 0) && data == unknown-#memory_int-unknown[\result][\result]) && s + 2 <= #memory_$Pointer$[s][s]) && !(0 == \result)) && unknown-#StackHeapBarrier-unknown < \result) && #memory_$Pointer$[\result][\result + 4] == 0) && !(head == temp)) && new_head == 0) && s == head) && s < unknown-#StackHeapBarrier-unknown) && !(head == \result)) && \valid[\result] == 1) && \valid[new_head] == 1) && 0 == s) && \valid[temp] == 1) && unknown-#StackHeapBarrier-unknown < temp) && head == s) && unknown-#StackHeapBarrier-unknown < new_head) && data == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0]) && !(0 == temp)) && data == 1) && data == unknown-#memory_int-unknown[head][0]) && !(#memory_$Pointer$[s][s] == temp)) && \valid[\result] == 1) && 0 == #memory_$Pointer$[head][head]) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == #memory_$Pointer$[s][s])) && data == data) && 0 == head) && \result == 0 [2018-12-31 05:07:08,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((((#memory_$Pointer$[\result][\result + 8] == 0 && data == data) && !(0 == new_head)) && 0 == #memory_$Pointer$[\result][\result + 4]) && s + 2 <= #memory_$Pointer$[s][s]) && !(0 == \result)) && #memory_$Pointer$[new_last][new_last + 4] == 0) && s + 2 <= new_last) && 0 == #memory_$Pointer$[new_last][new_last + 8]) && unknown-#StackHeapBarrier-unknown < \result) && !(head == temp)) && \valid[\result] == 1) && \valid[temp] == 1) && unknown-#StackHeapBarrier-unknown < temp) && unknown-#StackHeapBarrier-unknown < new_head) && data == unknown-#memory_int-unknown[head][0]) && \valid[\result] == 1) && !(#memory_$Pointer$[head][head] == new_last)) && !(0 == \result)) && \valid[head] == 1) && !(#memory_$Pointer$[head][head] == \result)) && 0 == \result) && temp == 0) && data == unknown-#memory_int-unknown[new_last][new_last]) && data == unknown-#memory_int-unknown[\result][0]) && unknown-#memory_int-unknown[new_head][new_head] == data) && !(0 == head)) && unknown-#StackHeapBarrier-unknown < head) && #memory_$Pointer$[\result][\result + 8] == 0) && data == unknown-#memory_int-unknown[\result][\result]) && 0 == new_last) && #memory_$Pointer$[\result][\result + 4] == 0) && #memory_$Pointer$[new_last][new_last + 8] == 0) && new_head == 0) && s == head) && s < unknown-#StackHeapBarrier-unknown) && !(head == \result)) && \valid[new_head] == 1) && 0 == s) && head == s) && 0 == #memory_$Pointer$[new_last][new_last + 4]) && data == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0]) && !(0 == temp)) && data == 1) && !(#memory_$Pointer$[s][s] == temp)) && 0 == #memory_$Pointer$[head][head]) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == new_last)) && !(0 == #memory_$Pointer$[s][s])) && data == data) && 0 == head) && \result == 0 [2018-12-31 05:07:08,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(0 == \result) && !(head == temp)) && data == data) && \valid[head] == 1) && !(0 == new_head)) && s == head) && s + 1 <= unknown-#StackHeapBarrier-unknown) && !(head == \result)) && \valid[new_head] == 1) && 0 == s) && unknown-#StackHeapBarrier-unknown < temp) && head == s) && !(0 == temp)) && 0 == temp) && data == 1) && !(0 == head)) && 1 == \valid[temp]) && \valid[\result] == 1) && !(0 == new_last)) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == \result)) && data == data) && \result == 0 [2018-12-31 05:07:08,590 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(0 == \result) && !(head == temp)) && data == data) && \valid[head] == 1) && !(0 == new_head)) && s == head) && !(head == \result)) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[new_head] == 1) && 0 == s) && unknown-#StackHeapBarrier-unknown < temp) && !(0 == temp)) && 0 == temp) && data == 1) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && s == head) && !(0 == new_last)) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == \result)) && data == data) && \result == 0 [2018-12-31 05:07:08,617 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:07:08,618 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:07:08,618 INFO L168 Benchmark]: Toolchain (without parser) took 35033.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.0 MB). Free memory was 948.7 MB in the beginning and 998.7 MB in the end (delta: -50.0 MB). Peak memory consumption was 369.9 MB. Max. memory is 11.5 GB. [2018-12-31 05:07:08,620 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:07:08,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-31 05:07:08,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:07:08,621 INFO L168 Benchmark]: Boogie Preprocessor took 48.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:07:08,621 INFO L168 Benchmark]: RCFGBuilder took 694.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-31 05:07:08,621 INFO L168 Benchmark]: TraceAbstraction took 33413.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 278.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.5 MB). Peak memory consumption was 492.0 MB. Max. memory is 11.5 GB. [2018-12-31 05:07:08,624 INFO L168 Benchmark]: Witness Printer took 82.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 998.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-31 05:07:08,627 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 725.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 694.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33413.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 278.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.5 MB). Peak memory consumption was 492.0 MB. Max. memory is 11.5 GB. * Witness Printer took 82.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 998.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - 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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - 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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 627]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 608]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 576]: Loop Invariant [2018-12-31 05:07:08,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((((((((((!(0 == new_head) && \valid[head] == 1) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[new_head] == 1) && 0 == s) && !(0 == temp)) && data == 1) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && !(0 == \result)) && data == data) && 1 <= len) || (((((((((((((((((new_head == 0 && !(0 == new_head)) && \valid[head] == 1) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[new_head] == 1) && 0 == s) && unknown-#StackHeapBarrier-unknown < new_head) && !(0 == temp)) && data == unknown-#memory_int-unknown[new_head][new_head]) && data == 1) && data == unknown-#memory_int-unknown[head][0]) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && unknown-#StackHeapBarrier-unknown < head) && !(0 == \result)) && data == data) && 0 == head)) || ((((((data == 1 && head == 0) && len == 2) && s + 1 <= unknown-#StackHeapBarrier-unknown) && data == data) && 0 == s) && 0 == head) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 564]: Loop Invariant [2018-12-31 05:07:08,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((((((((((((!(head == temp) && !(0 == new_head)) && \valid[head] == 1) && !(head == \result)) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[new_head] == 1) && 0 == s) && unknown-#StackHeapBarrier-unknown < temp) && !(0 == temp)) && 0 == temp) && data == 1) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == \result)) && data == data) && 1 <= len) && \result == 0) || ((((((((((!(0 == temp) && data == 1) && head == 0) && \valid[\result] == 1) && 1 == \valid[temp]) && len == 2) && s + 1 <= unknown-#StackHeapBarrier-unknown) && !(0 == \result)) && data == data) && 0 == s) && 0 == head) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 601]: Loop Invariant [2018-12-31 05:07:08,644 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,645 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,645 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,646 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,646 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,647 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,647 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,647 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,648 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,648 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,648 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,649 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,649 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,649 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,649 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,658 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,658 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,659 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,659 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,659 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,664 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,664 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,664 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,664 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,670 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,670 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,672 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,672 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,672 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,678 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,678 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,691 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,691 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,691 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,691 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((#memory_$Pointer$[\result][\result + 8] == 0 && data == data) && !(0 == new_head)) && 0 == #memory_$Pointer$[\result][\result + 4]) && s + 2 <= #memory_$Pointer$[s][s]) && !(0 == \result)) && #memory_$Pointer$[new_last][new_last + 4] == 0) && s + 2 <= new_last) && 0 == #memory_$Pointer$[new_last][new_last + 8]) && unknown-#StackHeapBarrier-unknown < \result) && !(head == temp)) && \valid[\result] == 1) && \valid[temp] == 1) && unknown-#StackHeapBarrier-unknown < temp) && unknown-#StackHeapBarrier-unknown < new_head) && data == unknown-#memory_int-unknown[head][0]) && \valid[\result] == 1) && !(#memory_$Pointer$[head][head] == new_last)) && !(0 == \result)) && \valid[head] == 1) && !(#memory_$Pointer$[head][head] == \result)) && 0 == \result) && temp == 0) && data == unknown-#memory_int-unknown[new_last][new_last]) && data == unknown-#memory_int-unknown[\result][0]) && unknown-#memory_int-unknown[new_head][new_head] == data) && !(0 == head)) && unknown-#StackHeapBarrier-unknown < head) && #memory_$Pointer$[\result][\result + 8] == 0) && data == unknown-#memory_int-unknown[\result][\result]) && 0 == new_last) && #memory_$Pointer$[\result][\result + 4] == 0) && #memory_$Pointer$[new_last][new_last + 8] == 0) && new_head == 0) && s == head) && s < unknown-#StackHeapBarrier-unknown) && !(head == \result)) && \valid[new_head] == 1) && 0 == s) && head == s) && 0 == #memory_$Pointer$[new_last][new_last + 4]) && data == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0]) && !(0 == temp)) && data == 1) && !(#memory_$Pointer$[s][s] == temp)) && 0 == #memory_$Pointer$[head][head]) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == new_last)) && !(0 == #memory_$Pointer$[s][s])) && data == data) && 0 == head) && \result == 0 - InvariantResult [Line: 564]: Loop Invariant [2018-12-31 05:07:08,698 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,699 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,699 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,700 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,700 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,700 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,701 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,701 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,701 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,701 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,702 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,702 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,716 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,719 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,719 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,720 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,720 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,720 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,724 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,724 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,724 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:07:08,725 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:07:08,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:07:08,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,735 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((!(0 == \result) && #memory_$Pointer$[\result][\result + 8] == 0) && data == data) && !(0 == new_head)) && \valid[head] == 1) && !(#memory_$Pointer$[head][head] == \result)) && 0 == #memory_$Pointer$[\result][\result + 4]) && 0 == \result) && temp == 0) && data == unknown-#memory_int-unknown[\result][0]) && unknown-#memory_int-unknown[new_head][new_head] == data) && !(0 == head)) && unknown-#StackHeapBarrier-unknown < head) && #memory_$Pointer$[\result][\result + 8] == 0) && data == unknown-#memory_int-unknown[\result][\result]) && s + 2 <= #memory_$Pointer$[s][s]) && !(0 == \result)) && unknown-#StackHeapBarrier-unknown < \result) && #memory_$Pointer$[\result][\result + 4] == 0) && !(head == temp)) && new_head == 0) && s == head) && s < unknown-#StackHeapBarrier-unknown) && !(head == \result)) && \valid[\result] == 1) && \valid[new_head] == 1) && 0 == s) && \valid[temp] == 1) && unknown-#StackHeapBarrier-unknown < temp) && head == s) && unknown-#StackHeapBarrier-unknown < new_head) && data == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0]) && !(0 == temp)) && data == 1) && data == unknown-#memory_int-unknown[head][0]) && !(#memory_$Pointer$[s][s] == temp)) && \valid[\result] == 1) && 0 == #memory_$Pointer$[head][head]) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == #memory_$Pointer$[s][s])) && data == data) && 0 == head) && \result == 0 - InvariantResult [Line: 589]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 615]: Loop Invariant [2018-12-31 05:07:08,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((((((((((((((((((!(0 == \result) && !(head == temp)) && data == data) && \valid[head] == 1) && !(0 == new_head)) && s == head) && s + 1 <= unknown-#StackHeapBarrier-unknown) && !(head == \result)) && \valid[new_head] == 1) && 0 == s) && unknown-#StackHeapBarrier-unknown < temp) && head == s) && !(0 == temp)) && 0 == temp) && data == 1) && !(0 == head)) && 1 == \valid[temp]) && \valid[\result] == 1) && !(0 == new_last)) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == \result)) && data == data) && \result == 0 - InvariantResult [Line: 574]: Loop Invariant [2018-12-31 05:07:08,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:07:08,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((((((((((((((((((!(0 == \result) && new_head == 0) && !(0 == new_head)) && \valid[head] == 1) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[\result] == 1) && \valid[new_head] == 1) && 0 == s) && 0 == \result) && unknown-#StackHeapBarrier-unknown < new_head) && !(0 == temp)) && data == unknown-#memory_int-unknown[new_head][new_head]) && data == 1) && data == unknown-#memory_int-unknown[head][0]) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && unknown-#StackHeapBarrier-unknown < head) && data == unknown-#memory_int-unknown[\result][\result]) && !(0 == \result)) && data == data) && 0 == head) && unknown-#StackHeapBarrier-unknown < \result - InvariantResult [Line: 608]: Loop Invariant [2018-12-31 05:07:08,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:07:08,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((((((((((((((((((!(0 == \result) && !(head == temp)) && data == data) && \valid[head] == 1) && !(0 == new_head)) && s == head) && !(head == \result)) && s + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[new_head] == 1) && 0 == s) && unknown-#StackHeapBarrier-unknown < temp) && !(0 == temp)) && 0 == temp) && data == 1) && !(0 == head)) && \valid[\result] == 1) && 1 == \valid[temp]) && s == head) && !(0 == new_last)) && unknown-#StackHeapBarrier-unknown < \result) && !(0 == \result)) && data == data) && \result == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. SAFE Result, 33.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 900 SDslu, 415 SDs, 0 SdLazy, 905 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 31 NumberOfFragments, 1056 HoareAnnotationTreeSize, 11 FomulaSimplifications, 3953 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 11 FomulaSimplificationsInter, 4201 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 203 ConstructedInterpolants, 2 QuantifiedInterpolants, 84060 SizeOfPredicates, 50 NumberOfNonLiveVariables, 357 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 39/51 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...