./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db17479a00afa98e4ce70a37e790a923b748e4dc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db17479a00afa98e4ce70a37e790a923b748e4dc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:31:17,507 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:31:17,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:31:17,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:31:17,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:31:17,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:31:17,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:31:17,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:31:17,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:31:17,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:31:17,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:31:17,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:31:17,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:31:17,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:31:17,519 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:31:17,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:31:17,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:31:17,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:31:17,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:31:17,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:31:17,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:31:17,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:31:17,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:31:17,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:31:17,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:31:17,525 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:31:17,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:31:17,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:31:17,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:31:17,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:31:17,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:31:17,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:31:17,527 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:31:17,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:31:17,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:31:17,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:31:17,528 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 07:31:17,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:31:17,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:31:17,536 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:31:17,536 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:31:17,536 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:31:17,536 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:31:17,536 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:31:17,536 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:31:17,537 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:31:17,537 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:31:17,537 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:31:17,537 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:31:17,537 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:31:17,537 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:31:17,537 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:31:17,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:31:17,537 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:31:17,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:31:17,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:31:17,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:31:17,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:31:17,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:31:17,539 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:31:17,539 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:31:17,539 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:31:17,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:31:17,539 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 07:31:17,539 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan 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 -> Taipan 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 -> db17479a00afa98e4ce70a37e790a923b748e4dc [2018-12-03 07:31:17,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:31:17,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:31:17,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:31:17,566 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:31:17,566 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:31:17,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:31:17,601 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data/3e17d995a/2ff8274971db448b8cd31dd358f05699/FLAGfe54994d0 [2018-12-03 07:31:18,058 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:31:18,058 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:31:18,064 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data/3e17d995a/2ff8274971db448b8cd31dd358f05699/FLAGfe54994d0 [2018-12-03 07:31:18,072 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data/3e17d995a/2ff8274971db448b8cd31dd358f05699 [2018-12-03 07:31:18,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:31:18,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:31:18,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:31:18,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:31:18,078 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:31:18,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae65c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18, skipping insertion in model container [2018-12-03 07:31:18,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:31:18,103 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:31:18,254 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:31:18,301 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:31:18,326 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:31:18,346 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:31:18,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18 WrapperNode [2018-12-03 07:31:18,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:31:18,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:31:18,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:31:18,347 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:31:18,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:31:18,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:31:18,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:31:18,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:31:18,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... [2018-12-03 07:31:18,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:31:18,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:31:18,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:31:18,384 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:31:18,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/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-03 07:31:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 07:31:18,415 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 07:31:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:31:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 07:31:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 07:31:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-03 07:31:18,415 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-03 07:31:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:31:18,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:31:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:31:18,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:31:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-12-03 07:31:18,415 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-12-03 07:31:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:31:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:31:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-03 07:31:18,416 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-03 07:31:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:31:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-03 07:31:18,416 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-03 07:31:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-12-03 07:31:18,416 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-12-03 07:31:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:31:18,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:31:18,582 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:31:18,583 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 07:31:18,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:31:18 BoogieIcfgContainer [2018-12-03 07:31:18,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:31:18,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:31:18,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:31:18,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:31:18,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:31:18" (1/3) ... [2018-12-03 07:31:18,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1eefff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:31:18, skipping insertion in model container [2018-12-03 07:31:18,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:18" (2/3) ... [2018-12-03 07:31:18,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1eefff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:31:18, skipping insertion in model container [2018-12-03 07:31:18,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:31:18" (3/3) ... [2018-12-03 07:31:18,587 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:31:18,593 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:31:18,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:31:18,606 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:31:18,624 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:31:18,624 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:31:18,624 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:31:18,624 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:31:18,624 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:31:18,624 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:31:18,624 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:31:18,624 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:31:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-12-03 07:31:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 07:31:18,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:18,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:18,640 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:18,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1072166703, now seen corresponding path program 1 times [2018-12-03 07:31:18,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:31:18,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:18,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:18,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:18,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:31:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:18,756 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-03 07:31:18,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:31:18,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:31:18,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:31:18,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:31:18,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:31:18,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:31:18,770 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-12-03 07:31:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:18,822 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2018-12-03 07:31:18,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:31:18,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-03 07:31:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:18,829 INFO L225 Difference]: With dead ends: 105 [2018-12-03 07:31:18,829 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 07:31:18,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:31:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 07:31:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-12-03 07:31:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 07:31:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-03 07:31:18,863 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 32 [2018-12-03 07:31:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:18,864 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-03 07:31:18,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:31:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-03 07:31:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 07:31:18,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:18,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:18,866 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:18,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash -169920805, now seen corresponding path program 1 times [2018-12-03 07:31:18,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:31:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:18,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:18,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:31:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 07:31:18,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:31:18,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:31:18,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:31:18,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:31:18,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:31:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:31:18,935 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-12-03 07:31:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:18,971 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-03 07:31:18,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:31:18,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-03 07:31:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:18,972 INFO L225 Difference]: With dead ends: 73 [2018-12-03 07:31:18,972 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 07:31:18,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:31:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 07:31:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-03 07:31:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 07:31:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-03 07:31:18,977 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 40 [2018-12-03 07:31:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:18,977 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-03 07:31:18,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:31:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-03 07:31:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 07:31:18,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:18,978 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:18,979 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:18,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1184429299, now seen corresponding path program 1 times [2018-12-03 07:31:18,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:31:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:18,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:31:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 07:31:19,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:31:19,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:31:19,045 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-03 07:31:19,046 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-03 07:31:19,066 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:31:19,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:31:19,210 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:31:19,211 INFO L272 AbstractInterpreter]: Visited 29 different actions 54 times. Merged at 6 different actions 9 times. Never widened. Performed 559 root evaluator evaluations with a maximum evaluation depth of 4. Performed 559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-03 07:31:19,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:19,220 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:31:19,284 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 83.36% of their original sizes. [2018-12-03 07:31:19,284 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:31:19,438 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-03 07:31:19,438 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:31:19,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:31:19,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-12-03 07:31:19,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:31:19,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 07:31:19,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 07:31:19,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-12-03 07:31:19,440 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 20 states. [2018-12-03 07:31:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:20,310 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-12-03 07:31:20,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 07:31:20,310 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-12-03 07:31:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:20,311 INFO L225 Difference]: With dead ends: 83 [2018-12-03 07:31:20,311 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 07:31:20,311 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-12-03 07:31:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 07:31:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-12-03 07:31:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 07:31:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-12-03 07:31:20,317 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 48 [2018-12-03 07:31:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:20,317 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-12-03 07:31:20,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 07:31:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-12-03 07:31:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 07:31:20,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:20,318 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:20,318 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:20,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1965105618, now seen corresponding path program 1 times [2018-12-03 07:31:20,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:31:20,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:20,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:20,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:20,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:31:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:31:20,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:31:20,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:31:20,374 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-03 07:31:20,374 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-03 07:31:20,375 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:31:20,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:31:20,439 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:31:20,439 INFO L272 AbstractInterpreter]: Visited 39 different actions 94 times. Merged at 10 different actions 21 times. Never widened. Performed 811 root evaluator evaluations with a maximum evaluation depth of 4. Performed 811 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 5 different actions. Largest state had 31 variables. [2018-12-03 07:31:20,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:20,444 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:31:20,478 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 88.49% of their original sizes. [2018-12-03 07:31:20,478 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:31:20,595 INFO L418 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-12-03 07:31:20,595 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:31:20,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:31:20,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [5] total 25 [2018-12-03 07:31:20,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:31:20,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 07:31:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 07:31:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-12-03 07:31:20,596 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 22 states. [2018-12-03 07:31:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:21,469 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-12-03 07:31:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 07:31:21,469 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-12-03 07:31:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:21,470 INFO L225 Difference]: With dead ends: 78 [2018-12-03 07:31:21,470 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 07:31:21,470 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-12-03 07:31:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 07:31:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-12-03 07:31:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 07:31:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-12-03 07:31:21,476 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 49 [2018-12-03 07:31:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:21,477 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-12-03 07:31:21,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 07:31:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-12-03 07:31:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 07:31:21,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:21,478 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:21,478 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:21,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1526544909, now seen corresponding path program 1 times [2018-12-03 07:31:21,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:31:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:21,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:21,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:31:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:31:21,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:31:21,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:31:21,521 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-03 07:31:21,521 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-03 07:31:21,522 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:31:21,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:31:21,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:31:21,570 INFO L272 AbstractInterpreter]: Visited 46 different actions 103 times. Merged at 11 different actions 22 times. Never widened. Performed 841 root evaluator evaluations with a maximum evaluation depth of 4. Performed 841 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 6 different actions. Largest state had 31 variables. [2018-12-03 07:31:21,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:21,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:31:21,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:31:21,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/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-03 07:31:21,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:21,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:31:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:21,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:31:21,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:31:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:31:21,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:31:21,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 07:31:21,708 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:31:21,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:31:21,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:31:21,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:31:21,709 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 5 states. [2018-12-03 07:31:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:21,743 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-12-03 07:31:21,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:31:21,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-03 07:31:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:21,744 INFO L225 Difference]: With dead ends: 89 [2018-12-03 07:31:21,744 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 07:31:21,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:31:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 07:31:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-12-03 07:31:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 07:31:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-12-03 07:31:21,752 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 50 [2018-12-03 07:31:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:21,752 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-12-03 07:31:21,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:31:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-12-03 07:31:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 07:31:21,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:21,753 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:21,754 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:21,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash 500095555, now seen corresponding path program 2 times [2018-12-03 07:31:21,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:31:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:21,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:31:21,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:31:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:31:22,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:31:22,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:31:22,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:31:22,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:31:22,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:31:22,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/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-03 07:31:22,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:31:22,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 07:31:22,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 07:31:22,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:31:22,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:22,676 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-03 07:31:22,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:22,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:22,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 07:31:22,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:31:22,731 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 10 treesize of output 9 [2018-12-03 07:31:22,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:22,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:22,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:22,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-03 07:31:22,900 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-03 07:31:22,902 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-03 07:31:22,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:22,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:25 [2018-12-03 07:31:23,848 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 07:31:23,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:23,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:23,856 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-03 07:31:23,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,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 24 treesize of output 25 [2018-12-03 07:31:23,870 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 13 treesize of output 16 [2018-12-03 07:31:23,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:23,873 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 16 treesize of output 23 [2018-12-03 07:31:23,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:24 [2018-12-03 07:31:23,935 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 11 treesize of output 8 [2018-12-03 07:31:23,937 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 8 treesize of output 7 [2018-12-03 07:31:23,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,950 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 11 treesize of output 8 [2018-12-03 07:31:23,951 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 8 treesize of output 7 [2018-12-03 07:31:23,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,963 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 23 treesize of output 28 [2018-12-03 07:31:23,965 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 12 treesize of output 1 [2018-12-03 07:31:23,965 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,968 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:23,974 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:55, output treesize:36 [2018-12-03 07:31:24,022 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2018-12-03 07:31:24,024 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 12 treesize of output 11 [2018-12-03 07:31:24,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,046 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-03 07:31:24,048 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 12 treesize of output 11 [2018-12-03 07:31:24,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,065 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 39 treesize of output 26 [2018-12-03 07:31:24,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:24,072 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 26 treesize of output 16 [2018-12-03 07:31:24,072 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:24,083 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:98, output treesize:55 [2018-12-03 07:31:24,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:24,493 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:31:24,500 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 158 [2018-12-03 07:31:24,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:24,504 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 38 treesize of output 53 [2018-12-03 07:31:24,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:24,538 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:31:24,544 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 87 treesize of output 93 [2018-12-03 07:31:24,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:24,548 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 38 treesize of output 22 [2018-12-03 07:31:24,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,569 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:31:24,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:24,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-03 07:31:24,573 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:31:24,573 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-12-03 07:31:24,574 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,577 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:24,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:24,587 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:165, output treesize:68 [2018-12-03 07:31:25,980 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int) (sll_circular_update_at_~data Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base|) .cse0 sll_circular_update_at_~data)) |c_#memory_int|)))) is different from true [2018-12-03 07:31:25,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:25,991 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 35 treesize of output 40 [2018-12-03 07:31:25,993 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 10 treesize of output 9 [2018-12-03 07:31:25,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:25,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:26,020 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2018-12-03 07:31:26,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:26,025 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 0 case distinctions, treesize of input 60 treesize of output 61 [2018-12-03 07:31:26,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:26,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:26,051 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 59 treesize of output 60 [2018-12-03 07:31:26,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:26,055 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 41 treesize of output 38 [2018-12-03 07:31:26,056 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:26,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:26,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:26,073 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:122, output treesize:68 [2018-12-03 07:31:26,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 136 [2018-12-03 07:31:26,611 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 104 treesize of output 98 [2018-12-03 07:31:26,612 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-03 07:31:26,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:26,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:26,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2018-12-03 07:31:26,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:27,083 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 118 treesize of output 113 [2018-12-03 07:31:27,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:27,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 101 [2018-12-03 07:31:27,300 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:27,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:27,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:27,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-12-03 07:31:27,526 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-03 07:31:27,788 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 98 treesize of output 90 [2018-12-03 07:31:27,790 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:28,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 92 [2018-12-03 07:31:28,286 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-03 07:31:28,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2018-12-03 07:31:28,544 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:28,546 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 81 treesize of output 69 [2018-12-03 07:31:28,547 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:28,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 86 [2018-12-03 07:31:28,785 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 07:31:29,051 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 99 [2018-12-03 07:31:29,053 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:31:29,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 101 [2018-12-03 07:31:29,361 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:29,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 91 [2018-12-03 07:31:29,633 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:29,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 91 [2018-12-03 07:31:29,914 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-03 07:31:30,186 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 91 treesize of output 86 [2018-12-03 07:31:30,186 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:30,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2018-12-03 07:31:30,550 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:31,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2018-12-03 07:31:31,554 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:31,826 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 104 treesize of output 99 [2018-12-03 07:31:31,827 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:32,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-12-03 07:31:32,155 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:32,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:32,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:32,853 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 92 treesize of output 86 [2018-12-03 07:31:32,854 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:33,143 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 90 [2018-12-03 07:31:33,144 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:31:33,151 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 1 case distinctions, treesize of input 81 treesize of output 78 [2018-12-03 07:31:33,152 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:31:33,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:33,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:33,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2018-12-03 07:31:33,470 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:33,790 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 91 treesize of output 86 [2018-12-03 07:31:33,791 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:34,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 86 [2018-12-03 07:31:34,101 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:34,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 23 dim-1 vars, End of recursive call: 21 dim-0 vars, and 15 xjuncts. [2018-12-03 07:31:34,757 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 80 treesize of output 66 [2018-12-03 07:31:34,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2018-12-03 07:31:34,760 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:34,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-12-03 07:31:34,774 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:34,778 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:34,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 106 [2018-12-03 07:31:34,793 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 98 treesize of output 85 [2018-12-03 07:31:34,794 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:34,879 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 85 treesize of output 76 [2018-12-03 07:31:34,879 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:34,963 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 94 treesize of output 85 [2018-12-03 07:31:34,963 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,047 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 94 treesize of output 81 [2018-12-03 07:31:35,047 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 85 treesize of output 80 [2018-12-03 07:31:35,133 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 76 treesize of output 71 [2018-12-03 07:31:35,211 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,291 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 80 treesize of output 62 [2018-12-03 07:31:35,291 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,401 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 77 treesize of output 68 [2018-12-03 07:31:35,401 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 68 treesize of output 58 [2018-12-03 07:31:35,451 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,492 INFO L267 ElimStorePlain]: Start of recursive call 31: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 94 [2018-12-03 07:31:35,502 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 90 treesize of output 81 [2018-12-03 07:31:35,503 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,540 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 81 treesize of output 76 [2018-12-03 07:31:35,540 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,586 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 86 treesize of output 73 [2018-12-03 07:31:35,586 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,619 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 76 treesize of output 71 [2018-12-03 07:31:35,620 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,651 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 71 treesize of output 58 [2018-12-03 07:31:35,652 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,683 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 73 treesize of output 64 [2018-12-03 07:31:35,683 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,714 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 64 treesize of output 54 [2018-12-03 07:31:35,714 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,732 INFO L267 ElimStorePlain]: Start of recursive call 41: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,737 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 86 [2018-12-03 07:31:35,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-12-03 07:31:35,740 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,753 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 21 treesize of output 11 [2018-12-03 07:31:35,754 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,766 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 32 treesize of output 19 [2018-12-03 07:31:35,766 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,775 INFO L267 ElimStorePlain]: Start of recursive call 49: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 102 [2018-12-03 07:31:35,789 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 90 treesize of output 72 [2018-12-03 07:31:35,790 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,868 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 72 treesize of output 63 [2018-12-03 07:31:35,868 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:35,946 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 94 treesize of output 85 [2018-12-03 07:31:35,946 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,022 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 85 treesize of output 72 [2018-12-03 07:31:36,022 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,097 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 72 treesize of output 67 [2018-12-03 07:31:36,097 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,169 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 67 treesize of output 62 [2018-12-03 07:31:36,169 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,237 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 86 treesize of output 68 [2018-12-03 07:31:36,237 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,309 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 63 treesize of output 58 [2018-12-03 07:31:36,309 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,361 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 68 treesize of output 54 [2018-12-03 07:31:36,361 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,408 INFO L267 ElimStorePlain]: Start of recursive call 53: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,416 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 88 treesize of output 82 [2018-12-03 07:31:36,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 56 [2018-12-03 07:31:36,419 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,450 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 78 treesize of output 65 [2018-12-03 07:31:36,451 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,476 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 56 treesize of output 42 [2018-12-03 07:31:36,476 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,500 INFO L267 ElimStorePlain]: Start of recursive call 63: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 94 [2018-12-03 07:31:36,511 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 90 treesize of output 85 [2018-12-03 07:31:36,512 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,549 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 85 treesize of output 72 [2018-12-03 07:31:36,549 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,585 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 72 treesize of output 63 [2018-12-03 07:31:36,585 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,617 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 63 treesize of output 58 [2018-12-03 07:31:36,618 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,649 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 86 treesize of output 77 [2018-12-03 07:31:36,649 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,679 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 77 treesize of output 72 [2018-12-03 07:31:36,679 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,708 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 72 treesize of output 54 [2018-12-03 07:31:36,708 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,727 INFO L267 ElimStorePlain]: Start of recursive call 67: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,734 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 88 treesize of output 82 [2018-12-03 07:31:36,736 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 78 treesize of output 65 [2018-12-03 07:31:36,737 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,763 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 69 treesize of output 52 [2018-12-03 07:31:36,763 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,791 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 52 treesize of output 42 [2018-12-03 07:31:36,791 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,818 INFO L267 ElimStorePlain]: Start of recursive call 75: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2018-12-03 07:31:36,822 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 47 treesize of output 30 [2018-12-03 07:31:36,822 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:31:36,831 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,837 INFO L267 ElimStorePlain]: Start of recursive call 79: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 94 [2018-12-03 07:31:36,851 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 90 treesize of output 81 [2018-12-03 07:31:36,851 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,888 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 81 treesize of output 76 [2018-12-03 07:31:36,888 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,932 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 86 treesize of output 72 [2018-12-03 07:31:36,933 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:36,984 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 76 treesize of output 63 [2018-12-03 07:31:36,984 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,032 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 72 treesize of output 59 [2018-12-03 07:31:37,032 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,076 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 63 treesize of output 58 [2018-12-03 07:31:37,076 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,120 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 59 treesize of output 54 [2018-12-03 07:31:37,120 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,154 INFO L267 ElimStorePlain]: Start of recursive call 82: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,165 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 96 treesize of output 90 [2018-12-03 07:31:37,168 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 86 treesize of output 77 [2018-12-03 07:31:37,168 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 77 treesize of output 67 [2018-12-03 07:31:37,217 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,255 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 67 treesize of output 54 [2018-12-03 07:31:37,256 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 77 treesize of output 67 [2018-12-03 07:31:37,284 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,309 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 67 treesize of output 50 [2018-12-03 07:31:37,309 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,328 INFO L267 ElimStorePlain]: Start of recursive call 90: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 86 [2018-12-03 07:31:37,336 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 21 treesize of output 11 [2018-12-03 07:31:37,336 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,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 5 treesize of output 1 [2018-12-03 07:31:37,349 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,362 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 32 treesize of output 19 [2018-12-03 07:31:37,362 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,374 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 5 treesize of output 1 [2018-12-03 07:31:37,374 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,383 INFO L267 ElimStorePlain]: Start of recursive call 96: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2018-12-03 07:31:37,390 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 1 [2018-12-03 07:31:37,390 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2018-12-03 07:31:37,402 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,409 INFO L267 ElimStorePlain]: Start of recursive call 101: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 106 [2018-12-03 07:31:37,424 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 98 treesize of output 85 [2018-12-03 07:31:37,425 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 85 treesize of output 80 [2018-12-03 07:31:37,514 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,599 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 94 treesize of output 81 [2018-12-03 07:31:37,599 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,683 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 94 treesize of output 81 [2018-12-03 07:31:37,684 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,771 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 81 treesize of output 67 [2018-12-03 07:31:37,771 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 67 treesize of output 62 [2018-12-03 07:31:37,845 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:37,956 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 77 treesize of output 68 [2018-12-03 07:31:37,956 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 68 treesize of output 58 [2018-12-03 07:31:38,012 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,069 INFO L267 ElimStorePlain]: Start of recursive call 104: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,077 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 88 treesize of output 86 [2018-12-03 07:31:38,079 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 78 treesize of output 60 [2018-12-03 07:31:38,080 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,109 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 78 treesize of output 73 [2018-12-03 07:31:38,110 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-12-03 07:31:38,139 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,166 INFO L267 ElimStorePlain]: Start of recursive call 113: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 31 [2018-12-03 07:31:38,430 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 24 treesize of output 15 [2018-12-03 07:31:38,430 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,434 INFO L267 ElimStorePlain]: Start of recursive call 117: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2018-12-03 07:31:38,442 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 52 treesize of output 45 [2018-12-03 07:31:38,442 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,468 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 45 treesize of output 36 [2018-12-03 07:31:38,468 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,493 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 48 treesize of output 39 [2018-12-03 07:31:38,493 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,515 INFO L267 ElimStorePlain]: Start of recursive call 119: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:31:38,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 39 [2018-12-03 07:31:38,518 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 24 treesize of output 15 [2018-12-03 07:31:38,518 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,524 INFO L267 ElimStorePlain]: Start of recursive call 123: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-03 07:31:38,527 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 24 treesize of output 15 [2018-12-03 07:31:38,527 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,536 INFO L267 ElimStorePlain]: Start of recursive call 125: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-03 07:31:38,540 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 7 [2018-12-03 07:31:38,540 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,548 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 9 treesize of output 1 [2018-12-03 07:31:38,549 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,553 INFO L267 ElimStorePlain]: Start of recursive call 127: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,555 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 34 treesize of output 28 [2018-12-03 07:31:38,556 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 9 treesize of output 1 [2018-12-03 07:31:38,556 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,562 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 7 [2018-12-03 07:31:38,562 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,565 INFO L267 ElimStorePlain]: Start of recursive call 130: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-03 07:31:38,568 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 24 treesize of output 15 [2018-12-03 07:31:38,568 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,574 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 60 [2018-12-03 07:31:38,582 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 52 treesize of output 43 [2018-12-03 07:31:38,582 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,613 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 56 treesize of output 47 [2018-12-03 07:31:38,613 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,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 47 treesize of output 40 [2018-12-03 07:31:38,641 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,666 INFO L267 ElimStorePlain]: Start of recursive call 135: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:31:38,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-03 07:31:38,671 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 9 treesize of output 1 [2018-12-03 07:31:38,671 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,681 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 7 [2018-12-03 07:31:38,681 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,689 INFO L267 ElimStorePlain]: Start of recursive call 139: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 60 [2018-12-03 07:31:38,697 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 56 treesize of output 49 [2018-12-03 07:31:38,698 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,728 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 49 treesize of output 40 [2018-12-03 07:31:38,729 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,756 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 52 treesize of output 43 [2018-12-03 07:31:38,756 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,781 INFO L267 ElimStorePlain]: Start of recursive call 142: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:31:38,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-03 07:31:38,784 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 24 treesize of output 15 [2018-12-03 07:31:38,785 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,792 INFO L267 ElimStorePlain]: Start of recursive call 146: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-03 07:31:38,796 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 9 treesize of output 1 [2018-12-03 07:31:38,796 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,806 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 7 [2018-12-03 07:31:38,806 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,813 INFO L267 ElimStorePlain]: Start of recursive call 148: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-03 07:31:38,818 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 9 treesize of output 1 [2018-12-03 07:31:38,818 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,825 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 7 [2018-12-03 07:31:38,825 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,830 INFO L267 ElimStorePlain]: Start of recursive call 151: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-03 07:31:38,834 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 9 treesize of output 1 [2018-12-03 07:31:38,834 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,843 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 7 [2018-12-03 07:31:38,843 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,850 INFO L267 ElimStorePlain]: Start of recursive call 154: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-03 07:31:38,855 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 7 [2018-12-03 07:31:38,855 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,867 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 9 treesize of output 1 [2018-12-03 07:31:38,867 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,874 INFO L267 ElimStorePlain]: Start of recursive call 157: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:38,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 07:31:38,945 INFO L202 ElimStorePlain]: Needed 159 recursive calls to eliminate 9 variables, input treesize:153, output treesize:37 [2018-12-03 07:31:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2018-12-03 07:31:39,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:31:39,559 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-03 07:31:39,564 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-03 07:31:39,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:39,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:39,607 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-03 07:31:39,613 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-03 07:31:39,626 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:39,630 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:39,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-03 07:31:39,640 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:151, output treesize:91 [2018-12-03 07:31:39,837 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-03 07:31:40,375 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-03 07:31:40,390 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-12-03 07:31:40,606 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:31:40,607 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 07:31:40,609 INFO L168 Benchmark]: Toolchain (without parser) took 22534.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.7 MB). Free memory was 947.0 MB in the beginning and 1.3 GB in the end (delta: -371.7 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. [2018-12-03 07:31:40,610 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:31:40,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:31:40,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.45 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-03 07:31:40,610 INFO L168 Benchmark]: Boogie Preprocessor took 19.29 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-03 07:31:40,610 INFO L168 Benchmark]: RCFGBuilder took 199.19 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.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:31:40,611 INFO L168 Benchmark]: TraceAbstraction took 22025.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 304.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.8 MB). Peak memory consumption was 82.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:31:40,612 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.45 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 19.29 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.19 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.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22025.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 304.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.8 MB). Peak memory consumption was 82.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:31:41,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:31:41,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:31:41,916 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:31:41,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:31:41,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:31:41,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:31:41,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:31:41,919 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:31:41,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:31:41,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:31:41,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:31:41,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:31:41,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:31:41,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:31:41,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:31:41,922 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:31:41,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:31:41,924 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:31:41,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:31:41,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:31:41,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:31:41,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:31:41,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:31:41,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:31:41,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:31:41,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:31:41,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:31:41,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:31:41,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:31:41,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:31:41,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:31:41,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:31:41,930 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:31:41,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:31:41,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:31:41,931 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 07:31:41,938 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:31:41,938 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:31:41,939 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:31:41,939 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:31:41,939 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:31:41,939 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:31:41,939 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:31:41,939 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:31:41,939 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:31:41,939 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:31:41,940 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:31:41,940 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:31:41,940 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:31:41,940 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:31:41,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:31:41,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:31:41,940 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:31:41,940 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 07:31:41,940 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 07:31:41,941 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:31:41,941 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:31:41,941 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 07:31:41,941 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:31:41,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:31:41,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:31:41,941 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:31:41,941 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:31:41,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:31:41,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:31:41,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:31:41,942 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:31:41,942 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 07:31:41,942 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:31:41,942 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 07:31:41,942 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 07:31:41,942 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan 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 -> Taipan 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 -> db17479a00afa98e4ce70a37e790a923b748e4dc [2018-12-03 07:31:41,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:31:41,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:31:41,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:31:41,971 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:31:41,971 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:31:41,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:31:42,008 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data/6476ade13/a898f97f138343c59e4edc72f7366cd8/FLAG04a52ba2e [2018-12-03 07:31:42,402 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:31:42,402 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:31:42,409 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data/6476ade13/a898f97f138343c59e4edc72f7366cd8/FLAG04a52ba2e [2018-12-03 07:31:42,760 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/data/6476ade13/a898f97f138343c59e4edc72f7366cd8 [2018-12-03 07:31:42,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:31:42,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:31:42,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:31:42,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:31:42,773 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:31:42,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:31:42" (1/1) ... [2018-12-03 07:31:42,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785ac8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:42, skipping insertion in model container [2018-12-03 07:31:42,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:31:42" (1/1) ... [2018-12-03 07:31:42,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:31:42,804 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:31:42,959 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:31:42,967 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:31:42,997 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:31:43,054 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:31:43,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43 WrapperNode [2018-12-03 07:31:43,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:31:43,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:31:43,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:31:43,055 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:31:43,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... [2018-12-03 07:31:43,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... [2018-12-03 07:31:43,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:31:43,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:31:43,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:31:43,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:31:43,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... [2018-12-03 07:31:43,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... [2018-12-03 07:31:43,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... [2018-12-03 07:31:43,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... [2018-12-03 07:31:43,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... [2018-12-03 07:31:43,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... [2018-12-03 07:31:43,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... [2018-12-03 07:31:43,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:31:43,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:31:43,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:31:43,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:31:43,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/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-03 07:31:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 07:31:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 07:31:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:31:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-03 07:31:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-03 07:31:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:31:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:31:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-12-03 07:31:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-03 07:31:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-03 07:31:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-03 07:31:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-12-03 07:31:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-12-03 07:31:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:31:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:31:43,333 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:31:43,333 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 07:31:43,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:31:43 BoogieIcfgContainer [2018-12-03 07:31:43,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:31:43,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:31:43,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:31:43,336 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:31:43,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:31:42" (1/3) ... [2018-12-03 07:31:43,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e996c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:31:43, skipping insertion in model container [2018-12-03 07:31:43,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:31:43" (2/3) ... [2018-12-03 07:31:43,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e996c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:31:43, skipping insertion in model container [2018-12-03 07:31:43,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:31:43" (3/3) ... [2018-12-03 07:31:43,338 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:31:43,343 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:31:43,347 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:31:43,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:31:43,372 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 07:31:43,372 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:31:43,373 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:31:43,373 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:31:43,373 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:31:43,373 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:31:43,373 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:31:43,373 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:31:43,373 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:31:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-12-03 07:31:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 07:31:43,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:43,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:43,387 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:43,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:43,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1776900725, now seen corresponding path program 1 times [2018-12-03 07:31:43,393 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:31:43,393 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:31:43,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:43,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:43,504 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-03 07:31:43,504 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:31:43,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:31:43,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:31:43,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:31:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:31:43,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:31:43,518 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 5 states. [2018-12-03 07:31:43,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:43,623 INFO L93 Difference]: Finished difference Result 99 states and 131 transitions. [2018-12-03 07:31:43,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:31:43,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-03 07:31:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:43,632 INFO L225 Difference]: With dead ends: 99 [2018-12-03 07:31:43,632 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 07:31:43,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:31:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 07:31:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-12-03 07:31:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 07:31:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-03 07:31:43,662 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 31 [2018-12-03 07:31:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:43,662 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-03 07:31:43,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:31:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-03 07:31:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 07:31:43,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:43,664 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:43,664 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:43,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:43,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1601339917, now seen corresponding path program 1 times [2018-12-03 07:31:43,665 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:31:43,665 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:31:43,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:43,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 07:31:43,780 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:31:43,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:31:43,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:31:43,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:31:43,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:31:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:31:43,784 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-03 07:31:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:43,837 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-12-03 07:31:43,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:31:43,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-03 07:31:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:43,839 INFO L225 Difference]: With dead ends: 64 [2018-12-03 07:31:43,839 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 07:31:43,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:31:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 07:31:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-12-03 07:31:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 07:31:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-03 07:31:43,847 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2018-12-03 07:31:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:43,848 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-03 07:31:43,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:31:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-03 07:31:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 07:31:43,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:43,849 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:43,849 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:43,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1095764041, now seen corresponding path program 1 times [2018-12-03 07:31:43,850 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:31:43,850 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:31:43,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:43,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 07:31:43,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:31:43,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:31:43,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:31:43,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:31:43,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:31:43,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:31:43,971 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 6 states. [2018-12-03 07:31:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:44,038 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-12-03 07:31:44,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:31:44,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-03 07:31:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:44,042 INFO L225 Difference]: With dead ends: 76 [2018-12-03 07:31:44,042 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 07:31:44,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:31:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 07:31:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-12-03 07:31:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 07:31:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-03 07:31:44,052 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 47 [2018-12-03 07:31:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:44,052 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-03 07:31:44,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:31:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-03 07:31:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 07:31:44,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:44,053 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:44,054 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:44,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2124761295, now seen corresponding path program 1 times [2018-12-03 07:31:44,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:31:44,054 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:31:44,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:44,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:31:44,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:31:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:31:44,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:31:44,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:31:44,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:44,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:31:44,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:31:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:31:44,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:31:44,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2018-12-03 07:31:44,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:31:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:31:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:31:44,366 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 10 states. [2018-12-03 07:31:44,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:44,504 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2018-12-03 07:31:44,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:31:44,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-12-03 07:31:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:44,506 INFO L225 Difference]: With dead ends: 88 [2018-12-03 07:31:44,506 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 07:31:44,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-12-03 07:31:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 07:31:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2018-12-03 07:31:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 07:31:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-12-03 07:31:44,513 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 48 [2018-12-03 07:31:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:44,514 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-12-03 07:31:44,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:31:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-12-03 07:31:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 07:31:44,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:44,515 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:44,515 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:44,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash 711402375, now seen corresponding path program 2 times [2018-12-03 07:31:44,515 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:31:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:31:44,532 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:31:44,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-03 07:31:44,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:31:44,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:31:44,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:31:44,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:31:44,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:31:44,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:31:44,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:31:44,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:31:44,616 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 6 states. [2018-12-03 07:31:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:31:44,673 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-12-03 07:31:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:31:44,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-03 07:31:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:31:44,674 INFO L225 Difference]: With dead ends: 78 [2018-12-03 07:31:44,674 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 07:31:44,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:31:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 07:31:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-03 07:31:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 07:31:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2018-12-03 07:31:44,681 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 56 [2018-12-03 07:31:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:31:44,681 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2018-12-03 07:31:44,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:31:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-12-03 07:31:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 07:31:44,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:31:44,682 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:31:44,682 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:31:44,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:31:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2117596392, now seen corresponding path program 1 times [2018-12-03 07:31:44,683 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:31:44,683 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:31:44,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:31:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:44,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:44,865 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-03 07:31:44,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:44,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:44,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:31:44,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:44,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:44,930 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-03 07:31:44,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:44,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:44,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-03 07:31:44,961 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 11 treesize of output 8 [2018-12-03 07:31:44,963 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 8 treesize of output 7 [2018-12-03 07:31:44,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:44,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:44,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:44,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-03 07:31:45,012 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-03 07:31:45,016 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 12 treesize of output 11 [2018-12-03 07:31:45,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:45,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:45,041 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 19 treesize of output 12 [2018-12-03 07:31:45,044 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 12 treesize of output 11 [2018-12-03 07:31:45,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:45,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:45,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:45,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2018-12-03 07:31:45,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-03 07:31:45,390 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 18 treesize of output 17 [2018-12-03 07:31:45,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:45,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:45,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:45,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-12-03 07:31:45,538 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:31:45,570 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 131 treesize of output 132 [2018-12-03 07:31:45,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-12-03 07:31:45,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:31:45,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:31:45,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:45,701 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:31:45,722 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 90 treesize of output 96 [2018-12-03 07:31:45,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 9 [2018-12-03 07:31:45,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:45,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:45,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:45,747 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:31:45,766 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 92 treesize of output 98 [2018-12-03 07:31:45,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-12-03 07:31:45,788 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-03 07:31:45,810 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:31:45,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:31:45,856 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:139, output treesize:101 [2018-12-03 07:31:56,642 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 07:31:56,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:56,678 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 36 treesize of output 41 [2018-12-03 07:31:56,682 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 10 treesize of output 9 [2018-12-03 07:31:56,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:56,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:56,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-12-03 07:31:56,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:56,769 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 0 case distinctions, treesize of input 43 treesize of output 40 [2018-12-03 07:31:56,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:56,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:56,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-12-03 07:31:56,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:56,824 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 37 treesize of output 29 [2018-12-03 07:31:56,824 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:56,832 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:56,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:56,848 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:39 [2018-12-03 07:31:57,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2018-12-03 07:31:57,560 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 46 treesize of output 35 [2018-12-03 07:31:57,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:57,589 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 35 treesize of output 16 [2018-12-03 07:31:57,589 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:57,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 9 [2018-12-03 07:31:57,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:57,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:57,647 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 17 treesize of output 21 [2018-12-03 07:31:57,649 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 17 treesize of output 15 [2018-12-03 07:31:57,650 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:57,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-03 07:31:57,661 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:57,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:57,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:57,665 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:71, output treesize:9 [2018-12-03 07:31:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 07:31:57,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:31:58,849 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-03 07:31:58,955 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-03 07:31:58,959 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-03 07:31:58,966 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-03 07:31:58,986 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:58,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:58,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 07:31:58,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:41 [2018-12-03 07:31:59,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:31:59,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:31:59,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:31:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:31:59,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:31:59,259 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-03 07:31:59,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:31:59,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:59,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:31:59,711 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 13 treesize of output 4 [2018-12-03 07:31:59,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-03 07:31:59,811 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 11 treesize of output 8 [2018-12-03 07:31:59,813 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 8 treesize of output 7 [2018-12-03 07:31:59,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,828 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 11 treesize of output 8 [2018-12-03 07:31:59,830 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 8 treesize of output 7 [2018-12-03 07:31:59,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-12-03 07:31:59,948 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-03 07:31:59,951 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 12 treesize of output 11 [2018-12-03 07:31:59,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,985 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-03 07:31:59,987 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 12 treesize of output 11 [2018-12-03 07:31:59,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:31:59,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:00,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:00,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:38 [2018-12-03 07:32:00,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-03 07:32:00,679 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 18 treesize of output 17 [2018-12-03 07:32:00,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:00,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:00,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:00,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-12-03 07:32:00,736 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 119 treesize of output 114 [2018-12-03 07:32:00,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-12-03 07:32:00,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:00,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:32:00,865 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2018-12-03 07:32:00,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 9 [2018-12-03 07:32:00,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:00,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:00,895 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 89 [2018-12-03 07:32:00,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-12-03 07:32:00,922 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-03 07:32:00,940 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:32:00,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:32:00,993 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:143, output treesize:109 [2018-12-03 07:32:01,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-12-03 07:32:01,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:01,295 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 43 treesize of output 37 [2018-12-03 07:32:01,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:01,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:01,376 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 37 treesize of output 42 [2018-12-03 07:32:01,381 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 10 treesize of output 9 [2018-12-03 07:32:01,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:01,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:01,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-12-03 07:32:01,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:32:01,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 38 [2018-12-03 07:32:01,434 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:01,443 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:01,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:01,461 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:95, output treesize:44 [2018-12-03 07:32:02,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-12-03 07:32:02,517 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 48 treesize of output 29 [2018-12-03 07:32:02,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,538 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 29 treesize of output 18 [2018-12-03 07:32:02,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,556 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:32:02,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 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-03 07:32:02,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,587 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-03 07:32:02,589 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-03 07:32:02,590 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,605 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-03 07:32:02,605 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 07:32:02,617 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,617 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,635 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 17 treesize of output 21 [2018-12-03 07:32:02,638 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 17 treesize of output 15 [2018-12-03 07:32:02,638 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,653 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 11 treesize of output 9 [2018-12-03 07:32:02,653 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,671 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-12-03 07:32:02,672 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,673 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:32:02,675 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:87, output treesize:7 [2018-12-03 07:32:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 07:32:02,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:32:03,452 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-03 07:32:03,563 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-03 07:32:03,567 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-03 07:32:03,574 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-03 07:32:03,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:03,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:03,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 07:32:03,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:48 [2018-12-03 07:32:03,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:32:03,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 50 [2018-12-03 07:32:03,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 07:32:03,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 07:32:03,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3452, Unknown=19, NotChecked=0, Total=3660 [2018-12-03 07:32:03,894 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 50 states. [2018-12-03 07:32:44,089 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-03 07:33:32,012 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-03 07:33:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:33:52,957 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2018-12-03 07:33:52,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 07:33:52,958 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-12-03 07:33:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:33:52,959 INFO L225 Difference]: With dead ends: 125 [2018-12-03 07:33:52,959 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 07:33:52,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 57.9s TimeCoverageRelationStatistics Valid=433, Invalid=6835, Unknown=42, NotChecked=0, Total=7310 [2018-12-03 07:33:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 07:33:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2018-12-03 07:33:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 07:33:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2018-12-03 07:33:52,983 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 57 [2018-12-03 07:33:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:33:52,983 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2018-12-03 07:33:52,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 07:33:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2018-12-03 07:33:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 07:33:52,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:33:52,985 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:33:52,985 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:33:52,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:52,985 INFO L82 PathProgramCache]: Analyzing trace with hash 377755047, now seen corresponding path program 2 times [2018-12-03 07:33:52,986 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:33:52,986 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:33:52,999 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:33:53,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:33:53,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:33:53,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:33:53,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:33:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:33:53,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:33:53,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:33:53,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:33:53,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:33:53,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:33:53,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:33:53,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:33:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 07:33:53,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:33:53,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-03 07:33:53,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 07:33:53,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 07:33:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-03 07:33:53,926 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 18 states. [2018-12-03 07:33:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:33:54,796 INFO L93 Difference]: Finished difference Result 177 states and 246 transitions. [2018-12-03 07:33:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 07:33:54,797 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-12-03 07:33:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:33:54,798 INFO L225 Difference]: With dead ends: 177 [2018-12-03 07:33:54,798 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 07:33:54,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-03 07:33:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 07:33:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2018-12-03 07:33:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 07:33:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 189 transitions. [2018-12-03 07:33:54,824 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 189 transitions. Word has length 58 [2018-12-03 07:33:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:33:54,825 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 189 transitions. [2018-12-03 07:33:54,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 07:33:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 189 transitions. [2018-12-03 07:33:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 07:33:54,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:33:54,826 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:33:54,826 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:33:54,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash 151269484, now seen corresponding path program 3 times [2018-12-03 07:33:54,827 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:33:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:33:54,846 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-03 07:33:54,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 07:33:54,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:33:54,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:33:55,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:33:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:33:55,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:33:55,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:33:55,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:33:55,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 07:33:55,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:33:55,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:33:55,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:33:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 07:33:55,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:33:55,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7, 7] total 15 [2018-12-03 07:33:55,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 07:33:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 07:33:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 07:33:55,762 INFO L87 Difference]: Start difference. First operand 135 states and 189 transitions. Second operand 15 states. [2018-12-03 07:33:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:33:55,949 INFO L93 Difference]: Finished difference Result 194 states and 268 transitions. [2018-12-03 07:33:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:33:55,950 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-12-03 07:33:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:33:55,952 INFO L225 Difference]: With dead ends: 194 [2018-12-03 07:33:55,952 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 07:33:55,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 216 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-03 07:33:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 07:33:55,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-12-03 07:33:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 07:33:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2018-12-03 07:33:55,972 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 58 [2018-12-03 07:33:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:33:55,972 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2018-12-03 07:33:55,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 07:33:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2018-12-03 07:33:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 07:33:55,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:33:55,973 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:33:55,973 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:33:55,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash 504576000, now seen corresponding path program 4 times [2018-12-03 07:33:55,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:33:55,974 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:33:55,992 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:33:56,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:33:56,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:33:56,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:33:56,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:33:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:33:56,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:33:56,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:33:56,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:33:56,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:33:56,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:33:56,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:33:56,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:33:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:33:56,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:33:56,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-03 07:33:56,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 07:33:56,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 07:33:56,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-03 07:33:56,747 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand 18 states. [2018-12-03 07:33:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:33:57,475 INFO L93 Difference]: Finished difference Result 209 states and 269 transitions. [2018-12-03 07:33:57,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 07:33:57,475 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-12-03 07:33:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:33:57,476 INFO L225 Difference]: With dead ends: 209 [2018-12-03 07:33:57,476 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 07:33:57,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-03 07:33:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 07:33:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-12-03 07:33:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 07:33:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 172 transitions. [2018-12-03 07:33:57,491 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 172 transitions. Word has length 58 [2018-12-03 07:33:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:33:57,491 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 172 transitions. [2018-12-03 07:33:57,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 07:33:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 172 transitions. [2018-12-03 07:33:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 07:33:57,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:33:57,492 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:33:57,492 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:33:57,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:57,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1942991232, now seen corresponding path program 5 times [2018-12-03 07:33:57,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:33:57,492 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:33:57,505 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-03 07:33:57,627 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-03 07:33:57,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:33:57,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 07:33:57,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:33:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 07:33:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:33:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2018-12-03 07:33:57,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 07:33:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 07:33:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:33:57,855 INFO L87 Difference]: Start difference. First operand 133 states and 172 transitions. Second operand 11 states. [2018-12-03 07:33:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:33:58,009 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2018-12-03 07:33:58,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:33:58,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-12-03 07:33:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:33:58,010 INFO L225 Difference]: With dead ends: 148 [2018-12-03 07:33:58,010 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 07:33:58,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:33:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 07:33:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 07:33:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 07:33:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2018-12-03 07:33:58,021 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 65 [2018-12-03 07:33:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:33:58,021 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2018-12-03 07:33:58,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 07:33:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2018-12-03 07:33:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 07:33:58,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:33:58,022 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:33:58,022 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:33:58,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:33:58,022 INFO L82 PathProgramCache]: Analyzing trace with hash -452304837, now seen corresponding path program 1 times [2018-12-03 07:33:58,023 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:33:58,023 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:33:58,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:33:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:33:58,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:33:58,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:33:58,255 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 10 treesize of output 9 [2018-12-03 07:33:58,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:58,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:58,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:58,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-03 07:33:58,705 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 24 treesize of output 26 [2018-12-03 07:33:58,713 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 8 [2018-12-03 07:33:58,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:58,725 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 13 treesize of output 5 [2018-12-03 07:33:58,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:58,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:58,731 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-03 07:33:58,731 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:11 [2018-12-03 07:33:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 07:33:58,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:33:59,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-03 07:33:59,857 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 11 treesize of output 7 [2018-12-03 07:33:59,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:33:59,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:33:59,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-03 07:33:59,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:41 [2018-12-03 07:34:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:34:00,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:34:00,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:34:00,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:34:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:34:00,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:00,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 07:34:00,491 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 10 treesize of output 9 [2018-12-03 07:34:00,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:00,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-03 07:34:01,082 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 24 treesize of output 26 [2018-12-03 07:34:01,084 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 8 [2018-12-03 07:34:01,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:01,094 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-03 07:34:01,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:01,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:01,102 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-03 07:34:01,102 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:9 [2018-12-03 07:34:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 07:34:01,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:02,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-03 07:34:02,757 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 11 treesize of output 7 [2018-12-03 07:34:02,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:34:02,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:34:02,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-03 07:34:02,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:74 [2018-12-03 07:34:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 07:34:03,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:34:03,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 24, 15] total 52 [2018-12-03 07:34:03,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 07:34:03,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 07:34:03,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2431, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 07:34:03,140 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 52 states. [2018-12-03 07:34:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:07,599 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-12-03 07:34:07,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 07:34:07,600 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 66 [2018-12-03 07:34:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:07,600 INFO L225 Difference]: With dead ends: 120 [2018-12-03 07:34:07,601 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 07:34:07,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 204 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=383, Invalid=3523, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 07:34:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 07:34:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 07:34:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 07:34:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-03 07:34:07,608 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 66 [2018-12-03 07:34:07,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:07,608 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-03 07:34:07,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 07:34:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-03 07:34:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 07:34:07,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:34:07,609 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:34:07,609 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:34:07,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:34:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash 462185700, now seen corresponding path program 2 times [2018-12-03 07:34:07,609 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:34:07,609 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:34:07,622 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:34:07,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:34:07,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:34:07,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:34:07,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:34:07,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:34:07,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:34:07,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:34:07,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:34:07,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:34:07,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:34:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:34:08,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:34:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:34:08,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:34:08,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-03 07:34:08,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 07:34:08,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 07:34:08,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-03 07:34:08,280 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 18 states. [2018-12-03 07:34:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:34:08,527 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-03 07:34:08,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:34:08,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-12-03 07:34:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:34:08,528 INFO L225 Difference]: With dead ends: 60 [2018-12-03 07:34:08,528 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 07:34:08,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-12-03 07:34:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 07:34:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 07:34:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 07:34:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 07:34:08,529 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-12-03 07:34:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:34:08,529 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 07:34:08,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 07:34:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 07:34:08,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 07:34:08,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 07:34:09,282 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2018-12-03 07:34:09,549 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2018-12-03 07:34:09,823 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-12-03 07:34:09,999 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-12-03 07:34:10,277 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-12-03 07:34:10,523 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2018-12-03 07:34:10,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 07:34:10,554 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-03 07:34:10,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 07:34:10,554 INFO L451 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: true [2018-12-03 07:34:10,554 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 560 562) the Hoare annotation is: true [2018-12-03 07:34:10,554 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 560 562) no Hoare annotation was computed. [2018-12-03 07:34:10,554 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 560 562) no Hoare annotation was computed. [2018-12-03 07:34:10,554 INFO L448 ceAbstractionStarter]: For program point sll_circular_get_data_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-12-03 07:34:10,554 INFO L451 ceAbstractionStarter]: At program point sll_circular_get_data_atENTRY(lines 595 601) the Hoare annotation is: true [2018-12-03 07:34:10,554 INFO L444 ceAbstractionStarter]: At program point L596-2(lines 596 599) the Hoare annotation is: (or (forall ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32))) (not (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_9) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32)))) (let ((.cse0 (bvadd sll_circular_get_data_at_~index (_ bv1 32)))) (and (bvsgt .cse0 (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (= .cse0 |sll_circular_get_data_at_#in~index|))) (forall ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_7)) (.cse2 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_7))) (or (not (= .cse1 (_ bv0 32))) (not (= (_ bv3 32) (select (select |#memory_int| .cse2) (bvadd .cse1 (_ bv4 32))))) (= .cse2 v_main_~s~0.base_BEFORE_CALL_7)))) (bvsgt (bvadd |sll_circular_get_data_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (forall ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (let ((.cse3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| .cse3) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))))) (= v_main_~s~0.base_BEFORE_CALL_3 .cse3)))) (and (= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|) (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|))) [2018-12-03 07:34:10,554 INFO L448 ceAbstractionStarter]: For program point L596-3(lines 596 599) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point sll_circular_get_data_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L444 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (and (bvsgt (bvadd |sll_circular_create_#in~len| (_ bv4294967295 32)) (_ bv1 32)) (bvsgt |sll_circular_create_#in~len| (_ bv1 32))) (and (= sll_circular_create_~head~0.offset (_ bv0 32)) (bvsgt sll_circular_create_~len (_ bv1 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))) [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L444 ceAbstractionStarter]: At program point L573(line 573) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_create_#in~len| sll_circular_create_~len)) [2018-12-03 07:34:10,555 INFO L444 ceAbstractionStarter]: At program point L575-2(lines 575 580) the Hoare annotation is: (let ((.cse1 (bvsgt |sll_circular_create_#in~len| (_ bv1 32))) (.cse0 (bvadd |sll_circular_create_#in~len| (_ bv4294967295 32))) (.cse2 (= sll_circular_create_~head~0.offset (_ bv0 32))) (.cse3 (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base))) (or (and (bvsgt .cse0 (_ bv1 32)) .cse1) (and .cse1 (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) .cse2 (= .cse0 sll_circular_create_~len) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not .cse3)) (and .cse2 .cse3 (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1))))) [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point L573-1(line 573) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point L575-3(lines 575 580) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L444 ceAbstractionStarter]: At program point sll_circular_createENTRY(lines 572 583) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point sll_circular_createFINAL(lines 572 583) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point sll_circular_createEXIT(lines 572 583) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 07:34:10,555 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 626) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 609 628) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point L624(line 624) no Hoare annotation was computed. [2018-12-03 07:34:10,555 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 609 628) no Hoare annotation was computed. [2018-12-03 07:34:10,556 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (.cse5 (bvmul (_ bv2 32) main_~len~0))) (let ((.cse0 (= main_~s~0.offset (_ bv0 32))) (.cse1 (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (_ bv2 32)) .cse5)) (.cse3 (= .cse6 (_ bv0 32))) (.cse4 (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd .cse6 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (let ((.cse2 (bvadd main_~len~0 (_ bv4294967294 32)))) (and .cse0 (= (bvadd main_~expected~0 (_ bv4294967294 32)) main_~i~0) .cse1 (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) (= .cse2 (_ bv0 32)) .cse3 (= .cse2 main_~i~0) .cse4)) (and (= (bvadd .cse5 (_ bv4294967294 32)) main_~new_data~0) .cse0 .cse1 (= (_ bv3 32) main_~expected~0) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) .cse3 .cse4 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))) [2018-12-03 07:34:10,556 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 620 622) no Hoare annotation was computed. [2018-12-03 07:34:10,556 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse7 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (let ((.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= .cse7 (_ bv0 32))) (.cse4 (not (= (select .cse6 (_ bv0 32)) main_~s~0.base))) (.cse0 (bvneg main_~len~0))) (or (and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd .cse0 main_~new_data~0)) .cse1 (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (let ((.cse2 (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse2) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| .cse2) sll_circular_create_~last~0.offset) main_~s~0.base)))) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) .cse3 .cse4 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse5 (bvadd main_~len~0 (_ bv4294967294 32)))) (and .cse1 (= .cse5 (_ bv0 32)) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse3 .cse4 (= .cse5 main_~i~0) (= (bvadd (select (select |#memory_int| (select .cse6 main_~s~0.offset)) (bvadd .cse7 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg .cse0) main_~len~0))))))) [2018-12-03 07:34:10,556 INFO L448 ceAbstractionStarter]: For program point L618-2(lines 618 623) no Hoare annotation was computed. [2018-12-03 07:34:10,556 INFO L448 ceAbstractionStarter]: For program point L616-1(lines 614 617) no Hoare annotation was computed. [2018-12-03 07:34:10,556 INFO L444 ceAbstractionStarter]: At program point L618-3(lines 618 623) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (.cse6 (bvadd main_~len~0 (_ bv4294967294 32))) (.cse8 (bvmul (_ bv2 32) main_~len~0))) (let ((.cse0 (= (bvadd .cse8 (_ bv4294967294 32)) main_~new_data~0)) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse2 (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (_ bv2 32)) .cse8)) (.cse5 (= .cse6 (_ bv0 32))) (.cse3 (= .cse7 (_ bv0 32))) (.cse4 (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd .cse7 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (and .cse0 .cse1 .cse2 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) .cse3 .cse4 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse5 (= (bvadd main_~expected~0 (_ bv4294967294 32)) (_ bv0 32)) .cse3 (= (bvadd main_~len~0 (_ bv4294967293 32)) main_~i~0) .cse4) (and .cse1 .cse2 .cse5 (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse3 (= .cse6 main_~i~0) .cse4)))) [2018-12-03 07:34:10,556 INFO L444 ceAbstractionStarter]: At program point L618-4(lines 618 623) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-03 07:34:10,556 INFO L444 ceAbstractionStarter]: At program point L612(line 612) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:34:10,556 INFO L444 ceAbstractionStarter]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (.cse5 (bvadd main_~len~0 (_ bv4294967294 32))) (.cse8 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse3 (not (= (select .cse8 (_ bv0 32)) main_~s~0.base))) (.cse0 (= main_~s~0.offset (_ bv0 32))) (.cse4 (= .cse5 (_ bv0 32))) (.cse2 (= .cse9 (_ bv0 32))) (.cse6 (= (bvadd (select (select |#memory_int| (select .cse8 main_~s~0.offset)) (bvadd .cse9 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (and .cse0 (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse1) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| .cse1) sll_circular_create_~last~0.offset) main_~s~0.base)))) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) .cse2 .cse3 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse4 .cse2 .cse3 (= .cse5 main_~i~0) .cse6) (let ((.cse7 (bvmul (_ bv2 32) main_~len~0))) (and (= (bvadd .cse7 (_ bv4294967294 32)) main_~new_data~0) .cse0 (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (_ bv2 32)) .cse7) .cse4 (= (bvadd main_~len~0 (_ bv4294967293 32)) main_~i~0) .cse2 .cse6))))) [2018-12-03 07:34:10,556 INFO L448 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-12-03 07:34:10,556 INFO L448 ceAbstractionStarter]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2018-12-03 07:34:10,556 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 609 628) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:34:10,556 INFO L444 ceAbstractionStarter]: At program point L621(lines 609 628) the Hoare annotation is: false [2018-12-03 07:34:10,557 INFO L451 ceAbstractionStarter]: At program point sll_circular_destroyENTRY(lines 584 594) the Hoare annotation is: true [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point sll_circular_destroyEXIT(lines 584 594) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 593) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L451 ceAbstractionStarter]: At program point L587-2(lines 587 591) the Hoare annotation is: true [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point L587-3(lines 587 591) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 584 594) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point sll_circular_update_atEXIT(lines 602 608) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L444 ceAbstractionStarter]: At program point sll_circular_update_atENTRY(lines 602 608) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point sll_circular_update_atFINAL(lines 602 608) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L444 ceAbstractionStarter]: At program point L603-2(lines 603 606) the Hoare annotation is: (let ((.cse0 (= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)) (.cse4 (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))) (and (let ((.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse3 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3))) (let ((.cse5 (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data))) (or (and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) .cse0 .cse5) (and .cse4 (bvsgt (bvadd |sll_circular_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32))) (and (= (bvadd sll_circular_update_at_~index (_ bv1 32)) |sll_circular_update_at_#in~index|) (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) .cse5 (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base)))))) [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point L603-3(lines 603 606) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L451 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-12-03 07:34:10,557 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-12-03 07:34:10,562 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,562 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,566 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,566 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,568 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,568 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,568 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-03 07:34:10,568 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,568 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-03 07:34:10,569 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,569 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,569 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,569 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,569 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,569 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,569 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,570 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,570 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,572 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,572 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-03 07:34:10,572 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,572 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-03 07:34:10,573 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,573 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,573 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,573 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,573 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,573 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,573 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,574 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,574 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] [2018-12-03 07:34:10,577 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,577 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,577 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,579 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,579 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,579 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,581 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] [2018-12-03 07:34:10,588 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,588 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,588 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,589 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,589 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,590 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,590 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,590 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,591 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,594 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,594 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,595 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,595 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,595 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,595 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,595 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,595 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,595 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,596 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,598 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,599 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,602 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,603 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,603 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,603 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,603 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,603 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,604 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,604 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,604 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,605 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,607 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,607 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,607 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,608 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,608 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,608 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,608 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,608 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:34:10 BoogieIcfgContainer [2018-12-03 07:34:10,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:34:10,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:34:10,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:34:10,614 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:34:10,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:31:43" (3/4) ... [2018-12-03 07:34:10,616 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 07:34:10,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 07:34:10,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-03 07:34:10,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2018-12-03 07:34:10,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2018-12-03 07:34:10,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 07:34:10,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2018-12-03 07:34:10,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2018-12-03 07:34:10,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-03 07:34:10,624 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-03 07:34:10,625 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-03 07:34:10,625 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 07:34:10,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == 0bv32 && (\exists sll_circular_create_~last~0.offset : bv32 :: 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][sll_circular_create_~last~0.offset] && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][sll_circular_create_~last~0.offset] == s)) && ~bvadd64(i, 1bv32) == len) && #memory_$Pointer$[s][s] == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(i, 4294967295bv32) == 0bv32) || (((((s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && #memory_$Pointer$[s][s] == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(len, 4294967294bv32) == i) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len))) || ((((((~bvadd64(~bvmul32(2bv32, len), 4294967294bv32) == new_data && s == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(len, 4294967293bv32) == i) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len)) [2018-12-03 07:34:10,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 1bv32) && ~bvsgt32(\old(len), 1bv32)) || (((((~bvsgt32(\old(len), 1bv32) && #memory_$Pointer$[head][head] == last) && head == 0bv32) && ~bvadd64(\old(len), 4294967295bv32) == len) && 0bv32 == #memory_$Pointer$[head][head]) && !(head == last))) || (((head == 0bv32 && head == last) && \old(len) == len) && ~bvadd64(\valid[head], 1bv1) == 0bv1) [2018-12-03 07:34:10,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((index == \old(index) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || (((~bvsgt32(\old(index), 0bv32) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) && (((((head == head && head == head) && index == \old(index)) && \old(data) == data) || (~bvsgt32(\old(index), 0bv32) && ~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32))) || (((~bvadd64(index, 1bv32) == \old(index) && #memory_$Pointer$[head][head] == head) && \old(data) == data) && #memory_$Pointer$[head][head] == head)) [2018-12-03 07:34:10,643 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((forall v_main_~s~0.base_BEFORE_CALL_9 : bv32 :: !(~bvadd64(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_9][4bv32], 4294967294bv32) == 0bv32)) || (((~bvsgt32(~bvadd64(index, 1bv32), 0bv32) && #memory_$Pointer$[head][head] == head) && head == #memory_$Pointer$[head][head]) && ~bvadd64(index, 1bv32) == \old(index))) || (forall v_main_~s~0.base_BEFORE_CALL_7 : bv32, v_main_~s~0.offset_BEFORE_CALL_7 : bv32 :: (!(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] == 0bv32) || !(3bv32 == unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7]][~bvadd64(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7], 4bv32)])) || #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] == v_main_~s~0.base_BEFORE_CALL_7)) || ~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32)) || (forall v_main_~s~0.base_BEFORE_CALL_3 : bv32 :: !(3bv32 == unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32]][~bvadd64(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32], 4bv32)]) || v_main_~s~0.base_BEFORE_CALL_3 == #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32])) || ((index == \old(index) && head == head) && head == head) [2018-12-03 07:34:10,653 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ebdecdd6-999e-46a9-a360-f74a6735b433/bin-2019/utaipan/witness.graphml [2018-12-03 07:34:10,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:34:10,654 INFO L168 Benchmark]: Toolchain (without parser) took 147888.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -264.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:34:10,654 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:34:10,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:34:10,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.04 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-03 07:34:10,654 INFO L168 Benchmark]: Boogie Preprocessor took 21.25 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-03 07:34:10,654 INFO L168 Benchmark]: RCFGBuilder took 237.90 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-12-03 07:34:10,655 INFO L168 Benchmark]: TraceAbstraction took 147279.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.3 MB). Peak memory consumption was 390.5 MB. Max. memory is 11.5 GB. [2018-12-03 07:34:10,655 INFO L168 Benchmark]: Witness Printer took 39.88 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:34:10,656 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.04 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.25 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. * RCFGBuilder took 237.90 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 147279.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.3 MB). Peak memory consumption was 390.5 MB. Max. memory is 11.5 GB. * Witness Printer took 39.88 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - 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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - 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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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_$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 #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 #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_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 #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 #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 #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 #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 #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 #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 #memory_int - 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 #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_$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 #memory_int - 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 #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_$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 #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 #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 #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 #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 #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 #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$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 626]: 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: 575]: Loop Invariant [2018-12-03 07:34:10,659 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,659 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,660 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,660 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 1bv32) && ~bvsgt32(\old(len), 1bv32)) || (((((~bvsgt32(\old(len), 1bv32) && #memory_$Pointer$[head][head] == last) && head == 0bv32) && ~bvadd64(\old(len), 4294967295bv32) == len) && 0bv32 == #memory_$Pointer$[head][head]) && !(head == last))) || (((head == 0bv32 && head == last) && \old(len) == len) && ~bvadd64(\valid[head], 1bv1) == 0bv1) - InvariantResult [Line: 614]: Loop Invariant [2018-12-03 07:34:10,660 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,662 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,662 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,662 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,663 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,665 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,665 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,665 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((s == 0bv32 && (\exists sll_circular_create_~last~0.offset : bv32 :: 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][sll_circular_create_~last~0.offset] && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][sll_circular_create_~last~0.offset] == s)) && ~bvadd64(i, 1bv32) == len) && #memory_$Pointer$[s][s] == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(i, 4294967295bv32) == 0bv32) || (((((s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && #memory_$Pointer$[s][s] == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(len, 4294967294bv32) == i) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len))) || ((((((~bvadd64(~bvmul32(2bv32, len), 4294967294bv32) == new_data && s == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(len, 4294967293bv32) == i) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len)) - InvariantResult [Line: 596]: Loop Invariant [2018-12-03 07:34:10,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] [2018-12-03 07:34:10,670 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,670 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,670 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,670 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((forall v_main_~s~0.base_BEFORE_CALL_9 : bv32 :: !(~bvadd64(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_9][4bv32], 4294967294bv32) == 0bv32)) || (((~bvsgt32(~bvadd64(index, 1bv32), 0bv32) && #memory_$Pointer$[head][head] == head) && head == #memory_$Pointer$[head][head]) && ~bvadd64(index, 1bv32) == \old(index))) || (forall v_main_~s~0.base_BEFORE_CALL_7 : bv32, v_main_~s~0.offset_BEFORE_CALL_7 : bv32 :: (!(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] == 0bv32) || !(3bv32 == unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7]][~bvadd64(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7], 4bv32)])) || #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] == v_main_~s~0.base_BEFORE_CALL_7)) || ~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32)) || (forall v_main_~s~0.base_BEFORE_CALL_3 : bv32 :: !(3bv32 == unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32]][~bvadd64(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32], 4bv32)]) || v_main_~s~0.base_BEFORE_CALL_3 == #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32])) || ((index == \old(index) && head == head) && head == head) - InvariantResult [Line: 609]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 603]: Loop Invariant [2018-12-03 07:34:10,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,674 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,674 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,674 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((index == \old(index) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || (((~bvsgt32(\old(index), 0bv32) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) && (((((head == head && head == head) && index == \old(index)) && \old(data) == data) || (~bvsgt32(\old(index), 0bv32) && ~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32))) || (((~bvadd64(index, 1bv32) == \old(index) && #memory_$Pointer$[head][head] == head) && \old(data) == data) && #memory_$Pointer$[head][head] == head)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant [2018-12-03 07:34:10,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,692 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,692 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,692 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,692 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,692 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,694 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,694 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,694 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,694 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,694 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,694 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,694 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,694 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,694 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,695 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,706 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 07:34:10,707 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 07:34:10,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-03 07:34:10,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 07:34:10,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((~bvadd64(~bvmul32(2bv32, len), 4294967294bv32) == new_data && s == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(i, 1bv32) == len) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len)) && ~bvadd64(i, 4294967295bv32) == 0bv32) || (((((((~bvadd64(~bvmul32(2bv32, len), 4294967294bv32) == new_data && s == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(expected, 4294967294bv32) == 0bv32) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(len, 4294967293bv32) == i) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len))) || ((((((s == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(len, i) == new_data) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(len, 4294967294bv32) == i) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len)) - InvariantResult [Line: 561]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 59 locations, 1 error locations. SAFE Result, 147.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 116.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 522 SDtfs, 779 SDslu, 3440 SDs, 0 SdLazy, 3357 SolverSat, 489 SolverUnsat, 44 SolverUnknown, 0 SolverNotchecked, 71.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1925 GetRequests, 1631 SyntacticMatches, 21 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3082 ImplicationChecksByTransitivity, 65.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=8, 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 77 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 109 PreInvPairs, 191 NumberOfFragments, 995 HoareAnnotationTreeSize, 109 FomulaSimplifications, 6473 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 1548 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1035 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1805 ConstructedInterpolants, 56 QuantifiedInterpolants, 482237 SizeOfPredicates, 134 NumberOfNonLiveVariables, 3531 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 32 InterpolantComputations, 6 PerfectInterpolantSequences, 546/663 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...