./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/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 007e384484156a98966ed1421b3dd3e5ea133849 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/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 007e384484156a98966ed1421b3dd3e5ea133849 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_41 term size 28 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:03:23,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:03:23,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:03:23,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:03:23,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:03:23,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:03:23,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:03:23,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:03:23,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:03:23,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:03:23,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:03:23,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:03:23,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:03:23,745 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:03:23,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:03:23,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:03:23,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:03:23,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:03:23,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:03:23,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:03:23,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:03:23,754 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:03:23,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:03:23,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:03:23,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:03:23,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:03:23,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:03:23,759 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:03:23,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:03:23,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:03:23,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:03:23,762 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:03:23,762 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:03:23,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:03:23,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:03:23,763 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:03:23,764 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:03:23,776 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:03:23,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:03:23,777 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:03:23,777 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:03:23,777 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:03:23,778 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:03:23,778 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:03:23,778 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:03:23,778 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:03:23,778 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:03:23,778 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:03:23,779 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:03:23,779 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:03:23,779 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:03:23,779 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:03:23,780 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:03:23,780 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:03:23,780 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:03:23,780 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:03:23,780 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:03:23,780 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:03:23,782 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:03:23,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:03:23,783 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:03:23,783 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:03:23,783 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:03:23,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:03:23,783 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:03:23,783 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:03:23,784 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:03:23,784 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:03:23,784 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:03:23,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:03:23,784 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:03:23,784 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_93489868-66d2-47de-9189-5c54a3b11624/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 -> 007e384484156a98966ed1421b3dd3e5ea133849 [2018-10-26 21:03:23,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:03:23,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:03:23,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:03:23,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:03:23,831 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:03:23,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-10-26 21:03:23,877 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data/7cc92c9b5/12c88a2541a54e488527add930349b0a/FLAG4d0df4c84 [2018-10-26 21:03:24,331 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:03:24,331 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-10-26 21:03:24,344 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data/7cc92c9b5/12c88a2541a54e488527add930349b0a/FLAG4d0df4c84 [2018-10-26 21:03:24,357 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data/7cc92c9b5/12c88a2541a54e488527add930349b0a [2018-10-26 21:03:24,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:03:24,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:03:24,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:03:24,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:03:24,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:03:24,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24, skipping insertion in model container [2018-10-26 21:03:24,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:03:24,431 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:03:24,679 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:03:24,687 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:03:24,740 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:03:24,798 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:03:24,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24 WrapperNode [2018-10-26 21:03:24,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:03:24,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:03:24,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:03:24,799 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:03:24,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:03:24,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:03:24,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:03:24,926 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:03:24,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... [2018-10-26 21:03:24,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:03:24,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:03:24,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:03:24,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:03:24,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/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-10-26 21:03:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-10-26 21:03:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-10-26 21:03:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:03:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:03:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:03:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:03:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-10-26 21:03:25,036 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-10-26 21:03:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-10-26 21:03:25,036 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-10-26 21:03:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-10-26 21:03:25,036 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-10-26 21:03:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:03:25,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:03:25,940 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:03:25,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:03:25 BoogieIcfgContainer [2018-10-26 21:03:25,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:03:25,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:03:25,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:03:25,944 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:03:25,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:03:24" (1/3) ... [2018-10-26 21:03:25,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b6b59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:03:25, skipping insertion in model container [2018-10-26 21:03:25,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:03:24" (2/3) ... [2018-10-26 21:03:25,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b6b59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:03:25, skipping insertion in model container [2018-10-26 21:03:25,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:03:25" (3/3) ... [2018-10-26 21:03:25,948 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-memcleanup.i [2018-10-26 21:03:25,968 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:03:25,975 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:03:26,001 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:03:26,056 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:03:26,062 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:03:26,062 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:03:26,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:03:26,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:03:26,069 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:03:26,069 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:03:26,069 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:03:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-10-26 21:03:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 21:03:26,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:03:26,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:03:26,094 INFO L424 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:03:26,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:03:26,100 INFO L82 PathProgramCache]: Analyzing trace with hash 634346409, now seen corresponding path program 1 times [2018-10-26 21:03:26,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:03:26,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:26,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:03:26,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:26,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:03:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:26,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:03:26,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:03:26,218 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:03:26,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 21:03:26,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 21:03:26,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:03:26,231 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 2 states. [2018-10-26 21:03:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:03:26,258 INFO L93 Difference]: Finished difference Result 125 states and 186 transitions. [2018-10-26 21:03:26,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 21:03:26,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-26 21:03:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:03:26,268 INFO L225 Difference]: With dead ends: 125 [2018-10-26 21:03:26,268 INFO L226 Difference]: Without dead ends: 44 [2018-10-26 21:03:26,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:03:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-26 21:03:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-26 21:03:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 21:03:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-10-26 21:03:26,308 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2018-10-26 21:03:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:03:26,308 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-26 21:03:26,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 21:03:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-10-26 21:03:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:03:26,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:03:26,309 INFO L375 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-10-26 21:03:26,310 INFO L424 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:03:26,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:03:26,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1136986558, now seen corresponding path program 1 times [2018-10-26 21:03:26,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:03:26,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:03:26,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:26,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:03:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:26,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:03:26,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:03:26,377 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:03:26,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:03:26,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:03:26,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:03:26,379 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-10-26 21:03:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:03:26,453 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2018-10-26 21:03:26,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:03:26,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 21:03:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:03:26,455 INFO L225 Difference]: With dead ends: 79 [2018-10-26 21:03:26,456 INFO L226 Difference]: Without dead ends: 50 [2018-10-26 21:03:26,456 INFO L605 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-10-26 21:03:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-26 21:03:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-26 21:03:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 21:03:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-10-26 21:03:26,463 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 24 [2018-10-26 21:03:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:03:26,463 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-10-26 21:03:26,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:03:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-10-26 21:03:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:03:26,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:03:26,464 INFO L375 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-10-26 21:03:26,464 INFO L424 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:03:26,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:03:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash 125869308, now seen corresponding path program 1 times [2018-10-26 21:03:26,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:03:26,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:26,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:03:26,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:26,467 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:03:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:26,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:03:26,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:03:26,629 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:03:26,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:03:26,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:03:26,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:03:26,630 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 6 states. [2018-10-26 21:03:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:03:26,827 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2018-10-26 21:03:26,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:03:26,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-26 21:03:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:03:26,829 INFO L225 Difference]: With dead ends: 100 [2018-10-26 21:03:26,829 INFO L226 Difference]: Without dead ends: 53 [2018-10-26 21:03:26,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:03:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-26 21:03:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-26 21:03:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-26 21:03:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-10-26 21:03:26,835 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 24 [2018-10-26 21:03:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:03:26,836 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-10-26 21:03:26,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:03:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-10-26 21:03:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 21:03:26,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:03:26,841 INFO L375 BasicCegarLoop]: trace histogram [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-10-26 21:03:26,841 INFO L424 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:03:26,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:03:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1126231600, now seen corresponding path program 1 times [2018-10-26 21:03:26,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:03:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:26,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:03:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:26,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:03:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:26,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:03:26,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:03:26,927 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:03:26,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:03:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:03:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:03:26,928 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 3 states. [2018-10-26 21:03:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:03:27,003 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-10-26 21:03:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:03:27,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 21:03:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:03:27,006 INFO L225 Difference]: With dead ends: 81 [2018-10-26 21:03:27,006 INFO L226 Difference]: Without dead ends: 54 [2018-10-26 21:03:27,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:03:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-26 21:03:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-26 21:03:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-26 21:03:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-10-26 21:03:27,014 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 31 [2018-10-26 21:03:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:03:27,014 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-10-26 21:03:27,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:03:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-10-26 21:03:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 21:03:27,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:03:27,015 INFO L375 BasicCegarLoop]: trace histogram [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-10-26 21:03:27,016 INFO L424 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:03:27,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:03:27,016 INFO L82 PathProgramCache]: Analyzing trace with hash 64321736, now seen corresponding path program 1 times [2018-10-26 21:03:27,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:03:27,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:27,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:03:27,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:27,018 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:03:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:03:27,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:03:27,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 21:03:27,340 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:03:27,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:03:27,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:03:27,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:03:27,341 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 9 states. [2018-10-26 21:03:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:03:27,654 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2018-10-26 21:03:27,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:03:27,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-10-26 21:03:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:03:27,656 INFO L225 Difference]: With dead ends: 105 [2018-10-26 21:03:27,656 INFO L226 Difference]: Without dead ends: 66 [2018-10-26 21:03:27,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:03:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-26 21:03:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2018-10-26 21:03:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-26 21:03:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-10-26 21:03:27,662 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 35 [2018-10-26 21:03:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:03:27,662 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-10-26 21:03:27,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:03:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-10-26 21:03:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 21:03:27,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:03:27,664 INFO L375 BasicCegarLoop]: trace histogram [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-10-26 21:03:27,664 INFO L424 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:03:27,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:03:27,664 INFO L82 PathProgramCache]: Analyzing trace with hash -397774774, now seen corresponding path program 1 times [2018-10-26 21:03:27,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:03:27,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:27,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:03:27,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:03:27,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:03:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:28,085 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-26 21:03:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:28,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:03:28,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:03:28,236 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-10-26 21:03:28,238 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [5], [9], [11], [14], [16], [21], [23], [28], [30], [36], [42], [46], [48], [53], [55], [59], [60], [61], [65], [71], [75], [83], [89], [113], [117], [120], [142], [146], [202], [204], [205], [206], [208], [209], [210] [2018-10-26 21:03:28,293 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:03:28,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:03:29,372 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:03:29,373 INFO L272 AbstractInterpreter]: Visited 38 different actions 57 times. Merged at 14 different actions 16 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 62 variables. [2018-10-26 21:03:29,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:03:29,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:03:29,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:03:29,390 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/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-10-26 21:03:29,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:03:29,398 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:03:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:29,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:03:29,504 INFO L477 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-10-26 21:03:29,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:03:29,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:03:29,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 21:03:29,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:03:29,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:03:29,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-26 21:03:29,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:03:29,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:03:29,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:03:29,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:03:29,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:03:29,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:03:29,674 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2018-10-26 21:03:29,783 INFO L477 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 135 treesize of output 119 [2018-10-26 21:03:29,787 INFO L477 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 119 treesize of output 103 [2018-10-26 21:03:29,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:03:29,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:03:29,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 56 [2018-10-26 21:03:29,807 INFO L477 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 17 treesize of output 20 [2018-10-26 21:03:29,810 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:03:29,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-10-26 21:03:29,811 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:03:29,817 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:03:29,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2018-10-26 21:03:29,835 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:03:29,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 21:03:29,851 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-26 21:03:29,880 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:03:29,923 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:03:29,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-26 21:03:29,961 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:524, output treesize:102 [2018-10-26 21:03:59,821 WARN L179 SmtUtils]: Spent 29.82 s on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2018-10-26 21:04:15,566 WARN L179 SmtUtils]: Spent 15.71 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 21:04:31,620 WARN L179 SmtUtils]: Spent 16.02 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 21:04:46,938 WARN L179 SmtUtils]: Spent 15.28 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 21:05:02,231 WARN L179 SmtUtils]: Spent 15.26 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 21:05:18,177 WARN L179 SmtUtils]: Spent 15.92 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 21:05:18,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-10-26 21:05:18,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-10-26 21:05:18,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:18,225 INFO L477 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-10-26 21:05:18,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:18,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:18,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-10-26 21:05:18,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-10-26 21:05:18,270 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:18,279 INFO L477 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-10-26 21:05:18,279 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:18,283 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:18,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:18,289 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:75, output treesize:4 [2018-10-26 21:05:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:05:18,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:05:18,690 INFO L477 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 425 treesize of output 391 [2018-10-26 21:05:18,695 INFO L477 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 383 treesize of output 344 [2018-10-26 21:05:18,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:18,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:18,703 INFO L477 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 440 treesize of output 398 [2018-10-26 21:05:18,725 INFO L477 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 398 treesize of output 356 [2018-10-26 21:05:18,726 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:18,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:18,824 INFO L477 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 440 treesize of output 400 [2018-10-26 21:05:18,843 INFO L477 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 392 treesize of output 352 [2018-10-26 21:05:18,844 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:18,925 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:19,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-10-26 21:05:19,033 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:512, output treesize:1070 [2018-10-26 21:05:35,554 WARN L179 SmtUtils]: Spent 16.30 s on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2018-10-26 21:05:35,574 INFO L477 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 493 treesize of output 246 [2018-10-26 21:05:35,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 21:05:35,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:35,633 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 115 [2018-10-26 21:05:35,808 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-10-26 21:05:35,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-10-26 21:05:35,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:35,917 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:35,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 96 [2018-10-26 21:05:35,918 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:35,949 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:35,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 91 [2018-10-26 21:05:35,950 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,039 INFO L477 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 86 treesize of output 53 [2018-10-26 21:05:36,067 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,068 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 62 [2018-10-26 21:05:36,069 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,071 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 66 [2018-10-26 21:05:36,073 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,122 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 67 [2018-10-26 21:05:36,123 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,180 INFO L477 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 43 treesize of output 35 [2018-10-26 21:05:36,183 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,183 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,184 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-10-26 21:05:36,185 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,194 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,201 INFO L477 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 38 treesize of output 38 [2018-10-26 21:05:36,208 INFO L477 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 33 treesize of output 27 [2018-10-26 21:05:36,209 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,225 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,225 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,226 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-26 21:05:36,227 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,243 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,244 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,246 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,246 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-26 21:05:36,247 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,261 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:05:36,262 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-10-26 21:05:36,266 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,267 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,267 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-10-26 21:05:36,268 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,278 INFO L477 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-10-26 21:05:36,278 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,283 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:05:36,310 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 59 [2018-10-26 21:05:36,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-10-26 21:05:36,359 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,381 INFO L477 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 27 [2018-10-26 21:05:36,385 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,385 INFO L477 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 15 treesize of output 5 [2018-10-26 21:05:36,386 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,391 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,397 INFO L477 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 30 treesize of output 32 [2018-10-26 21:05:36,412 INFO L477 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 27 treesize of output 21 [2018-10-26 21:05:36,412 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,457 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,458 INFO L477 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 21 treesize of output 12 [2018-10-26 21:05:36,458 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,472 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-10-26 21:05:36,474 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,479 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2018-10-26 21:05:36,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,502 INFO L477 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 27 treesize of output 18 [2018-10-26 21:05:36,503 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-26 21:05:36,538 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,616 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-10-26 21:05:36,618 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,628 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,641 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:05:36,718 INFO L477 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 56 treesize of output 47 [2018-10-26 21:05:36,769 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 52 [2018-10-26 21:05:36,791 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-10-26 21:05:36,795 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,802 INFO L477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2018-10-26 21:05:36,867 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,867 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,870 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,870 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-10-26 21:05:36,872 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,874 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,874 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,875 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-26 21:05:36,876 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,933 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,933 INFO L477 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 23 treesize of output 14 [2018-10-26 21:05:36,934 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,940 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:36,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2018-10-26 21:05:36,941 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:36,958 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:05:36,974 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:05:37,027 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:37,029 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:05:37,230 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:05:37,231 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_18 term size 30 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) 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:216) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-10-26 21:05:37,241 INFO L168 Benchmark]: Toolchain (without parser) took 132880.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.8 MB). Free memory was 950.4 MB in the beginning and 1.0 GB in the end (delta: -99.0 MB). Peak memory consumption was 266.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:05:37,242 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:05:37,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.60 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 926.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:05:37,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 926.3 MB in the beginning and 1.1 GB in the end (delta: -223.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:05:37,243 INFO L168 Benchmark]: Boogie Preprocessor took 39.10 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-10-26 21:05:37,243 INFO L168 Benchmark]: RCFGBuilder took 975.67 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:05:37,243 INFO L168 Benchmark]: TraceAbstraction took 131299.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 271.0 MB. Max. memory is 11.5 GB. [2018-10-26 21:05:37,246 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 435.60 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 926.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 926.3 MB in the beginning and 1.1 GB in the end (delta: -223.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.10 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 975.67 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 131299.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 271.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_18 term size 30 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_18 term size 30: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:05:39,090 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:05:39,092 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:05:39,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:05:39,102 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:05:39,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:05:39,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:05:39,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:05:39,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:05:39,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:05:39,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:05:39,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:05:39,109 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:05:39,110 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:05:39,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:05:39,111 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:05:39,112 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:05:39,114 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:05:39,116 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:05:39,117 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:05:39,118 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:05:39,119 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:05:39,121 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:05:39,121 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:05:39,121 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:05:39,122 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:05:39,123 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:05:39,124 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:05:39,125 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:05:39,125 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:05:39,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:05:39,126 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:05:39,126 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:05:39,126 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:05:39,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:05:39,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:05:39,128 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 21:05:39,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:05:39,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:05:39,141 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:05:39,141 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:05:39,141 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:05:39,142 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:05:39,142 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:05:39,142 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:05:39,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:05:39,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:05:39,143 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:05:39,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:05:39,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:05:39,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:05:39,143 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:05:39,143 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 21:05:39,143 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 21:05:39,144 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:05:39,144 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:05:39,144 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:05:39,144 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:05:39,144 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:05:39,146 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:05:39,146 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:05:39,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:05:39,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:05:39,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:05:39,147 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:05:39,147 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 21:05:39,147 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:05:39,148 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 21:05:39,148 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 21:05:39,148 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_93489868-66d2-47de-9189-5c54a3b11624/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 -> 007e384484156a98966ed1421b3dd3e5ea133849 [2018-10-26 21:05:39,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:05:39,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:05:39,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:05:39,199 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:05:39,199 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:05:39,200 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-10-26 21:05:39,251 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data/b1d65208d/912713eab16c4afc9c85fe2919e005a7/FLAGd8f270e4f [2018-10-26 21:05:39,700 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:05:39,701 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-10-26 21:05:39,715 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data/b1d65208d/912713eab16c4afc9c85fe2919e005a7/FLAGd8f270e4f [2018-10-26 21:05:39,725 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/data/b1d65208d/912713eab16c4afc9c85fe2919e005a7 [2018-10-26 21:05:39,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:05:39,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:05:39,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:05:39,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:05:39,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:05:39,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:05:39" (1/1) ... [2018-10-26 21:05:39,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff06d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:39, skipping insertion in model container [2018-10-26 21:05:39,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:05:39" (1/1) ... [2018-10-26 21:05:39,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:05:39,782 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:05:40,058 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:05:40,070 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:05:40,115 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:05:40,162 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:05:40,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40 WrapperNode [2018-10-26 21:05:40,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:05:40,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:05:40,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:05:40,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:05:40,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... [2018-10-26 21:05:40,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... [2018-10-26 21:05:40,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:05:40,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:05:40,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:05:40,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:05:40,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... [2018-10-26 21:05:40,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... [2018-10-26 21:05:40,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... [2018-10-26 21:05:40,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... [2018-10-26 21:05:40,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... [2018-10-26 21:05:40,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... [2018-10-26 21:05:40,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... [2018-10-26 21:05:40,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:05:40,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:05:40,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:05:40,384 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:05:40,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/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-10-26 21:05:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-10-26 21:05:40,460 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-10-26 21:05:40,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:05:40,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:05:40,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:05:40,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:05:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-10-26 21:05:40,462 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-10-26 21:05:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-10-26 21:05:40,462 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-10-26 21:05:40,463 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-10-26 21:05:40,463 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-10-26 21:05:40,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:05:40,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:05:41,281 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:05:41,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:05:41 BoogieIcfgContainer [2018-10-26 21:05:41,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:05:41,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:05:41,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:05:41,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:05:41,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:05:39" (1/3) ... [2018-10-26 21:05:41,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d2caf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:05:41, skipping insertion in model container [2018-10-26 21:05:41,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:05:40" (2/3) ... [2018-10-26 21:05:41,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d2caf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:05:41, skipping insertion in model container [2018-10-26 21:05:41,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:05:41" (3/3) ... [2018-10-26 21:05:41,290 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-memcleanup.i [2018-10-26 21:05:41,302 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:05:41,309 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:05:41,318 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:05:41,345 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:05:41,346 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:05:41,346 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:05:41,346 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:05:41,346 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:05:41,346 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:05:41,346 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:05:41,346 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:05:41,347 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:05:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-10-26 21:05:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 21:05:41,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:05:41,370 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:05:41,372 INFO L424 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:05:41,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:05:41,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1906774198, now seen corresponding path program 1 times [2018-10-26 21:05:41,382 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:05:41,382 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/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-10-26 21:05:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:05:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:05:41,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:05:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:05:41,479 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:05:41,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:05:41,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:05:41,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 21:05:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 21:05:41,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:05:41,502 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-10-26 21:05:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:05:41,527 INFO L93 Difference]: Finished difference Result 123 states and 184 transitions. [2018-10-26 21:05:41,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 21:05:41,528 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-26 21:05:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:05:41,537 INFO L225 Difference]: With dead ends: 123 [2018-10-26 21:05:41,537 INFO L226 Difference]: Without dead ends: 43 [2018-10-26 21:05:41,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:05:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-26 21:05:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-26 21:05:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-26 21:05:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-10-26 21:05:41,574 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 21 [2018-10-26 21:05:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:05:41,574 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-10-26 21:05:41,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 21:05:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-10-26 21:05:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:05:41,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:05:41,576 INFO L375 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] [2018-10-26 21:05:41,576 INFO L424 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:05:41,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:05:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1704776539, now seen corresponding path program 1 times [2018-10-26 21:05:41,577 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:05:41,577 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/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-10-26 21:05:41,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:05:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:05:41,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:05:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:05:41,677 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:05:41,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:05:41,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:05:41,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:05:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:05:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:05:41,681 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 3 states. [2018-10-26 21:05:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:05:41,769 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2018-10-26 21:05:41,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:05:41,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 21:05:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:05:41,774 INFO L225 Difference]: With dead ends: 77 [2018-10-26 21:05:41,774 INFO L226 Difference]: Without dead ends: 48 [2018-10-26 21:05:41,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-10-26 21:05:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-26 21:05:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-26 21:05:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 21:05:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-10-26 21:05:41,782 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 23 [2018-10-26 21:05:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:05:41,783 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-10-26 21:05:41,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:05:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-10-26 21:05:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:05:41,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:05:41,784 INFO L375 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] [2018-10-26 21:05:41,784 INFO L424 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:05:41,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:05:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash 693659289, now seen corresponding path program 1 times [2018-10-26 21:05:41,786 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:05:41,786 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/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-10-26 21:05:41,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:05:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:05:41,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:05:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:05:42,078 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:05:42,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:05:42,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:05:42,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:05:42,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:05:42,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:05:42,081 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 6 states. [2018-10-26 21:05:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:05:42,231 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2018-10-26 21:05:42,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:05:42,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-10-26 21:05:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:05:42,233 INFO L225 Difference]: With dead ends: 97 [2018-10-26 21:05:42,234 INFO L226 Difference]: Without dead ends: 51 [2018-10-26 21:05:42,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:05:42,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-26 21:05:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-26 21:05:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 21:05:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-10-26 21:05:42,242 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 23 [2018-10-26 21:05:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:05:42,242 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-10-26 21:05:42,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:05:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-10-26 21:05:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 21:05:42,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:05:42,243 INFO L375 BasicCegarLoop]: trace histogram [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-10-26 21:05:42,244 INFO L424 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:05:42,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:05:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 621554021, now seen corresponding path program 1 times [2018-10-26 21:05:42,246 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:05:42,246 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 21:05:42,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:05:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:05:42,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:05:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:05:42,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:05:42,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:05:42,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:05:42,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:05:42,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:05:42,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:05:42,334 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 3 states. [2018-10-26 21:05:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:05:42,589 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-10-26 21:05:42,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:05:42,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 21:05:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:05:42,592 INFO L225 Difference]: With dead ends: 77 [2018-10-26 21:05:42,592 INFO L226 Difference]: Without dead ends: 50 [2018-10-26 21:05:42,593 INFO L605 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-10-26 21:05:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-26 21:05:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-26 21:05:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 21:05:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-10-26 21:05:42,600 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 29 [2018-10-26 21:05:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:05:42,600 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-10-26 21:05:42,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:05:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-10-26 21:05:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 21:05:42,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:05:42,602 INFO L375 BasicCegarLoop]: trace histogram [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-10-26 21:05:42,602 INFO L424 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:05:42,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:05:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash 981959101, now seen corresponding path program 1 times [2018-10-26 21:05:42,603 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:05:42,603 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/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-10-26 21:05:42,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:05:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:05:42,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:05:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:05:43,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:05:43,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:05:43,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 21:05:43,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:05:43,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:05:43,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:05:43,246 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-10-26 21:05:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:05:45,307 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2018-10-26 21:05:45,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:05:45,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-10-26 21:05:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:05:45,311 INFO L225 Difference]: With dead ends: 102 [2018-10-26 21:05:45,311 INFO L226 Difference]: Without dead ends: 64 [2018-10-26 21:05:45,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:05:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-26 21:05:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2018-10-26 21:05:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 21:05:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-10-26 21:05:45,321 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 33 [2018-10-26 21:05:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:05:45,321 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-10-26 21:05:45,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:05:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-10-26 21:05:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:05:45,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:05:45,323 INFO L375 BasicCegarLoop]: trace histogram [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-10-26 21:05:45,323 INFO L424 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:05:45,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:05:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1828948447, now seen corresponding path program 1 times [2018-10-26 21:05:45,324 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:05:45,324 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93489868-66d2-47de-9189-5c54a3b11624/bin-2019/utaipan/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 21:05:45,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:05:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:05:45,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:05:45,529 INFO L477 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-10-26 21:05:45,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:45,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:45,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 21:05:45,613 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:05:45,614 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:05:45,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-26 21:05:45,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:45,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:05:45,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:05:45,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:45,660 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:45,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:45,675 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:26 [2018-10-26 21:05:46,042 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 30 [2018-10-26 21:05:46,049 INFO L477 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 135 treesize of output 119 [2018-10-26 21:05:46,058 INFO L477 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 119 treesize of output 103 [2018-10-26 21:05:46,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:46,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:46,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 56 [2018-10-26 21:05:46,192 INFO L477 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 17 treesize of output 20 [2018-10-26 21:05:46,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:05:46,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-10-26 21:05:46,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:46,212 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:46,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2018-10-26 21:05:46,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:05:46,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 21:05:46,329 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-26 21:05:46,400 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:05:46,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:05:46,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-26 21:05:46,606 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:527, output treesize:109 [2018-10-26 21:05:56,707 WARN L179 SmtUtils]: Spent 10.05 s on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2018-10-26 21:05:57,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-10-26 21:05:57,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-10-26 21:05:57,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:57,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 21:05:57,111 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:57,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:57,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:57,120 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-10-26 21:05:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:05:57,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:05:57,865 WARN L179 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-10-26 21:05:58,172 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-26 21:05:58,445 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-10-26 21:05:58,696 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-10-26 21:05:58,972 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-26 21:05:58,984 INFO L477 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 425 treesize of output 391 [2018-10-26 21:05:58,999 INFO L477 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 383 treesize of output 344 [2018-10-26 21:05:59,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:05:59,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:05:59,038 INFO L477 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 440 treesize of output 398 [2018-10-26 21:05:59,043 INFO L477 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 398 treesize of output 356 [2018-10-26 21:05:59,044 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:59,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:59,078 INFO L477 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 440 treesize of output 400 [2018-10-26 21:05:59,083 INFO L477 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 392 treesize of output 352 [2018-10-26 21:05:59,084 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:59,116 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:05:59,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-10-26 21:05:59,666 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:512, output treesize:1070 [2018-10-26 21:06:09,925 WARN L179 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2018-10-26 21:06:09,946 INFO L477 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 482 treesize of output 235 [2018-10-26 21:06:10,131 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-26 21:06:10,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 21:06:10,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:10,247 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:10,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 164 treesize of output 117 [2018-10-26 21:06:10,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-10-26 21:06:10,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:10,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:10,366 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:10,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-10-26 21:06:10,436 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 48 [2018-10-26 21:06:10,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 42 [2018-10-26 21:06:10,492 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-26 21:06:10,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 55 [2018-10-26 21:06:10,804 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-10-26 21:06:11,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 35 [2018-10-26 21:06:11,151 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-26 21:06:11,289 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:06:11,353 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:11,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:11,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2018-10-26 21:06:11,402 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2018-10-26 21:06:11,403 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 21:06:11,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2018-10-26 21:06:11,545 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:11,628 INFO L477 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 38 treesize of output 32 [2018-10-26 21:06:11,629 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:11,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2018-10-26 21:06:11,726 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:11,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-10-26 21:06:11,832 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:11,954 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:11,954 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:11,955 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-26 21:06:11,955 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:11,958 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:11,959 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:11,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-26 21:06:11,959 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:12,060 INFO L267 ElimStorePlain]: Start of recursive call 11: 7 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:06:12,064 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:12,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 53 [2018-10-26 21:06:12,133 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:12,133 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:12,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-10-26 21:06:12,134 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:12,247 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:12,249 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:12,250 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:12,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-10-26 21:06:12,251 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:12,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2018-10-26 21:06:12,371 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:12,477 INFO L477 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 40 treesize of output 32 [2018-10-26 21:06:12,477 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:12,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-10-26 21:06:12,597 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:12,705 INFO L477 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 17 [2018-10-26 21:06:12,706 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:12,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-26 21:06:12,710 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:12,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-10-26 21:06:12,809 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:12,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2018-10-26 21:06:12,925 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:12,998 INFO L267 ElimStorePlain]: Start of recursive call 19: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:06:13,001 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:13,006 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:13,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 58 [2018-10-26 21:06:13,106 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2018-10-26 21:06:13,107 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 21:06:13,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 40 [2018-10-26 21:06:13,255 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:13,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 31 [2018-10-26 21:06:13,409 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:13,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-10-26 21:06:13,524 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:13,622 INFO L477 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 16 [2018-10-26 21:06:13,622 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:13,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2018-10-26 21:06:13,793 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:13,880 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:13,880 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:13,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-10-26 21:06:13,881 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:13,894 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:13,894 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:13,895 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-10-26 21:06:13,895 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:13,959 INFO L267 ElimStorePlain]: Start of recursive call 29: 7 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:06:13,961 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:13,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 51 [2018-10-26 21:06:14,009 INFO L477 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 38 treesize of output 32 [2018-10-26 21:06:14,010 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:14,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2018-10-26 21:06:14,143 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-10-26 21:06:14,277 INFO L477 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 36 treesize of output 30 [2018-10-26 21:06:14,278 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:14,396 INFO L477 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 30 treesize of output 24 [2018-10-26 21:06:14,397 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:14,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-26 21:06:14,520 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:14,697 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:14,717 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:14,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-10-26 21:06:14,718 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,093 INFO L477 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 27 treesize of output 19 [2018-10-26 21:06:15,093 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-10-26 21:06:15,096 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,173 INFO L267 ElimStorePlain]: Start of recursive call 38: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:06:15,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-26 21:06:15,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:06:15,280 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:15,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 81 [2018-10-26 21:06:15,401 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2018-10-26 21:06:15,426 INFO L477 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 21 treesize of output 12 [2018-10-26 21:06:15,426 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,446 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:15,457 INFO L477 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 49 treesize of output 45 [2018-10-26 21:06:15,515 INFO L477 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-10-26 21:06:15,515 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,550 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:15,550 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:15,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2018-10-26 21:06:15,567 INFO L477 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 24 treesize of output 7 [2018-10-26 21:06:15,567 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,579 INFO L267 ElimStorePlain]: Start of recursive call 51: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,583 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:15,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 41 [2018-10-26 21:06:15,610 INFO L477 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 19 [2018-10-26 21:06:15,611 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,680 INFO L477 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 19 treesize of output 7 [2018-10-26 21:06:15,681 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-10-26 21:06:15,759 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,770 INFO L267 ElimStorePlain]: Start of recursive call 53: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,774 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:15,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-10-26 21:06:15,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-10-26 21:06:15,780 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,788 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:15,811 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:06:15,822 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:06:15,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-26 21:06:16,132 INFO L477 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 493 treesize of output 246 [2018-10-26 21:06:16,255 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2018-10-26 21:06:16,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 21:06:16,264 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:16,392 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 115 [2018-10-26 21:06:17,082 WARN L179 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-10-26 21:06:17,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-10-26 21:06:17,088 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:17,531 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:17,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 96 [2018-10-26 21:06:17,532 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:17,539 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:17,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 89 [2018-10-26 21:06:17,541 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,099 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:18,100 INFO L477 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 86 treesize of output 63 [2018-10-26 21:06:18,252 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-26 21:06:18,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-26 21:06:18,260 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-10-26 21:06:18,326 INFO L477 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 25 treesize of output 19 [2018-10-26 21:06:18,327 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,364 INFO L477 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 19 treesize of output 10 [2018-10-26 21:06:18,364 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-10-26 21:06:18,402 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,415 INFO L267 ElimStorePlain]: Start of recursive call 67: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,436 INFO L477 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 28 treesize of output 30 [2018-10-26 21:06:18,441 INFO L477 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 25 treesize of output 16 [2018-10-26 21:06:18,441 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-26 21:06:18,475 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-10-26 21:06:18,506 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,518 INFO L267 ElimStorePlain]: Start of recursive call 71: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,523 INFO L477 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 29 treesize of output 25 [2018-10-26 21:06:18,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-10-26 21:06:18,528 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,540 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,566 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:06:18,602 INFO L477 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 56 treesize of output 50 [2018-10-26 21:06:18,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 52 [2018-10-26 21:06:18,668 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:18,668 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:18,669 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-10-26 21:06:18,670 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:18,810 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:18,815 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:06:19,016 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 21:06:19,017 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_41 term size 28 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) 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.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-10-26 21:06:19,020 INFO L168 Benchmark]: Toolchain (without parser) took 39291.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.8 MB). Free memory was 947.9 MB in the beginning and 949.1 MB in the end (delta: -1.2 MB). Peak memory consumption was 330.0 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:19,021 INFO L168 Benchmark]: CDTParser took 0.16 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-10-26 21:06:19,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 926.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:19,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.01 ms. Allocated memory is still 1.0 GB. Free memory was 926.4 MB in the beginning and 921.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:19,022 INFO L168 Benchmark]: Boogie Preprocessor took 155.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 921.0 MB in the beginning and 1.2 GB in the end (delta: -258.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:19,022 INFO L168 Benchmark]: RCFGBuilder took 898.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:19,022 INFO L168 Benchmark]: TraceAbstraction took 37737.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 949.1 MB in the end (delta: 183.7 MB). Peak memory consumption was 322.0 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:19,024 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.16 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 432.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 926.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.01 ms. Allocated memory is still 1.0 GB. Free memory was 926.4 MB in the beginning and 921.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 155.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 921.0 MB in the beginning and 1.2 GB in the end (delta: -258.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 898.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37737.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 949.1 MB in the end (delta: 183.7 MB). Peak memory consumption was 322.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_41 term size 28 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_41 term size 28: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...