./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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 8b3062b21a8387ee02671c0517b6fd115fcec0cd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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 8b3062b21a8387ee02671c0517b6fd115fcec0cd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:48:46,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:48:46,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:48:46,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:48:46,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:48:46,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:48:46,654 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:48:46,656 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:48:46,657 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:48:46,658 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:48:46,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:48:46,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:48:46,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:48:46,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:48:46,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:48:46,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:48:46,662 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:48:46,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:48:46,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:48:46,666 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:48:46,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:48:46,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:48:46,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:48:46,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:48:46,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:48:46,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:48:46,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:48:46,673 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:48:46,673 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:48:46,674 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:48:46,674 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:48:46,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:48:46,675 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:48:46,675 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:48:46,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:48:46,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:48:46,676 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 08:48:46,689 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:48:46,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:48:46,690 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:48:46,690 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:48:46,690 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 08:48:46,691 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 08:48:46,691 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 08:48:46,691 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 08:48:46,691 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 08:48:46,691 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 08:48:46,691 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 08:48:46,692 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 08:48:46,692 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 08:48:46,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:48:46,693 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:48:46,693 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:48:46,693 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:48:46,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:48:46,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:48:46,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:48:46,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:48:46,695 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:48:46,695 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:48:46,695 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:48:46,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:48:46,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:48:46,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:48:46,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:48:46,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:48:46,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:48:46,697 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:48:46,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:48:46,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:48:46,697 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 08:48:46,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:48:46,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:48:46,698 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 08:48:46,698 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_dd2f33a3-4678-4681-8611-9f5f7bc66666/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 -> 8b3062b21a8387ee02671c0517b6fd115fcec0cd [2018-11-23 08:48:46,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:48:46,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:48:46,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:48:46,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:48:46,745 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:48:46,746 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 08:48:46,799 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data/3ed0f27e9/a23915fef7b344a3b233d59275d0b19d/FLAGfa9d167bb [2018-11-23 08:48:47,191 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:48:47,192 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 08:48:47,200 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data/3ed0f27e9/a23915fef7b344a3b233d59275d0b19d/FLAGfa9d167bb [2018-11-23 08:48:47,211 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data/3ed0f27e9/a23915fef7b344a3b233d59275d0b19d [2018-11-23 08:48:47,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:48:47,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:48:47,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:48:47,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:48:47,221 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:48:47,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33dd1227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47, skipping insertion in model container [2018-11-23 08:48:47,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:48:47,273 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:48:47,558 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:48:47,568 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:48:47,661 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:48:47,689 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:48:47,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47 WrapperNode [2018-11-23 08:48:47,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:48:47,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:48:47,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:48:47,691 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:48:47,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:48:47,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:48:47,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:48:47,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:48:47,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... [2018-11-23 08:48:47,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:48:47,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:48:47,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:48:47,743 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:48:47,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:48:47,785 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 08:48:47,785 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 08:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 08:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-11-23 08:48:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-11-23 08:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 08:48:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 08:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 08:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-11-23 08:48:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-11-23 08:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:48:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:48:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 08:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 08:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 08:48:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 08:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:48:47,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:48:48,076 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:48:48,077 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 08:48:48,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:48 BoogieIcfgContainer [2018-11-23 08:48:48,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:48:48,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:48:48,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:48:48,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:48:48,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:48:47" (1/3) ... [2018-11-23 08:48:48,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad09a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:48, skipping insertion in model container [2018-11-23 08:48:48,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:47" (2/3) ... [2018-11-23 08:48:48,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad09a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:48, skipping insertion in model container [2018-11-23 08:48:48,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:48" (3/3) ... [2018-11-23 08:48:48,084 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 08:48:48,095 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:48:48,102 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:48:48,113 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:48:48,139 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:48:48,140 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:48:48,140 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:48:48,140 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:48:48,140 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:48:48,140 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:48:48,140 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:48:48,141 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:48:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-23 08:48:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 08:48:48,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:48:48,163 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] [2018-11-23 08:48:48,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:48:48,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:48:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -529366065, now seen corresponding path program 1 times [2018-11-23 08:48:48,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:48:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:48:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:48,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:48:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:48:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:48:48,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:48:48,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:48:48,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:48:48,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:48:48,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:48:48,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:48:48,378 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-11-23 08:48:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:48:48,474 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2018-11-23 08:48:48,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:48:48,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 08:48:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:48:48,486 INFO L225 Difference]: With dead ends: 95 [2018-11-23 08:48:48,486 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 08:48:48,489 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-11-23 08:48:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 08:48:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-23 08:48:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 08:48:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 08:48:48,530 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2018-11-23 08:48:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:48:48,531 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 08:48:48,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:48:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 08:48:48,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 08:48:48,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:48:48,532 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] [2018-11-23 08:48:48,532 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:48:48,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:48:48,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1904246888, now seen corresponding path program 1 times [2018-11-23 08:48:48,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:48:48,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:48,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:48:48,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:48,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:48:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:48:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:48:48,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:48:48,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:48:48,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:48:48,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:48:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:48:48,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:48:48,599 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-11-23 08:48:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:48:48,632 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-23 08:48:48,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:48:48,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 08:48:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:48:48,634 INFO L225 Difference]: With dead ends: 73 [2018-11-23 08:48:48,634 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 08:48:48,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:48:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 08:48:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 08:48:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 08:48:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 08:48:48,641 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2018-11-23 08:48:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:48:48,642 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 08:48:48,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:48:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 08:48:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 08:48:48,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:48:48,643 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] [2018-11-23 08:48:48,643 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:48:48,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:48:48,643 INFO L82 PathProgramCache]: Analyzing trace with hash 215303146, now seen corresponding path program 1 times [2018-11-23 08:48:48,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:48:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:48,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:48:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:48,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:48:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:48:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:48:48,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:48:48,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:48:48,719 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-23 08:48:48,721 INFO L202 CegarAbsIntRunner]: [15], [22], [28], [29], [30], [32], [38], [47], [55], [57], [60], [70], [92], [93], [94], [101], [103], [109], [111], [116], [118], [122], [123], [127], [128], [131], [132], [137], [138], [139] [2018-11-23 08:48:48,750 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:48:48,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:48:48,896 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 08:48:48,898 INFO L272 AbstractInterpreter]: Visited 14 different actions 19 times. Merged at 4 different actions 4 times. Never widened. Performed 177 root evaluator evaluations with a maximum evaluation depth of 3. Performed 177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-11-23 08:48:48,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:48:48,906 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 08:48:48,979 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 78.37% of their original sizes. [2018-11-23 08:48:48,979 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 08:48:49,031 INFO L415 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2018-11-23 08:48:49,032 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 08:48:49,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:48:49,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-23 08:48:49,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:48:49,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:48:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:48:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:48:49,034 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2018-11-23 08:48:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:48:49,516 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 08:48:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:48:49,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-23 08:48:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:48:49,518 INFO L225 Difference]: With dead ends: 73 [2018-11-23 08:48:49,519 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 08:48:49,519 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-23 08:48:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 08:48:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 08:48:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 08:48:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 08:48:49,528 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 30 [2018-11-23 08:48:49,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:48:49,529 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 08:48:49,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:48:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 08:48:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 08:48:49,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:48:49,532 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] [2018-11-23 08:48:49,532 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:48:49,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:48:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2098685651, now seen corresponding path program 1 times [2018-11-23 08:48:49,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:48:49,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:49,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:48:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:49,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:48:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:48:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 08:48:49,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:48:49,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 08:48:49,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:48:49,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:48:49,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:48:49,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:48:49,619 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 4 states. [2018-11-23 08:48:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:48:49,669 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-23 08:48:49,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:48:49,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 08:48:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:48:49,671 INFO L225 Difference]: With dead ends: 70 [2018-11-23 08:48:49,671 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 08:48:49,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:48:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 08:48:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-11-23 08:48:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 08:48:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-23 08:48:49,685 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 35 [2018-11-23 08:48:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:48:49,686 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-23 08:48:49,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:48:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 08:48:49,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 08:48:49,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:48:49,687 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] [2018-11-23 08:48:49,687 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:48:49,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:48:49,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1453975145, now seen corresponding path program 1 times [2018-11-23 08:48:49,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:48:49,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:49,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:48:49,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:49,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:48:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:48:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 08:48:49,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:48:49,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:48:49,784 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-11-23 08:48:49,785 INFO L202 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [22], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [70], [92], [93], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-11-23 08:48:49,787 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:48:49,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:48:49,887 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 08:48:49,887 INFO L272 AbstractInterpreter]: Visited 28 different actions 61 times. Merged at 11 different actions 21 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 6 fixpoints after 4 different actions. Largest state had 27 variables. [2018-11-23 08:48:49,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:48:49,902 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 08:48:49,987 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 66.67% of their original sizes. [2018-11-23 08:48:49,987 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 08:48:50,176 INFO L415 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-11-23 08:48:50,176 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 08:48:50,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:48:50,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2018-11-23 08:48:50,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:48:50,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 08:48:50,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 08:48:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-23 08:48:50,178 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 17 states. [2018-11-23 08:48:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:48:51,338 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-11-23 08:48:51,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 08:48:51,338 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-11-23 08:48:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:48:51,341 INFO L225 Difference]: With dead ends: 75 [2018-11-23 08:48:51,341 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 08:48:51,342 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-11-23 08:48:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 08:48:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 08:48:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 08:48:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-11-23 08:48:51,352 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 43 [2018-11-23 08:48:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:48:51,352 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-11-23 08:48:51,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 08:48:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-23 08:48:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 08:48:51,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:48:51,355 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] [2018-11-23 08:48:51,355 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:48:51,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:48:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1018565616, now seen corresponding path program 1 times [2018-11-23 08:48:51,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:48:51,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:51,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:48:51,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:48:51,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:48:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:48:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:48:52,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:48:52,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:48:52,348 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-23 08:48:52,348 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [70], [92], [93], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-11-23 08:48:52,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:48:52,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:48:52,455 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 08:48:52,455 INFO L272 AbstractInterpreter]: Visited 40 different actions 120 times. Merged at 23 different actions 46 times. Never widened. Performed 982 root evaluator evaluations with a maximum evaluation depth of 4. Performed 982 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 7 different actions. Largest state had 27 variables. [2018-11-23 08:48:52,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:48:52,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 08:48:52,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:48:52,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:48:52,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:48:52,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:48:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:48:52,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:48:52,586 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-11-23 08:48:52,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 08:48:52,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:48:52,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:48:52,655 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-11-23 08:48:52,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 08:48:52,686 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 18 treesize of output 15 [2018-11-23 08:48:52,689 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 08:48:52,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:48:52,695 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 18 treesize of output 27 [2018-11-23 08:48:52,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,716 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-11-23 08:48:52,779 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 45 treesize of output 39 [2018-11-23 08:48:52,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 08:48:52,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:52,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:48:52,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-23 08:48:53,236 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 11 treesize of output 8 [2018-11-23 08:48:53,239 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-11-23 08:48:53,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:53,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:53,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:53,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 08:48:53,300 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 44 treesize of output 38 [2018-11-23 08:48:53,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:48:53,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:48:53,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-23 08:48:53,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:53,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:53,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:48:53,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:45 [2018-11-23 08:48:53,992 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int) (dll_update_at_~data Int)) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (+ |c_dll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))))) is different from true [2018-11-23 08:48:54,001 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-11-23 08:48:54,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:48:54,007 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:48:54,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-23 08:48:54,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:48:54,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 7 treesize of output 1 [2018-11-23 08:48:54,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:54,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:48:54,038 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 19 treesize of output 20 [2018-11-23 08:48:54,040 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-11-23 08:48:54,040 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:54,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:54,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:54,066 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:68, output treesize:17 [2018-11-23 08:48:54,357 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 29 treesize of output 29 [2018-11-23 08:48:54,360 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-11-23 08:48:54,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:54,369 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-11-23 08:48:54,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:54,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:54,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:54,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:10 [2018-11-23 08:48:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 08:48:54,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:48:54,791 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 08:48:54,963 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 08:48:54,970 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 08:48:56,074 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 08:48:56,082 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 08:48:57,455 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 08:48:57,460 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 08:48:59,818 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 67 [2018-11-23 08:48:59,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:48:59,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:48:59,893 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-23 08:48:59,914 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 9 treesize of output 8 [2018-11-23 08:48:59,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:59,933 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 16 treesize of output 12 [2018-11-23 08:48:59,936 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 12 treesize of output 3 [2018-11-23 08:48:59,937 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:59,940 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:59,942 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 26 treesize of output 24 [2018-11-23 08:48:59,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 6 treesize of output 1 [2018-11-23 08:48:59,946 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 08:48:59,952 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:48:59,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 08:49:00,013 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,020 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,046 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-23 08:49:00,062 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 9 treesize of output 8 [2018-11-23 08:49:00,062 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,079 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 26 treesize of output 24 [2018-11-23 08:49:00,082 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 6 treesize of output 1 [2018-11-23 08:49:00,082 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,086 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,088 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 16 treesize of output 12 [2018-11-23 08:49:00,090 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 12 treesize of output 3 [2018-11-23 08:49:00,090 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,092 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,105 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 08:49:00,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 08:49:00,139 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:121, output treesize:65 [2018-11-23 08:49:00,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,381 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-11-23 08:49:00,403 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 9 treesize of output 8 [2018-11-23 08:49:00,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,424 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 23 treesize of output 21 [2018-11-23 08:49:00,426 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 6 treesize of output 1 [2018-11-23 08:49:00,427 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,431 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,438 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 18 treesize of output 22 [2018-11-23 08:49:00,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 17 treesize of output 11 [2018-11-23 08:49:00,442 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,462 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-23 08:49:00,463 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 08:49:00,473 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-23 08:49:00,474 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,480 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 08:49:00,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 08:49:00,630 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-11-23 08:49:00,651 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 9 treesize of output 8 [2018-11-23 08:49:00,651 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,675 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 18 treesize of output 22 [2018-11-23 08:49:00,678 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-23 08:49:00,678 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,688 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 3 [2018-11-23 08:49:00,689 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,703 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-23 08:49:00,704 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 08:49:00,710 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 08:49:00,712 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 31 treesize of output 29 [2018-11-23 08:49:00,715 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 6 treesize of output 1 [2018-11-23 08:49:00,716 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,721 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,744 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 08:49:00,878 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,882 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,883 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,888 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,889 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,894 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,896 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,903 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,904 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,911 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:00,912 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:00,916 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:01,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 11 xjuncts. [2018-11-23 08:49:01,001 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 8 variables, input treesize:149, output treesize:300 [2018-11-23 08:49:01,002 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-11-23 08:49:02,229 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:02,230 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:53, output treesize:4 [2018-11-23 08:49:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:49:02,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:49:02,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 26] total 73 [2018-11-23 08:49:02,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:49:02,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 08:49:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 08:49:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4857, Unknown=3, NotChecked=140, Total=5256 [2018-11-23 08:49:02,400 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 52 states. [2018-11-23 08:49:10,150 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2018-11-23 08:49:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:15,593 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2018-11-23 08:49:15,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 08:49:15,593 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-11-23 08:49:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:15,595 INFO L225 Difference]: With dead ends: 169 [2018-11-23 08:49:15,595 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 08:49:15,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3450 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=891, Invalid=12665, Unknown=20, NotChecked=230, Total=13806 [2018-11-23 08:49:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 08:49:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 79. [2018-11-23 08:49:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 08:49:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2018-11-23 08:49:15,616 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 52 [2018-11-23 08:49:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:15,617 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2018-11-23 08:49:15,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 08:49:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2018-11-23 08:49:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 08:49:15,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:15,618 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] [2018-11-23 08:49:15,619 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:15,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:15,619 INFO L82 PathProgramCache]: Analyzing trace with hash -450159004, now seen corresponding path program 1 times [2018-11-23 08:49:15,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:49:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:15,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:15,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:49:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 08:49:15,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:15,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:49:15,703 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-23 08:49:15,703 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [24], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [70], [92], [93], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-11-23 08:49:15,705 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:49:15,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:49:15,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 08:49:15,794 INFO L272 AbstractInterpreter]: Visited 41 different actions 112 times. Merged at 19 different actions 38 times. Never widened. Performed 878 root evaluator evaluations with a maximum evaluation depth of 4. Performed 878 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-23 08:49:15,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:15,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 08:49:15,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:15,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:49:15,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:15,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:49:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:15,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 08:49:15,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 08:49:15,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:49:15,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-11-23 08:49:15,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:49:15,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:49:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:49:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:49:15,959 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 5 states. [2018-11-23 08:49:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:15,999 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-11-23 08:49:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:49:16,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-23 08:49:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:16,002 INFO L225 Difference]: With dead ends: 104 [2018-11-23 08:49:16,002 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 08:49:16,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:49:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 08:49:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-11-23 08:49:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 08:49:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2018-11-23 08:49:16,022 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 53 [2018-11-23 08:49:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:16,022 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2018-11-23 08:49:16,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:49:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2018-11-23 08:49:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 08:49:16,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:16,024 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] [2018-11-23 08:49:16,024 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:16,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:16,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1915358689, now seen corresponding path program 2 times [2018-11-23 08:49:16,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:49:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:16,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:16,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:49:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 08:49:16,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:16,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:49:16,093 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:49:16,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:49:16,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:16,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:49:16,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:49:16,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 08:49:16,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 08:49:16,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:49:16,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:49:16,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:49:16,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:49:16,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-23 08:49:16,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:49:16,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 08:49:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:49:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 08:49:16,287 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 8 states. [2018-11-23 08:49:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:16,367 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2018-11-23 08:49:16,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 08:49:16,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 08:49:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:16,368 INFO L225 Difference]: With dead ends: 142 [2018-11-23 08:49:16,368 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 08:49:16,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-23 08:49:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 08:49:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-11-23 08:49:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 08:49:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2018-11-23 08:49:16,386 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 53 [2018-11-23 08:49:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:16,386 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2018-11-23 08:49:16,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 08:49:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2018-11-23 08:49:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 08:49:16,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:16,388 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] [2018-11-23 08:49:16,388 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:16,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:16,388 INFO L82 PathProgramCache]: Analyzing trace with hash 194884557, now seen corresponding path program 3 times [2018-11-23 08:49:16,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:49:16,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:16,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:49:16,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:16,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:49:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 08:49:16,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:16,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:49:16,462 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:49:16,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:49:16,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:16,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:49:16,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:49:16,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 08:49:16,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:49:16,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:49:16,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 08:49:16,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 08:49:16,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:49:16,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 08:49:16,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:49:16,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 08:49:16,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 08:49:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:49:16,629 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand 8 states. [2018-11-23 08:49:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:16,689 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2018-11-23 08:49:16,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:49:16,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 08:49:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:16,690 INFO L225 Difference]: With dead ends: 124 [2018-11-23 08:49:16,690 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 08:49:16,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:49:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 08:49:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-11-23 08:49:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 08:49:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-11-23 08:49:16,706 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 53 [2018-11-23 08:49:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:16,706 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-11-23 08:49:16,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 08:49:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-11-23 08:49:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 08:49:16,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:16,707 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-11-23 08:49:16,707 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:16,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:16,708 INFO L82 PathProgramCache]: Analyzing trace with hash -752213670, now seen corresponding path program 4 times [2018-11-23 08:49:16,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:49:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:16,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:49:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:16,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:49:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 08:49:16,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:16,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:49:16,767 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:49:16,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:49:16,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:16,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:49:16,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:16,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:49:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:16,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 08:49:16,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 08:49:16,973 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:49:16,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 14 [2018-11-23 08:49:16,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:49:16,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:49:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:49:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 08:49:16,974 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 6 states. [2018-11-23 08:49:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:17,029 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-11-23 08:49:17,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:49:17,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-23 08:49:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:17,031 INFO L225 Difference]: With dead ends: 114 [2018-11-23 08:49:17,031 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 08:49:17,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 08:49:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 08:49:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 08:49:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 08:49:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-11-23 08:49:17,047 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 60 [2018-11-23 08:49:17,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:17,047 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-11-23 08:49:17,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:49:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-11-23 08:49:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 08:49:17,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:17,050 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] [2018-11-23 08:49:17,050 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:17,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1588785285, now seen corresponding path program 1 times [2018-11-23 08:49:17,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:49:17,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:17,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:17,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:17,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:49:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:49:17,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:17,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:49:17,123 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-23 08:49:17,123 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [62], [64], [70], [92], [93], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-11-23 08:49:17,125 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:49:17,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:49:17,203 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 08:49:17,203 INFO L272 AbstractInterpreter]: Visited 42 different actions 104 times. Merged at 18 different actions 35 times. Never widened. Performed 827 root evaluator evaluations with a maximum evaluation depth of 4. Performed 827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 7 different actions. Largest state had 27 variables. [2018-11-23 08:49:17,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:17,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 08:49:17,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:17,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:49:17,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:17,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:49:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:17,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:49:17,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:49:17,354 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:49:17,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-11-23 08:49:17,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:49:17,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:49:17,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:49:17,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:49:17,356 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 6 states. [2018-11-23 08:49:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:17,407 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-23 08:49:17,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:49:17,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-23 08:49:17,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:17,409 INFO L225 Difference]: With dead ends: 67 [2018-11-23 08:49:17,409 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 08:49:17,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:49:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 08:49:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 08:49:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 08:49:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-23 08:49:17,418 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 62 [2018-11-23 08:49:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:17,419 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-23 08:49:17,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:49:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-23 08:49:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 08:49:17,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:17,420 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] [2018-11-23 08:49:17,420 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:17,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:17,420 INFO L82 PathProgramCache]: Analyzing trace with hash 326341689, now seen corresponding path program 1 times [2018-11-23 08:49:17,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:49:17,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:17,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:17,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:49:17,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:49:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 08:49:18,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:18,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:49:18,146 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-23 08:49:18,146 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [24], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [62], [64], [70], [92], [93], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-11-23 08:49:18,148 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:49:18,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:49:18,261 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 08:49:18,261 INFO L272 AbstractInterpreter]: Visited 43 different actions 152 times. Merged at 27 different actions 66 times. Never widened. Performed 1118 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 9 different actions. Largest state had 27 variables. [2018-11-23 08:49:18,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:18,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 08:49:18,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:18,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:49:18,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:18,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:49:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:18,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:18,376 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-11-23 08:49:18,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 08:49:18,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:18,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:18,432 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-11-23 08:49:18,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 08:49:18,474 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 18 treesize of output 15 [2018-11-23 08:49:18,476 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 08:49:18,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:18,480 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 18 treesize of output 27 [2018-11-23 08:49:18,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,494 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-11-23 08:49:18,532 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 45 treesize of output 39 [2018-11-23 08:49:18,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 08:49:18,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:18,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-23 08:49:18,819 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 15 treesize of output 12 [2018-11-23 08:49:18,820 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-11-23 08:49:18,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:18,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:18,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2018-11-23 08:49:19,438 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset)))))) is different from true [2018-11-23 08:49:19,447 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 44 treesize of output 38 [2018-11-23 08:49:19,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:19,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:19,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-23 08:49:19,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:19,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:19,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:19,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:38 [2018-11-23 08:49:19,703 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 29 treesize of output 20 [2018-11-23 08:49:19,705 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 20 treesize of output 19 [2018-11-23 08:49:19,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:19,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:19,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:19,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-11-23 08:49:19,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:19,784 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 112 treesize of output 113 [2018-11-23 08:49:19,787 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 36 treesize of output 1 [2018-11-23 08:49:19,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:19,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:19,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:19,810 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:49:19,817 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 95 treesize of output 104 [2018-11-23 08:49:19,826 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 42 treesize of output 59 [2018-11-23 08:49:19,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 08:49:19,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 08:49:19,863 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-11-23 08:49:19,863 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:146, output treesize:100 [2018-11-23 08:49:20,503 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 76 treesize of output 70 [2018-11-23 08:49:20,517 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 0 case distinctions, treesize of input 66 treesize of output 55 [2018-11-23 08:49:20,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:20,589 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 0 case distinctions, treesize of input 55 treesize of output 46 [2018-11-23 08:49:20,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:20,621 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2018-11-23 08:49:20,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:20,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 08:49:20,678 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 46 treesize of output 40 [2018-11-23 08:49:20,682 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 08:49:20,682 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:20,696 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-23 08:49:20,697 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:20,709 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:20,719 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 42 treesize of output 44 [2018-11-23 08:49:20,723 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 08:49:20,723 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:20,750 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-23 08:49:20,751 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:20,776 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-23 08:49:20,777 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:20,793 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 08:49:20,823 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 23 treesize of output 19 [2018-11-23 08:49:20,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 11 treesize of output 3 [2018-11-23 08:49:20,825 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:20,829 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:20,831 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 34 treesize of output 28 [2018-11-23 08:49:20,840 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 16 treesize of output 3 [2018-11-23 08:49:20,840 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:20,846 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:20,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-11-23 08:49:20,856 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 25 [2018-11-23 08:49:20,856 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:20,873 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 25 treesize of output 20 [2018-11-23 08:49:20,874 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:20,890 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 28 treesize of output 16 [2018-11-23 08:49:20,890 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:20,899 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:20,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:20,913 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:79, output treesize:7 [2018-11-23 08:49:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-11-23 08:49:20,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:21,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,530 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,538 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,540 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,562 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,744 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,781 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,783 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,804 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,806 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,816 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,931 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,936 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,938 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,979 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,980 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,987 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,988 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:21,994 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:22,185 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 115 treesize of output 81 [2018-11-23 08:49:22,187 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 39 treesize of output 5 [2018-11-23 08:49:22,188 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,190 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,192 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 115 treesize of output 81 [2018-11-23 08:49:22,195 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-11-23 08:49:22,195 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,197 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,200 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 79 treesize of output 45 [2018-11-23 08:49:22,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-11-23 08:49:22,202 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,205 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,254 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 135 treesize of output 101 [2018-11-23 08:49:22,257 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 08:49:22,257 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,262 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,264 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 109 treesize of output 75 [2018-11-23 08:49:22,266 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 13 treesize of output 5 [2018-11-23 08:49:22,266 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,270 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,299 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,301 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,302 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,306 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:22,306 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:22,308 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:22,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-11-23 08:49:22,325 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 6 variables, input treesize:281, output treesize:218 [2018-11-23 08:49:22,550 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 08:49:22,694 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-23 08:49:22,896 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:49:22,897 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-11-23 08:49:22,900 INFO L168 Benchmark]: Toolchain (without parser) took 35684.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.8 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -240.8 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:49:22,900 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:49:22,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:49:22,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.52 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-11-23 08:49:22,901 INFO L168 Benchmark]: Boogie Preprocessor took 25.93 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:49:22,901 INFO L168 Benchmark]: RCFGBuilder took 335.01 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:49:22,902 INFO L168 Benchmark]: TraceAbstraction took 34821.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.8 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:49:22,904 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 473.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.52 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 25.93 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 335.01 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34821.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.8 MB). Peak memory consumption was 57.7 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-aa41828 [2018-11-23 08:49:24,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:49:24,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:49:24,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:49:24,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:49:24,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:49:24,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:49:24,612 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:49:24,613 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:49:24,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:49:24,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:49:24,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:49:24,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:49:24,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:49:24,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:49:24,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:49:24,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:49:24,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:49:24,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:49:24,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:49:24,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:49:24,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:49:24,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:49:24,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:49:24,631 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:49:24,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:49:24,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:49:24,633 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:49:24,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:49:24,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:49:24,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:49:24,636 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:49:24,637 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:49:24,637 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:49:24,638 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:49:24,639 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:49:24,639 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 08:49:24,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:49:24,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:49:24,653 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:49:24,654 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:49:24,654 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 08:49:24,654 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 08:49:24,654 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 08:49:24,654 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 08:49:24,654 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 08:49:24,655 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 08:49:24,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:49:24,655 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:49:24,655 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:49:24,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:49:24,656 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:49:24,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:49:24,656 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:49:24,656 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 08:49:24,656 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 08:49:24,656 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:49:24,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:49:24,657 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:49:24,657 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:49:24,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:49:24,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:49:24,657 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:49:24,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:49:24,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:49:24,658 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:49:24,658 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:49:24,658 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:49:24,658 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 08:49:24,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:49:24,659 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 08:49:24,659 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 08:49:24,659 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_dd2f33a3-4678-4681-8611-9f5f7bc66666/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 -> 8b3062b21a8387ee02671c0517b6fd115fcec0cd [2018-11-23 08:49:24,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:49:24,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:49:24,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:49:24,709 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:49:24,709 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:49:24,710 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 08:49:24,754 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data/3f531ad62/8321610110de4caa8cb6abdc37b44af1/FLAG1f8641007 [2018-11-23 08:49:25,157 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:49:25,158 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 08:49:25,170 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data/3f531ad62/8321610110de4caa8cb6abdc37b44af1/FLAG1f8641007 [2018-11-23 08:49:25,182 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/data/3f531ad62/8321610110de4caa8cb6abdc37b44af1 [2018-11-23 08:49:25,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:49:25,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:49:25,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:49:25,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:49:25,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:49:25,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e06f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25, skipping insertion in model container [2018-11-23 08:49:25,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:49:25,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:49:25,534 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:49:25,548 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:49:25,660 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:49:25,706 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:49:25,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25 WrapperNode [2018-11-23 08:49:25,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:49:25,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:49:25,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:49:25,708 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:49:25,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:49:25,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:49:25,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:49:25,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:49:25,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... [2018-11-23 08:49:25,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:49:25,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:49:25,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:49:25,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:49:25,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:49:25,806 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 08:49:25,806 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 08:49:25,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:49:25,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 08:49:25,807 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-11-23 08:49:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-11-23 08:49:25,807 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 08:49:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 08:49:25,807 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-11-23 08:49:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-11-23 08:49:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:49:25,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:49:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:49:25,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:49:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 08:49:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 08:49:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:49:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 08:49:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 08:49:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 08:49:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:49:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:49:26,228 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:49:26,228 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 08:49:26,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:26 BoogieIcfgContainer [2018-11-23 08:49:26,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:49:26,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:49:26,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:49:26,232 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:49:26,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:49:25" (1/3) ... [2018-11-23 08:49:26,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6454f5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:26, skipping insertion in model container [2018-11-23 08:49:26,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:25" (2/3) ... [2018-11-23 08:49:26,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6454f5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:26, skipping insertion in model container [2018-11-23 08:49:26,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:26" (3/3) ... [2018-11-23 08:49:26,235 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 08:49:26,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:49:26,251 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:49:26,262 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:49:26,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:49:26,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:49:26,287 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:49:26,288 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:49:26,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:49:26,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:49:26,288 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:49:26,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:49:26,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:49:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 08:49:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 08:49:26,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:26,308 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] [2018-11-23 08:49:26,310 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:26,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:26,314 INFO L82 PathProgramCache]: Analyzing trace with hash 821800959, now seen corresponding path program 1 times [2018-11-23 08:49:26,318 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:49:26,318 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:49:26,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:26,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:49:26,475 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 08:49:26,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:49:26,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:49:26,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:49:26,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:49:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:49:26,501 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2018-11-23 08:49:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:26,605 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2018-11-23 08:49:26,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:49:26,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 08:49:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:26,614 INFO L225 Difference]: With dead ends: 93 [2018-11-23 08:49:26,614 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 08:49:26,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-11-23 08:49:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 08:49:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-23 08:49:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 08:49:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 08:49:26,652 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2018-11-23 08:49:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:26,653 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 08:49:26,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:49:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 08:49:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 08:49:26,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:26,654 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] [2018-11-23 08:49:26,655 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:26,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1631243427, now seen corresponding path program 1 times [2018-11-23 08:49:26,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:49:26,656 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:49:26,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:26,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:49:26,734 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 08:49:26,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:49:26,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:49:26,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:49:26,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:49:26,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:49:26,740 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 3 states. [2018-11-23 08:49:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:27,118 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 08:49:27,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:49:27,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 08:49:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:27,119 INFO L225 Difference]: With dead ends: 71 [2018-11-23 08:49:27,119 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 08:49:27,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:49:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 08:49:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 08:49:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 08:49:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 08:49:27,127 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-11-23 08:49:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:27,128 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 08:49:27,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:49:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 08:49:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 08:49:27,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:27,129 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] [2018-11-23 08:49:27,129 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:27,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:27,130 INFO L82 PathProgramCache]: Analyzing trace with hash -362901279, now seen corresponding path program 1 times [2018-11-23 08:49:27,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:49:27,130 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:49:27,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:27,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:49:27,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:49:27,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:27,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:49:27,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:27,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 08:49:27,507 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 08:49:27,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:49:27,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 10 [2018-11-23 08:49:27,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 08:49:27,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 08:49:27,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 08:49:27,528 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 10 states. [2018-11-23 08:49:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:27,742 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-11-23 08:49:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:49:27,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-23 08:49:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:27,745 INFO L225 Difference]: With dead ends: 80 [2018-11-23 08:49:27,745 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 08:49:27,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 08:49:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 08:49:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-11-23 08:49:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 08:49:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 08:49:27,758 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2018-11-23 08:49:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:27,758 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 08:49:27,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 08:49:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 08:49:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 08:49:27,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:27,760 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] [2018-11-23 08:49:27,760 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:27,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash 951671223, now seen corresponding path program 1 times [2018-11-23 08:49:27,761 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:49:27,762 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:49:27,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:27,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 08:49:27,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 08:49:27,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:27,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:49:27,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:28,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:28,113 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 11 treesize of output 8 [2018-11-23 08:49:28,116 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-11-23 08:49:28,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-23 08:49:28,380 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 31 treesize of output 31 [2018-11-23 08:49:28,386 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 27 treesize of output 18 [2018-11-23 08:49:28,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,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 18 treesize of output 13 [2018-11-23 08:49:28,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,464 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 12 [2018-11-23 08:49:28,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,482 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:31, output treesize:7 [2018-11-23 08:49:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 08:49:28,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:28,972 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 7 treesize of output 5 [2018-11-23 08:49:28,976 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 5 treesize of output 3 [2018-11-23 08:49:28,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:28,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 08:49:28,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-11-23 08:49:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 08:49:29,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 08:49:29,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14, 12] total 26 [2018-11-23 08:49:29,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 08:49:29,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 08:49:29,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-11-23 08:49:29,045 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 26 states. [2018-11-23 08:49:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:35,348 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-23 08:49:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 08:49:35,349 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-11-23 08:49:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:35,351 INFO L225 Difference]: With dead ends: 89 [2018-11-23 08:49:35,351 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 08:49:35,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 08:49:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 08:49:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2018-11-23 08:49:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 08:49:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 08:49:35,361 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-11-23 08:49:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:35,361 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 08:49:35,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 08:49:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 08:49:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 08:49:35,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:35,363 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] [2018-11-23 08:49:35,363 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:35,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1822323821, now seen corresponding path program 2 times [2018-11-23 08:49:35,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:49:35,364 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:49:35,380 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 08:49:35,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:49:35,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:49:35,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:49:35,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:49:35,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:35,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:49:35,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:49:35,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:49:35,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:49:35,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:49:35,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:49:35,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 08:49:35,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-11-23 08:49:35,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:49:35,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:49:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:49:35,722 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 9 states. [2018-11-23 08:49:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:49:35,886 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2018-11-23 08:49:35,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:49:35,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-23 08:49:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:49:35,888 INFO L225 Difference]: With dead ends: 92 [2018-11-23 08:49:35,888 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 08:49:35,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:49:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 08:49:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-11-23 08:49:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 08:49:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-23 08:49:35,898 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 50 [2018-11-23 08:49:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:49:35,899 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-23 08:49:35,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:49:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-23 08:49:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 08:49:35,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:49:35,900 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] [2018-11-23 08:49:35,900 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:49:35,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:49:35,900 INFO L82 PathProgramCache]: Analyzing trace with hash -736573926, now seen corresponding path program 1 times [2018-11-23 08:49:35,900 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:49:35,900 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:49:35,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:49:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:36,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:36,049 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-11-23 08:49:36,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 08:49:36,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:36,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:36,077 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-11-23 08:49:36,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 08:49:36,115 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 18 treesize of output 15 [2018-11-23 08:49:36,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 08:49:36,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:36,123 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 18 treesize of output 27 [2018-11-23 08:49:36,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,151 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-11-23 08:49:36,194 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 45 treesize of output 39 [2018-11-23 08:49:36,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 08:49:36,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:36,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-23 08:49:36,769 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 11 treesize of output 8 [2018-11-23 08:49:36,772 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-11-23 08:49:36,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 08:49:36,881 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 50 treesize of output 44 [2018-11-23 08:49:36,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:36,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:36,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:36,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-11-23 08:49:36,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:36,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:36,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:50 [2018-11-23 08:49:39,227 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (bvadd |c_dll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))) |c_#memory_int|)) is different from true [2018-11-23 08:49:39,240 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-11-23 08:49:39,247 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 7 treesize of output 1 [2018-11-23 08:49:39,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:39,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:39,267 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 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-23 08:49:39,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:39,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:39,312 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 19 treesize of output 20 [2018-11-23 08:49:39,315 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-11-23 08:49:39,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:39,323 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:39,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:39,336 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-11-23 08:49:41,739 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 31 treesize of output 31 [2018-11-23 08:49:41,743 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 20 treesize of output 11 [2018-11-23 08:49:41,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:41,760 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 16 treesize of output 7 [2018-11-23 08:49:41,760 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:41,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:41,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:41,772 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-11-23 08:49:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 08:49:41,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:44,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:49:44,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:49:44,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:49:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:49:44,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:49:44,641 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-11-23 08:49:44,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 08:49:44,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:44,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:44,649 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-11-23 08:49:44,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 08:49:44,663 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 18 treesize of output 15 [2018-11-23 08:49:44,665 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 08:49:44,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:44,671 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 18 treesize of output 27 [2018-11-23 08:49:44,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,697 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-11-23 08:49:44,713 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 45 treesize of output 39 [2018-11-23 08:49:44,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 08:49:44,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:44,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-23 08:49:44,839 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 11 treesize of output 8 [2018-11-23 08:49:44,843 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-11-23 08:49:44,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 08:49:44,892 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 50 treesize of output 44 [2018-11-23 08:49:44,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:44,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:44,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:44,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-11-23 08:49:44,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:44,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:44,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:50 [2018-11-23 08:49:44,992 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 31 treesize of output 32 [2018-11-23 08:49:44,997 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 14 treesize of output 13 [2018-11-23 08:49:44,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:45,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:45,053 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-11-23 08:49:45,057 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 7 treesize of output 1 [2018-11-23 08:49:45,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:45,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:49:45,075 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 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 08:49:45,076 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:45,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:49:45,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:45,100 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-11-23 08:49:47,181 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 31 treesize of output 31 [2018-11-23 08:49:47,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 20 treesize of output 11 [2018-11-23 08:49:47,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:47,210 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 16 treesize of output 7 [2018-11-23 08:49:47,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:49:47,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:47,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:49:47,226 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-11-23 08:49:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 08:49:47,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:49:49,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:49:49,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-23 08:49:49,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 08:49:49,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 08:49:49,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1027, Unknown=3, NotChecked=64, Total=1190 [2018-11-23 08:49:49,755 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 28 states. [2018-11-23 08:49:58,839 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 08:50:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:06,341 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-11-23 08:50:06,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 08:50:06,342 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-11-23 08:50:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:50:06,344 INFO L225 Difference]: With dead ends: 118 [2018-11-23 08:50:06,344 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 08:50:06,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=282, Invalid=2911, Unknown=3, NotChecked=110, Total=3306 [2018-11-23 08:50:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 08:50:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-11-23 08:50:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 08:50:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2018-11-23 08:50:06,361 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 51 [2018-11-23 08:50:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:50:06,361 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-11-23 08:50:06,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 08:50:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-23 08:50:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 08:50:06,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:50:06,363 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] [2018-11-23 08:50:06,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:50:06,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:06,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1580579428, now seen corresponding path program 1 times [2018-11-23 08:50:06,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:50:06,363 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:50:06,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:06,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 08:50:06,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 08:50:06,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:06,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:50:06,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:06,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 08:50:06,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 08:50:06,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 08:50:06,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 4 [2018-11-23 08:50:06,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 08:50:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:50:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:50:06,525 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 4 states. [2018-11-23 08:50:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:06,696 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2018-11-23 08:50:06,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 08:50:06,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-23 08:50:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:50:06,699 INFO L225 Difference]: With dead ends: 156 [2018-11-23 08:50:06,699 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 08:50:06,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 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-11-23 08:50:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 08:50:06,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-23 08:50:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 08:50:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2018-11-23 08:50:06,720 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 51 [2018-11-23 08:50:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:50:06,721 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2018-11-23 08:50:06,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 08:50:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2018-11-23 08:50:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 08:50:06,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:50:06,723 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] [2018-11-23 08:50:06,724 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:50:06,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash 240383978, now seen corresponding path program 1 times [2018-11-23 08:50:06,724 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:50:06,724 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:50:06,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:06,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 08:50:06,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 08:50:06,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:50:06,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-11-23 08:50:06,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:50:06,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:50:06,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:50:06,894 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 7 states. [2018-11-23 08:50:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:06,962 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2018-11-23 08:50:06,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:50:06,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-23 08:50:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:50:06,963 INFO L225 Difference]: With dead ends: 115 [2018-11-23 08:50:06,963 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 08:50:06,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:50:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 08:50:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-11-23 08:50:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 08:50:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-11-23 08:50:06,980 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 52 [2018-11-23 08:50:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:50:06,981 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-11-23 08:50:06,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:50:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-11-23 08:50:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 08:50:06,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:50:06,982 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] [2018-11-23 08:50:06,983 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:50:06,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1541974541, now seen corresponding path program 2 times [2018-11-23 08:50:06,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:50:06,983 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:50:07,002 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 08:50:07,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:50:07,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:07,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:50:07,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:50:07,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:07,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:07,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:50:07,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:50:07,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:07,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:50:07,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 08:50:07,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 08:50:07,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-11-23 08:50:07,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 08:50:07,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 08:50:07,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 08:50:07,870 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 18 states. [2018-11-23 08:50:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:08,907 INFO L93 Difference]: Finished difference Result 165 states and 210 transitions. [2018-11-23 08:50:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 08:50:08,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-11-23 08:50:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:50:08,910 INFO L225 Difference]: With dead ends: 165 [2018-11-23 08:50:08,910 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 08:50:08,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-23 08:50:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 08:50:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2018-11-23 08:50:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 08:50:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2018-11-23 08:50:08,931 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 52 [2018-11-23 08:50:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:50:08,932 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2018-11-23 08:50:08,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 08:50:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2018-11-23 08:50:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 08:50:08,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:50:08,933 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] [2018-11-23 08:50:08,933 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:50:08,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:08,934 INFO L82 PathProgramCache]: Analyzing trace with hash 798663400, now seen corresponding path program 1 times [2018-11-23 08:50:08,934 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:50:08,934 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:50:08,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:09,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:50:09,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:50:09,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:09,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:50:09,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:09,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:50:09,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:50:09,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 08:50:09,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-11-23 08:50:09,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:50:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:50:09,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:50:09,309 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand 9 states. [2018-11-23 08:50:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:09,473 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2018-11-23 08:50:09,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:50:09,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-23 08:50:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:50:09,475 INFO L225 Difference]: With dead ends: 142 [2018-11-23 08:50:09,476 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 08:50:09,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 08:50:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 08:50:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-11-23 08:50:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 08:50:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2018-11-23 08:50:09,498 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 60 [2018-11-23 08:50:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:50:09,499 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2018-11-23 08:50:09,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:50:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-11-23 08:50:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 08:50:09,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:50:09,500 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-23 08:50:09,500 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:50:09,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash 129603863, now seen corresponding path program 3 times [2018-11-23 08:50:09,501 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:50:09,501 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:50:09,524 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 08:50:09,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 08:50:09,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:09,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 08:50:09,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:10,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:10,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/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-11-23 08:50:10,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:50:22,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 08:50:22,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:50:22,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 08:50:22,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 08:50:22,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:50:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 20 [2018-11-23 08:50:22,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 08:50:22,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 08:50:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-11-23 08:50:22,840 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 20 states. [2018-11-23 08:50:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:50:23,208 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-11-23 08:50:23,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 08:50:23,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-23 08:50:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:50:23,210 INFO L225 Difference]: With dead ends: 123 [2018-11-23 08:50:23,210 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 08:50:23,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-11-23 08:50:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 08:50:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 08:50:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 08:50:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-23 08:50:23,220 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 60 [2018-11-23 08:50:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:50:23,220 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 08:50:23,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 08:50:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 08:50:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 08:50:23,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:50:23,221 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] [2018-11-23 08:50:23,221 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:50:23,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:50:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash 588100828, now seen corresponding path program 1 times [2018-11-23 08:50:23,222 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:50:23,222 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:50:23,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:50:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:23,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:23,427 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-11-23 08:50:23,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 08:50:23,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:23,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:23,454 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-11-23 08:50:23,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 08:50:23,485 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 18 treesize of output 15 [2018-11-23 08:50:23,488 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 08:50:23,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:23,496 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 18 treesize of output 27 [2018-11-23 08:50:23,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,551 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 18 treesize of output 15 [2018-11-23 08:50:23,554 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 15 treesize of output 18 [2018-11-23 08:50:23,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:23,558 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:50:23,559 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 18 treesize of output 36 [2018-11-23 08:50:23,559 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,568 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,596 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:47, output treesize:47 [2018-11-23 08:50:23,646 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 66 treesize of output 60 [2018-11-23 08:50:23,650 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 14 treesize of output 13 [2018-11-23 08:50:23,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,710 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 42 treesize of output 43 [2018-11-23 08:50:23,714 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 14 treesize of output 13 [2018-11-23 08:50:23,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:23,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:67 [2018-11-23 08:50:24,261 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 53 treesize of output 45 [2018-11-23 08:50:24,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:24,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:24,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-23 08:50:24,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:24,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:24,399 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 41 treesize of output 42 [2018-11-23 08:50:24,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:24,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:24,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-11-23 08:50:24,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:24,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:24,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:24,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:63 [2018-11-23 08:50:24,772 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 29 treesize of output 20 [2018-11-23 08:50:24,778 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 20 treesize of output 19 [2018-11-23 08:50:24,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:24,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:24,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:24,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-11-23 08:50:25,001 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:50:25,035 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 151 treesize of output 152 [2018-11-23 08:50:25,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:25,047 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 42 treesize of output 24 [2018-11-23 08:50:25,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:25,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:25,139 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:50:25,162 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 94 treesize of output 100 [2018-11-23 08:50:25,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:25,173 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 42 treesize of output 24 [2018-11-23 08:50:25,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:25,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:25,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:25,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:173, output treesize:87 [2018-11-23 08:50:26,444 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 50 treesize of output 48 [2018-11-23 08:50:26,464 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 44 treesize of output 29 [2018-11-23 08:50:26,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:26,507 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-11-23 08:50:26,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:26,529 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 21 treesize of output 17 [2018-11-23 08:50:26,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:26,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:26,643 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 95 [2018-11-23 08:50:26,657 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 16 xjuncts. [2018-11-23 08:50:26,759 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 53 treesize of output 75 [2018-11-23 08:50:26,768 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 0 case distinctions, treesize of input 28 treesize of output 15 [2018-11-23 08:50:26,769 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:26,926 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 42 [2018-11-23 08:50:26,926 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-23 08:50:28,069 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,198 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 42 [2018-11-23 08:50:28,198 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:28,326 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 42 treesize of output 37 [2018-11-23 08:50:28,326 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:28,432 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 42 treesize of output 37 [2018-11-23 08:50:28,433 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-11-23 08:50:28,515 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,580 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-11-23 08:50:28,580 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,707 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 57 treesize of output 52 [2018-11-23 08:50:28,707 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,804 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 52 treesize of output 41 [2018-11-23 08:50:28,804 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,840 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 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-23 08:50:28,840 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,885 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 23 treesize of output 18 [2018-11-23 08:50:28,885 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,904 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 08:50:28,904 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,905 INFO L267 ElimStorePlain]: Start of recursive call 7: 23 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:28,909 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:157, output treesize:11 [2018-11-23 08:50:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 08:50:28,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:30,259 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 08:50:30,369 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 08:50:30,579 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 08:50:30,762 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 08:50:30,881 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 08:50:30,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:30,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:30,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:30,934 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:30,935 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:30,965 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:30,966 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:30,992 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:31,314 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:31,336 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:31,337 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:31,365 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:31,366 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:31,412 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:31,414 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:31,436 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:31,658 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 79 treesize of output 45 [2018-11-23 08:50:31,663 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 39 treesize of output 5 [2018-11-23 08:50:31,664 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:31,667 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:31,673 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 115 treesize of output 81 [2018-11-23 08:50:31,677 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 39 treesize of output 5 [2018-11-23 08:50:31,678 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:31,683 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:31,687 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 115 treesize of output 81 [2018-11-23 08:50:31,694 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 39 treesize of output 5 [2018-11-23 08:50:31,694 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:31,699 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:31,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 08:50:31,735 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:140, output treesize:88 [2018-11-23 08:50:31,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:50:31,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:50:31,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:50:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:50:32,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:50:32,019 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-11-23 08:50:32,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 08:50:32,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:32,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:32,193 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-11-23 08:50:32,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 08:50:32,298 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 18 treesize of output 15 [2018-11-23 08:50:32,301 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 08:50:32,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:32,305 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 18 treesize of output 27 [2018-11-23 08:50:32,306 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,313 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,330 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-11-23 08:50:32,489 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 45 treesize of output 39 [2018-11-23 08:50:32,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 08:50:32,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:32,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:32,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-23 08:50:33,927 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 50 treesize of output 44 [2018-11-23 08:50:33,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:33,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:33,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:33,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-11-23 08:50:33,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:33,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:33,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:33,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-23 08:50:34,850 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 29 treesize of output 20 [2018-11-23 08:50:34,857 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 20 treesize of output 19 [2018-11-23 08:50:34,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:34,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:34,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:34,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:113 [2018-11-23 08:50:35,326 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 114 treesize of output 115 [2018-11-23 08:50:35,331 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 36 treesize of output 1 [2018-11-23 08:50:35,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:35,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:35,417 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 103 treesize of output 89 [2018-11-23 08:50:35,445 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 44 treesize of output 27 [2018-11-23 08:50:35,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 08:50:35,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 08:50:35,525 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-11-23 08:50:35,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:165, output treesize:118 [2018-11-23 08:50:37,902 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 48 treesize of output 46 [2018-11-23 08:50:37,907 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 42 treesize of output 27 [2018-11-23 08:50:37,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:37,942 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 27 treesize of output 18 [2018-11-23 08:50:37,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:37,972 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 30 treesize of output 9 [2018-11-23 08:50:37,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:37,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:38,033 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 31 treesize of output 31 [2018-11-23 08:50:38,038 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 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 08:50:38,039 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:38,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 08:50:38,071 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:38,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:38,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:38,076 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:88, output treesize:9 [2018-11-23 08:50:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 08:50:38,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:50:40,199 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 08:50:40,330 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 08:50:40,574 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 08:50:40,779 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 08:50:40,927 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 08:50:40,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:40,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:40,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:40,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:40,982 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:41,011 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:41,012 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:41,036 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:41,253 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 53 treesize of output 45 [2018-11-23 08:50:41,259 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 39 treesize of output 5 [2018-11-23 08:50:41,260 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,266 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,272 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 89 treesize of output 81 [2018-11-23 08:50:41,277 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 39 treesize of output 5 [2018-11-23 08:50:41,278 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,284 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,292 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 63 treesize of output 55 [2018-11-23 08:50:41,298 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 39 treesize of output 5 [2018-11-23 08:50:41,298 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,304 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,375 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,378 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,379 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,385 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,386 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:41,392 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:41,441 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 41 treesize of output 39 [2018-11-23 08:50:41,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-23 08:50:41,446 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:41,454 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:41,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:41,464 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:50:41,465 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 41 treesize of output 52 [2018-11-23 08:50:41,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:50:41,484 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 42 treesize of output 33 [2018-11-23 08:50:41,484 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,503 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2018-11-23 08:50:41,507 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 18 treesize of output 5 [2018-11-23 08:50:41,508 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,515 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,525 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:41,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 08:50:41,572 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 4 variables, input treesize:148, output treesize:78 [2018-11-23 08:50:42,481 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 08:50:42,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:42,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:42,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:42,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:42,772 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:42,813 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:42,814 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:42,862 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:43,111 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 76 treesize of output 68 [2018-11-23 08:50:43,117 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 19 treesize of output 3 [2018-11-23 08:50:43,117 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,155 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,160 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 68 treesize of output 60 [2018-11-23 08:50:43,165 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 19 treesize of output 3 [2018-11-23 08:50:43,165 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,192 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,363 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,387 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,388 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,412 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,413 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:43,434 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:43,599 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,601 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:43,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-23 08:50:43,693 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 5 variables, input treesize:112, output treesize:107 [2018-11-23 08:50:44,249 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-11-23 08:50:44,748 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 08:50:45,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:45,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:45,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:45,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:45,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 08:50:45,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:43 [2018-11-23 08:50:46,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:46,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:46,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:50:46,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2018-11-23 08:50:47,074 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 08:50:47,280 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 08:50:47,385 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 08:50:50,152 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-11-23 08:50:50,181 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 16 treesize of output 20 [2018-11-23 08:50:50,183 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:50:50,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-11-23 08:50:50,186 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:50,195 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:50,207 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 21 treesize of output 17 [2018-11-23 08:50:50,209 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:50:50,216 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 17 treesize of output 7 [2018-11-23 08:50:50,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 08:50:50,218 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:50,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:50,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:50:50,220 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:50, output treesize:4 [2018-11-23 08:50:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 08:50:50,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:50:50,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 27] total 77 [2018-11-23 08:50:50,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-23 08:50:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-23 08:50:50,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=6713, Unknown=17, NotChecked=0, Total=7140 [2018-11-23 08:50:50,450 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 77 states. [2018-11-23 08:50:56,513 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-23 08:50:58,160 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-11-23 08:51:00,287 WARN L180 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-23 08:51:01,901 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-23 08:51:03,953 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2018-11-23 08:51:07,570 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2018-11-23 08:51:08,216 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2018-11-23 08:51:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:51:09,029 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 08:51:09,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 08:51:09,030 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 61 [2018-11-23 08:51:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:51:09,031 INFO L225 Difference]: With dead ends: 73 [2018-11-23 08:51:09,031 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 08:51:09,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 115 SyntacticMatches, 7 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4237 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=823, Invalid=11369, Unknown=18, NotChecked=0, Total=12210 [2018-11-23 08:51:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 08:51:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-23 08:51:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 08:51:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-23 08:51:09,042 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 61 [2018-11-23 08:51:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:51:09,042 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-23 08:51:09,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-23 08:51:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 08:51:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 08:51:09,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:51:09,043 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] [2018-11-23 08:51:09,043 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:51:09,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:51:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1644371608, now seen corresponding path program 2 times [2018-11-23 08:51:09,043 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 08:51:09,043 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 08:51:09,056 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 08:51:09,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:51:09,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:51:09,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:51:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:51:09,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:51:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:51:09,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:51:09,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd2f33a3-4678-4681-8611-9f5f7bc66666/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:51:09,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:51:09,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:51:09,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:51:09,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:51:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:51:09,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:51:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 08:51:09,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 08:51:09,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-11-23 08:51:09,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 08:51:09,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 08:51:09,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 08:51:09,727 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2018-11-23 08:51:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:51:10,250 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 08:51:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 08:51:10,250 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-11-23 08:51:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:51:10,250 INFO L225 Difference]: With dead ends: 67 [2018-11-23 08:51:10,250 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 08:51:10,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-11-23 08:51:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 08:51:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 08:51:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 08:51:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 08:51:10,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-11-23 08:51:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:51:10,251 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:51:10,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 08:51:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 08:51:10,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 08:51:10,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 08:51:10,808 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-11-23 08:51:11,208 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-11-23 08:51:11,555 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2018-11-23 08:51:11,827 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-11-23 08:51:12,078 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2018-11-23 08:51:12,281 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-11-23 08:51:12,670 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2018-11-23 08:51:12,672 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= dll_update_at_~data |dll_update_at_#in~data|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse5 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse0 (and .cse1 .cse2 (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) .cse4 .cse5 (= dll_update_at_~index |dll_update_at_#in~index|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base)))) (and (or .cse0 (bvsgt (bvadd |dll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (let ((.cse3 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (and .cse1 .cse2 (= dll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |dll_update_at_#in~head.base|) .cse3)) .cse4 .cse5 (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse3) dll_update_at_~head.base) (= (bvadd dll_update_at_~index (_ bv1 32)) |dll_update_at_#in~index|))) (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32)))))) (or .cse0 (bvsgt |dll_update_at_#in~index| (_ bv0 32)))))) [2018-11-23 08:51:12,672 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-11-23 08:51:12,672 INFO L444 ceAbstractionStarter]: At program point dll_update_atENTRY(lines 606 612) the Hoare annotation is: (let ((.cse0 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (and (or (bvsgt |dll_update_at_#in~index| (_ bv0 32)) .cse0) (or .cse0 (bvsgt (bvadd |dll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32)))))))) [2018-11-23 08:51:12,672 INFO L448 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2018-11-23 08:51:12,672 INFO L448 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2018-11-23 08:51:12,672 INFO L448 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-23 08:51:12,672 INFO L451 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-23 08:51:12,672 INFO L448 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-23 08:51:12,672 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-11-23 08:51:12,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 08:51:12,672 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 08:51:12,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:51:12,672 INFO L448 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-11-23 08:51:12,673 INFO L444 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) 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-11-23 08:51:12,673 INFO L444 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse6 (= (_ bv0 32) dll_create_~head~0.base))) (let ((.cse1 (= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))) (.cse4 (not (= dll_create_~new_head~0.base (_ bv0 32)))) (.cse0 (= (_ bv0 32) dll_create_~new_head~0.offset)) (.cse2 (= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))) (.cse3 (= (_ bv0 32) dll_create_~head~0.offset)) (.cse5 (not .cse6))) (or (and .cse0 (= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= |old(#memory_int)| |#memory_int|) .cse6 .cse3 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_create_~len |dll_create_#in~len|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (let ((.cse12 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse8 (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (.cse15 (select |#memory_$Pointer$.base| dll_create_~head~0.base)) (.cse16 (bvadd dll_create_~head~0.offset (_ bv4 32)))) (let ((.cse7 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse11 (bvadd dll_create_~new_head~0.offset (_ bv8 32))) (.cse14 (bvadd dll_create_~head~0.offset (_ bv8 32))) (.cse9 (select .cse15 .cse16)) (.cse10 (select .cse12 .cse8)) (.cse13 (select |#memory_$Pointer$.offset| dll_create_~head~0.base))) (and (= (select .cse7 .cse8) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse9) (_ bv8 32)) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| .cse10) (_ bv8 32)) dll_create_~new_head~0.offset) .cse1 .cse4 (= (_ bv0 32) (select .cse7 .cse11)) (= (_ bv0 32) (select .cse12 .cse11)) .cse0 (= (select .cse13 .cse14) (_ bv0 32)) .cse2 (= (_ bv0 32) (select .cse15 .cse14)) .cse3 (= dll_create_~head~0.base (select (select |#memory_$Pointer$.base| .cse9) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| .cse10) (_ bv8 32)) dll_create_~new_head~0.base) .cse5 (= (select .cse13 .cse16) (_ bv0 32)))))))) [2018-11-23 08:51:12,673 INFO L448 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2018-11-23 08:51:12,673 INFO L448 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-11-23 08:51:12,673 INFO L451 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-11-23 08:51:12,673 INFO L448 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-11-23 08:51:12,673 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-11-23 08:51:12,673 INFO L448 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-11-23 08:51:12,673 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-11-23 08:51:12,673 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:51:12,673 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 08:51:12,673 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 08:51:12,674 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 08:51:12,674 INFO L444 ceAbstractionStarter]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (bvsgt |dll_get_data_at_#in~index| (_ bv0 32)))) (or (and (= |dll_get_data_at_#in~index| dll_get_data_at_~index) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base)) (and .cse0 (bvsgt (bvadd |dll_get_data_at_#in~index| (_ bv4294967295 32)) (_ bv0 32))) (forall ((v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse3 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14)) (.cse4 (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14))) (let ((.cse2 (select .cse4 (_ bv4 32))) (.cse1 (select .cse3 (_ bv4 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| .cse1) .cse2))) (not (= (select .cse3 (_ bv8 32)) (_ bv0 32))) (= .cse1 v_main_~s~0.base_BEFORE_CALL_14) (not (= (select (select |#memory_$Pointer$.base| .cse1) (_ bv8 32)) v_main_~s~0.base_BEFORE_CALL_14)) (not (= (select .cse4 (_ bv8 32)) (_ bv0 32))) (not (= (_ bv0 32) .cse2)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse1) (_ bv8 32)))))))) (let ((.cse5 (bvadd |dll_get_data_at_#in~head.offset| (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.base| |dll_get_data_at_#in~head.base|) .cse5) dll_get_data_at_~head.base) .cse0 (= (bvadd dll_get_data_at_~index (_ bv1 32)) |dll_get_data_at_#in~index|) (= dll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |dll_get_data_at_#in~head.base|) .cse5)))) (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32))))))) [2018-11-23 08:51:12,674 INFO L448 ceAbstractionStarter]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2018-11-23 08:51:12,674 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2018-11-23 08:51:12,674 INFO L451 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2018-11-23 08:51:12,674 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2018-11-23 08:51:12,674 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2018-11-23 08:51:12,674 INFO L448 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-11-23 08:51:12,674 INFO L444 ceAbstractionStarter]: At program point L624(line 624) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse14 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse12 (select .cse7 .cse14)) (.cse11 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse3 (select (select |#memory_int| .cse12) (select .cse11 .cse14))) (.cse13 (bvneg main_~len~0)) (.cse10 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= (select .cse11 (_ bv8 32)) (_ bv0 32))) (.cse1 (= main_~len~0 .cse10)) (.cse2 (= (bvadd .cse3 (_ bv4294967295 32)) (bvneg .cse13))) (.cse4 (= (select (select |#memory_$Pointer$.base| (select .cse7 (_ bv4 32))) (_ bv8 32)) main_~s~0.base)) (.cse5 (= main_~s~0.offset (_ bv0 32))) (.cse6 (= (bvadd .cse13 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse8 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse12) (_ bv8 32)))) (.cse9 (= (select .cse11 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= (bvadd .cse3 (_ bv4294967293 32)) (_ bv0 32)) .cse4 .cse5 (= (bvadd main_~expected~0 (_ bv4294967293 32)) (_ bv0 32)) .cse6 (= (_ bv0 32) (select .cse7 (bvadd main_~s~0.offset (_ bv8 32)))) .cse8 .cse9 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (= main_~expected~0 .cse10) (= main_~i~0 (_ bv0 32)) .cse1 .cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) .cse4 .cse5 (= (_ bv0 32) (select .cse7 (_ bv8 32))) .cse6 .cse8 .cse9)))))) [2018-11-23 08:51:12,675 INFO L448 ceAbstractionStarter]: For program point L624-1(lines 624 626) no Hoare annotation was computed. [2018-11-23 08:51:12,675 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2018-11-23 08:51:12,675 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2018-11-23 08:51:12,675 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse10 (select .cse9 (_ bv4 32))) (.cse8 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse1 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse0 (= (select .cse8 (_ bv8 32)) (_ bv0 32))) (.cse3 (not (= (select .cse9 (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base))) (.cse4 (= (select (select |#memory_$Pointer$.base| .cse10) (_ bv8 32)) main_~s~0.base)) (.cse5 (= main_~s~0.offset (_ bv0 32))) (.cse2 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse10) (_ bv8 32)))) (.cse6 (= (_ bv0 32) (select .cse9 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse7 (= (select .cse8 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 (= main_~len~0 main_~new_data~0) (= main_~i~0 (_ bv0 32)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse0 .cse3 .cse4 .cse5 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) .cse2 (= (bvadd (bvneg main_~len~0) main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) .cse6 .cse7 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-11-23 08:51:12,675 INFO L448 ceAbstractionStarter]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2018-11-23 08:51:12,675 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2018-11-23 08:51:12,675 INFO L444 ceAbstractionStarter]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse16 (bvsgt main_~i~0 (_ bv0 32))) (.cse10 (= main_~i~0 (_ bv0 32))) (.cse5 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse15 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse13 (select .cse5 .cse15)) (.cse14 (bvneg main_~len~0)) (.cse12 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse8 (let ((.cse17 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse16 .cse17) (and .cse17 .cse10)))) (.cse9 (= main_~s~0.offset (_ bv0 32))) (.cse11 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))) (let ((.cse0 (and .cse16 (and .cse8 .cse9 .cse11))) (.cse1 (= (select .cse12 (_ bv8 32)) (_ bv0 32))) (.cse2 (= (select (select |#memory_$Pointer$.base| (select .cse5 (_ bv4 32))) (_ bv8 32)) main_~s~0.base)) (.cse3 (= (bvadd (select (select |#memory_int| .cse13) (select .cse12 .cse15)) (_ bv4294967295 32)) (bvneg .cse14))) (.cse4 (= (bvadd .cse14 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse13) (_ bv8 32)))) (.cse7 (= (select .cse12 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 (= (_ bv2 32) main_~i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv0 32) (select .cse5 (bvadd main_~s~0.offset (_ bv8 32)))) .cse6 .cse7 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse11 .cse3 (= (_ bv0 32) (select .cse5 (_ bv8 32))) .cse4 .cse6 .cse7))))) [2018-11-23 08:51:12,675 INFO L444 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 08:51:12,675 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (and (= |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-11-23 08:51:12,676 INFO L444 ceAbstractionStarter]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse11 (bvadd main_~s~0.offset (_ bv4 32))) (.cse13 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse14 (select .cse13 (_ bv4 32))) (.cse9 (select .cse13 .cse11)) (.cse10 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse2 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (.cse0 (= (select .cse10 (_ bv8 32)) (_ bv0 32))) (.cse4 (not (= .cse9 main_~s~0.base))) (.cse5 (= (select (select |#memory_$Pointer$.base| .cse14) (_ bv8 32)) main_~s~0.base)) (.cse6 (= main_~s~0.offset (_ bv0 32))) (.cse1 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse14) (_ bv8 32)))) (.cse7 (= (_ bv0 32) (select .cse13 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse8 (= (select .cse10 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse12 (bvneg main_~len~0))) (and .cse0 .cse1 .cse2 (= (bvadd (select (select |#memory_int| .cse9) (select .cse10 .cse11)) (_ bv4294967295 32)) (bvneg .cse12)) .cse5 .cse6 (= (_ bv0 32) (select .cse13 (_ bv8 32))) (= (bvadd .cse12 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse9) (_ bv8 32))) .cse8)) (and .cse0 .cse4 .cse5 .cse6 (= main_~i~0 (_ bv0 32)) .cse1 .cse3 .cse7 .cse8))))) [2018-11-23 08:51:12,676 INFO L448 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2018-11-23 08:51:12,676 INFO L448 ceAbstractionStarter]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2018-11-23 08:51:12,676 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) 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-11-23 08:51:12,676 INFO L444 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2018-11-23 08:51:12,676 INFO L448 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2018-11-23 08:51:12,676 INFO L451 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2018-11-23 08:51:12,676 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-11-23 08:51:12,676 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2018-11-23 08:51:12,682 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) 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-11-23 08:51:12,684 INFO L168 Benchmark]: Toolchain (without parser) took 107498.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.2 MB). Free memory was 944.4 MB in the beginning and 968.9 MB in the end (delta: -24.5 MB). Peak memory consumption was 260.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:51:12,685 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:51:12,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:51:12,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.46 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-11-23 08:51:12,685 INFO L168 Benchmark]: Boogie Preprocessor took 29.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 08:51:12,685 INFO L168 Benchmark]: RCFGBuilder took 463.65 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:51:12,686 INFO L168 Benchmark]: TraceAbstraction took 106453.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 968.9 MB in the end (delta: 107.6 MB). Peak memory consumption was 257.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:51:12,687 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.46 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 29.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 463.65 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 106453.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 968.9 MB in the end (delta: 107.6 MB). Peak memory consumption was 257.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: 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: 593]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...