java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:32:08,642 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:32:08,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:32:08,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:32:08,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:32:08,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:32:08,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:32:08,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:32:08,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:32:08,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:32:08,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:32:08,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:32:08,671 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:32:08,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:32:08,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:32:08,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:32:08,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:32:08,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:32:08,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:32:08,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:32:08,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:32:08,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:32:08,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:32:08,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:32:08,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:32:08,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:32:08,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:32:08,691 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:32:08,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:32:08,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:32:08,692 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:32:08,693 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:32:08,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:32:08,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:32:08,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:32:08,704 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:32:08,705 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:32:08,705 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:32:08,705 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:32:08,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:32:08,706 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:32:08,706 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:32:08,706 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:32:08,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:32:08,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:32:08,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:32:08,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:32:08,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:32:08,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:32:08,707 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:32:08,707 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:32:08,707 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:32:08,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:32:08,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:32:08,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:32:08,708 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:32:08,708 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:32:08,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:32:08,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:32:08,709 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:32:08,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:32:08,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:32:08,709 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:32:08,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:32:08,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:32:08,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:32:08,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:32:08,710 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:32:08,710 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:32:08,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:32:08,756 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:32:08,761 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:32:08,762 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:32:08,762 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:32:08,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:32:08,931 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:32:08,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:32:08,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:32:08,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:32:08,945 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:32:08,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:32:08" (1/1) ... [2018-01-20 22:32:08,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3346b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:08, skipping insertion in model container [2018-01-20 22:32:08,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:32:08" (1/1) ... [2018-01-20 22:32:08,964 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:32:09,005 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:32:09,131 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:32:09,155 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:32:09,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09 WrapperNode [2018-01-20 22:32:09,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:32:09,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:32:09,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:32:09,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:32:09,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09" (1/1) ... [2018-01-20 22:32:09,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09" (1/1) ... [2018-01-20 22:32:09,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09" (1/1) ... [2018-01-20 22:32:09,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09" (1/1) ... [2018-01-20 22:32:09,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09" (1/1) ... [2018-01-20 22:32:09,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09" (1/1) ... [2018-01-20 22:32:09,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09" (1/1) ... [2018-01-20 22:32:09,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:32:09,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:32:09,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:32:09,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:32:09,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:32:09,275 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:32:09,276 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:32:09,276 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:32:09,276 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:32:09,276 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:32:09,276 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:32:09,276 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:32:09,276 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:32:09,277 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:32:09,277 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:32:09,277 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:32:09,277 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:32:09,277 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:32:09,277 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:32:09,277 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:32:09,277 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:32:09,278 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:32:09,613 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:32:09,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:32:09 BoogieIcfgContainer [2018-01-20 22:32:09,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:32:09,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:32:09,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:32:09,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:32:09,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:32:08" (1/3) ... [2018-01-20 22:32:09,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716dc1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:32:09, skipping insertion in model container [2018-01-20 22:32:09,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:09" (2/3) ... [2018-01-20 22:32:09,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716dc1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:32:09, skipping insertion in model container [2018-01-20 22:32:09,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:32:09" (3/3) ... [2018-01-20 22:32:09,655 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-token_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:32:09,662 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:32:09,669 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:32:09,708 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:32:09,708 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:32:09,708 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:32:09,708 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:32:09,708 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:32:09,708 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:32:09,708 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:32:09,708 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:32:09,709 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:32:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-20 22:32:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:32:09,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:09,740 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:32:09,740 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:32:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash 217246, now seen corresponding path program 1 times [2018-01-20 22:32:09,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:09,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:09,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:09,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:09,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:32:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:32:09,855 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:32:09,863 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:32:09,868 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:32:09,869 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:32:09,869 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:32:09,869 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:32:09,869 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:32:09,869 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:32:09,869 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:32:09,869 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:32:09,869 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:32:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-20 22:32:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 22:32:09,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:09,873 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:09,874 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:32:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash -877601121, now seen corresponding path program 1 times [2018-01-20 22:32:09,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:09,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:09,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:09,876 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:09,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:09,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:10,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:10,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:32:10,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:32:10,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:32:10,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:32:10,052 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 2 states. [2018-01-20 22:32:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:10,081 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2018-01-20 22:32:10,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:32:10,083 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2018-01-20 22:32:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:10,091 INFO L225 Difference]: With dead ends: 133 [2018-01-20 22:32:10,092 INFO L226 Difference]: Without dead ends: 69 [2018-01-20 22:32:10,094 INFO L525 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-01-20 22:32:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-20 22:32:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-20 22:32:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-20 22:32:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-01-20 22:32:10,125 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 34 [2018-01-20 22:32:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:10,126 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-01-20 22:32:10,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:32:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-01-20 22:32:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-20 22:32:10,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:10,127 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:10,127 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:32:10,128 INFO L82 PathProgramCache]: Analyzing trace with hash 555175312, now seen corresponding path program 1 times [2018-01-20 22:32:10,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:10,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:10,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:10,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:10,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:32:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:32:10,238 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:32:10,251 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:32:10,261 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:32:10,261 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:32:10,277 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:32:10,277 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:32:10,277 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:32:10,277 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:32:10,277 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:32:10,277 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:32:10,277 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:32:10,277 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:32:10,277 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:32:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-20 22:32:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 22:32:10,280 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:10,280 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:10,280 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2056776860, now seen corresponding path program 1 times [2018-01-20 22:32:10,281 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:10,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:10,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:10,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:10,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:10,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:10,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:10,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:32:10,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:32:10,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:32:10,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:32:10,317 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 2 states. [2018-01-20 22:32:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:10,326 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2018-01-20 22:32:10,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:32:10,326 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-01-20 22:32:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:10,327 INFO L225 Difference]: With dead ends: 133 [2018-01-20 22:32:10,328 INFO L226 Difference]: Without dead ends: 67 [2018-01-20 22:32:10,329 INFO L525 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-01-20 22:32:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-20 22:32:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-20 22:32:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-20 22:32:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-01-20 22:32:10,336 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 32 [2018-01-20 22:32:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:10,337 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-01-20 22:32:10,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:32:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-01-20 22:32:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-20 22:32:10,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:10,339 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:10,339 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1764783467, now seen corresponding path program 1 times [2018-01-20 22:32:10,339 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:10,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:10,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:10,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:10,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:10,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:11,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:11,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-20 22:32:11,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-20 22:32:11,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-20 22:32:11,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:32:11,375 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 14 states. [2018-01-20 22:32:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:12,023 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-01-20 22:32:12,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 22:32:12,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-01-20 22:32:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:12,026 INFO L225 Difference]: With dead ends: 141 [2018-01-20 22:32:12,026 INFO L226 Difference]: Without dead ends: 130 [2018-01-20 22:32:12,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:32:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-20 22:32:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 102. [2018-01-20 22:32:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-20 22:32:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-01-20 22:32:12,040 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 49 [2018-01-20 22:32:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:12,042 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-01-20 22:32:12,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-20 22:32:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-01-20 22:32:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-20 22:32:12,044 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:12,044 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:12,044 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash 493838129, now seen corresponding path program 1 times [2018-01-20 22:32:12,045 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:12,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:12,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:12,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:12,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:12,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:12,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:12,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-20 22:32:12,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-20 22:32:12,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-20 22:32:12,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-20 22:32:12,276 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 13 states. [2018-01-20 22:32:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:12,656 INFO L93 Difference]: Finished difference Result 165 states and 172 transitions. [2018-01-20 22:32:12,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-20 22:32:12,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-01-20 22:32:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:12,657 INFO L225 Difference]: With dead ends: 165 [2018-01-20 22:32:12,657 INFO L226 Difference]: Without dead ends: 101 [2018-01-20 22:32:12,658 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2018-01-20 22:32:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-20 22:32:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2018-01-20 22:32:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-20 22:32:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-01-20 22:32:12,663 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 55 [2018-01-20 22:32:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:12,663 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-01-20 22:32:12,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-20 22:32:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-01-20 22:32:12,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-20 22:32:12,664 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:12,664 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:12,664 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:12,664 INFO L82 PathProgramCache]: Analyzing trace with hash 22904710, now seen corresponding path program 1 times [2018-01-20 22:32:12,664 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:12,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:12,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:12,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:12,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:12,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:13,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:13,546 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:13,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:13,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:13,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, 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-01-20 22:32:13,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:32:13,660 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:32:13,662 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 10 treesize of output 9 [2018-01-20 22:32:13,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-20 22:32:13,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:32:13,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-01-20 22:32:13,801 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:32:13,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,825 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-20 22:32:13,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,841 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 16 [2018-01-20 22:32:13,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:38 [2018-01-20 22:32:13,883 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 25 treesize of output 19 [2018-01-20 22:32:13,884 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 19 treesize of output 10 [2018-01-20 22:32:13,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-01-20 22:32:13,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-01-20 22:32:13,944 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 10 treesize of output 9 [2018-01-20 22:32:13,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-20 22:32:13,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,986 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-01-20 22:32:13,988 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 26 treesize of output 9 [2018-01-20 22:32:13,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:31 [2018-01-20 22:32:14,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:14,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:14,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:14,028 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 16 treesize of output 13 [2018-01-20 22:32:14,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:29 [2018-01-20 22:32:14,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:14,068 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-01-20 22:32:14,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,089 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-01-20 22:32:14,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:14,093 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 16 [2018-01-20 22:32:14,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:37 [2018-01-20 22:32:14,175 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 24 treesize of output 18 [2018-01-20 22:32:14,180 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-01-20 22:32:14,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:14,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-01-20 22:32:14,292 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-01-20 22:32:14,297 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 10 treesize of output 9 [2018-01-20 22:32:14,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:14,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-01-20 22:32:14,509 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 0 case distinctions, treesize of input 35 treesize of output 39 [2018-01-20 22:32:14,513 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-01-20 22:32:14,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,529 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 13 treesize of output 10 [2018-01-20 22:32:14,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:14,546 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-01-20 22:32:14,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:14,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:14,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:47, output treesize:10 [2018-01-20 22:32:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:14,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:14,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 36 [2018-01-20 22:32:14,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-20 22:32:14,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-20 22:32:14,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2018-01-20 22:32:14,673 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 36 states. [2018-01-20 22:32:16,198 WARN L146 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 81 DAG size of output 58 [2018-01-20 22:32:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:17,239 INFO L93 Difference]: Finished difference Result 222 states and 231 transitions. [2018-01-20 22:32:17,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-20 22:32:17,240 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 60 [2018-01-20 22:32:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:17,242 INFO L225 Difference]: With dead ends: 222 [2018-01-20 22:32:17,242 INFO L226 Difference]: Without dead ends: 211 [2018-01-20 22:32:17,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=489, Invalid=3417, Unknown=0, NotChecked=0, Total=3906 [2018-01-20 22:32:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-20 22:32:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 113. [2018-01-20 22:32:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-20 22:32:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-01-20 22:32:17,258 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 60 [2018-01-20 22:32:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:17,258 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-01-20 22:32:17,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-20 22:32:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-01-20 22:32:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-20 22:32:17,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:17,260 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:17,260 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:17,261 INFO L82 PathProgramCache]: Analyzing trace with hash -411821214, now seen corresponding path program 1 times [2018-01-20 22:32:17,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:17,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:17,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:17,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:17,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:17,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:18,219 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 60 DAG size of output 29 [2018-01-20 22:32:18,446 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 62 DAG size of output 30 [2018-01-20 22:32:18,922 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 55 DAG size of output 37 [2018-01-20 22:32:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:19,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:19,482 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:19,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:19,518 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:19,521 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-01-20 22:32:19,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:32:19,579 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:32:19,580 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 10 treesize of output 9 [2018-01-20 22:32:19,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-20 22:32:19,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:19,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:19,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:32:19,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2018-01-20 22:32:19,728 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:19,730 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 8 treesize of output 7 [2018-01-20 22:32:19,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,750 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-20 22:32:19,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:19,759 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 16 [2018-01-20 22:32:19,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2018-01-20 22:32:19,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 25 treesize of output 19 [2018-01-20 22:32:19,826 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 19 treesize of output 10 [2018-01-20 22:32:19,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2018-01-20 22:32:19,913 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-20 22:32:19,915 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 10 treesize of output 9 [2018-01-20 22:32:19,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-01-20 22:32:19,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:19,972 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-01-20 22:32:19,974 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 26 treesize of output 9 [2018-01-20 22:32:19,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:19,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:36 [2018-01-20 22:32:20,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:20,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:20,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:20,030 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 16 treesize of output 13 [2018-01-20 22:32:20,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-01-20 22:32:20,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:20,079 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-01-20 22:32:20,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,095 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-20 22:32:20,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:20,099 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 16 [2018-01-20 22:32:20,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2018-01-20 22:32:20,153 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 24 treesize of output 18 [2018-01-20 22:32:20,155 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-01-20 22:32:20,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:20,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:34 [2018-01-20 22:32:20,215 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-01-20 22:32:20,217 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 10 treesize of output 9 [2018-01-20 22:32:20,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:20,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2018-01-20 22:32:20,359 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 0 case distinctions, treesize of input 33 treesize of output 37 [2018-01-20 22:32:20,361 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 11 treesize of output 3 [2018-01-20 22:32:20,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,368 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-01-20 22:32:20,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,372 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-01-20 22:32:20,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:20,378 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:3 [2018-01-20 22:32:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:32:20,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:20,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2018-01-20 22:32:20,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-20 22:32:20,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-20 22:32:20,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2018-01-20 22:32:20,439 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 38 states. [2018-01-20 22:32:21,507 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 67 DAG size of output 61 [2018-01-20 22:32:21,893 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 109 DAG size of output 83 [2018-01-20 22:32:22,129 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 117 DAG size of output 93 [2018-01-20 22:32:23,041 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 134 DAG size of output 94 [2018-01-20 22:32:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:23,906 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-01-20 22:32:23,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-20 22:32:23,906 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2018-01-20 22:32:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:23,907 INFO L225 Difference]: With dead ends: 197 [2018-01-20 22:32:23,907 INFO L226 Difference]: Without dead ends: 156 [2018-01-20 22:32:23,908 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=429, Invalid=3861, Unknown=0, NotChecked=0, Total=4290 [2018-01-20 22:32:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-20 22:32:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 122. [2018-01-20 22:32:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-20 22:32:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-01-20 22:32:23,918 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 66 [2018-01-20 22:32:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:23,918 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-01-20 22:32:23,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-20 22:32:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-01-20 22:32:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-20 22:32:23,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:23,919 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:23,919 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash -57951755, now seen corresponding path program 2 times [2018-01-20 22:32:23,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:23,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:23,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:23,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:23,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:23,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:24,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:24,524 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:24,529 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:32:24,547 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:32:24,560 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:32:24,565 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:32:24,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:24,573 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-01-20 22:32:24,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:32:24,583 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:32:24,585 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 10 treesize of output 9 [2018-01-20 22:32:24,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-20 22:32:24,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:24,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:24,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:32:24,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2018-01-20 22:32:24,656 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:24,658 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 8 treesize of output 7 [2018-01-20 22:32:24,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,700 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-20 22:32:24,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:24,704 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 16 [2018-01-20 22:32:24,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2018-01-20 22:32:24,753 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 25 treesize of output 19 [2018-01-20 22:32:24,755 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 19 treesize of output 10 [2018-01-20 22:32:24,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2018-01-20 22:32:24,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-20 22:32:24,820 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 10 treesize of output 9 [2018-01-20 22:32:24,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-01-20 22:32:24,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:24,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:24,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:24,870 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 16 treesize of output 13 [2018-01-20 22:32:24,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-01-20 22:32:24,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:24,907 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-01-20 22:32:24,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,925 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-20 22:32:24,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:24,928 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 16 [2018-01-20 22:32:24,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,934 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2018-01-20 22:32:24,980 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 24 treesize of output 18 [2018-01-20 22:32:24,983 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-01-20 22:32:24,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:24,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:24,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:34 [2018-01-20 22:32:25,084 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-01-20 22:32:25,086 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 10 treesize of output 9 [2018-01-20 22:32:25,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:25,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-01-20 22:32:25,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:25,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 56 [2018-01-20 22:32:25,179 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 26 treesize of output 9 [2018-01-20 22:32:25,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:25,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:43 [2018-01-20 22:32:25,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:25,290 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 8 treesize of output 7 [2018-01-20 22:32:25,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,314 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-01-20 22:32:25,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:25,320 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 16 [2018-01-20 22:32:25,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:25,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:50 [2018-01-20 22:32:25,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-20 22:32:25,393 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 11 treesize of output 3 [2018-01-20 22:32:25,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:25,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:46 [2018-01-20 22:32:25,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:25,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 100 [2018-01-20 22:32:25,480 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-20 22:32:25,500 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 22:32:25,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,762 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 36 treesize of output 35 [2018-01-20 22:32:25,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:25,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:25,853 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 2 case distinctions, treesize of input 37 treesize of output 44 [2018-01-20 22:32:25,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:26,061 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:32:26,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:26,062 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 37 treesize of output 36 [2018-01-20 22:32:26,062 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:26,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:26,121 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 2 case distinctions, treesize of input 37 treesize of output 44 [2018-01-20 22:32:26,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:26,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-20 22:32:26,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 4 xjuncts. [2018-01-20 22:32:26,210 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:54, output treesize:176 [2018-01-20 22:32:26,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:26,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-20 22:32:26,555 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-01-20 22:32:26,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:26,570 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-01-20 22:32:26,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:26,594 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 13 treesize of output 10 [2018-01-20 22:32:26,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:26,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:26,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:26,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:26,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2018-01-20 22:32:26,658 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 35 [2018-01-20 22:32:26,660 INFO L267 ElimStorePlain]: Start of recursive call 7: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-01-20 22:32:26,680 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-01-20 22:32:26,680 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:26,689 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-01-20 22:32:26,689 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:26,695 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:26,737 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 0 case distinctions, treesize of input 47 treesize of output 39 [2018-01-20 22:32:26,739 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-01-20 22:32:26,739 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:26,749 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-01-20 22:32:26,750 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:26,760 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 13 treesize of output 10 [2018-01-20 22:32:26,761 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:26,767 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:26,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:32:26,804 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:138, output treesize:13 [2018-01-20 22:32:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:26,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:26,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 40 [2018-01-20 22:32:26,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-20 22:32:26,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-20 22:32:26,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2018-01-20 22:32:26,937 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 40 states. [2018-01-20 22:32:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:29,870 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2018-01-20 22:32:29,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-20 22:32:29,904 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 71 [2018-01-20 22:32:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:29,905 INFO L225 Difference]: With dead ends: 189 [2018-01-20 22:32:29,905 INFO L226 Difference]: Without dead ends: 161 [2018-01-20 22:32:29,906 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=761, Invalid=4641, Unknown=0, NotChecked=0, Total=5402 [2018-01-20 22:32:29,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-20 22:32:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 125. [2018-01-20 22:32:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-20 22:32:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-01-20 22:32:29,918 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 71 [2018-01-20 22:32:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:29,918 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-01-20 22:32:29,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-20 22:32:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-01-20 22:32:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-20 22:32:29,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:29,919 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-20 22:32:29,920 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:29,920 INFO L82 PathProgramCache]: Analyzing trace with hash -641394777, now seen corresponding path program 1 times [2018-01-20 22:32:29,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:29,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:29,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:29,921 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:32:29,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:29,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:30,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:30,979 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:30,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:31,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:31,022 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-01-20 22:32:31,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:32:31,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:32:31,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-20 22:32:31,163 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:31,164 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 8 treesize of output 7 [2018-01-20 22:32:31,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,175 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:31,177 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 8 treesize of output 7 [2018-01-20 22:32:31,177 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-01-20 22:32:31,231 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 15 treesize of output 11 [2018-01-20 22:32:31,234 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 11 treesize of output 3 [2018-01-20 22:32:31,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-01-20 22:32:31,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,312 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-20 22:32:31,314 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 16 treesize of output 1 [2018-01-20 22:32:31,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:29 [2018-01-20 22:32:31,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-20 22:32:31,390 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 16 treesize of output 1 [2018-01-20 22:32:31,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:29 [2018-01-20 22:32:31,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,443 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 20 treesize of output 21 [2018-01-20 22:32:31,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-01-20 22:32:31,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-01-20 22:32:31,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 12 treesize of output 11 [2018-01-20 22:32:31,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,519 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-01-20 22:32:31,522 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-01-20 22:32:31,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,538 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:46 [2018-01-20 22:32:31,575 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 23 treesize of output 11 [2018-01-20 22:32:31,576 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 11 treesize of output 3 [2018-01-20 22:32:31,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:51 [2018-01-20 22:32:31,631 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 78 [2018-01-20 22:32:31,634 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 28 treesize of output 1 [2018-01-20 22:32:31,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-01-20 22:32:31,655 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 16 treesize of output 15 [2018-01-20 22:32:31,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:52 [2018-01-20 22:32:32,322 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-01-20 22:32:32,334 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-20 22:32:32,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:32,351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2018-01-20 22:32:32,351 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:32,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:32,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:32,369 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:72, output treesize:47 [2018-01-20 22:32:32,562 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 26 treesize of output 24 [2018-01-20 22:32:32,564 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-01-20 22:32:32,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:32,576 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 13 treesize of output 10 [2018-01-20 22:32:32,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:32,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:32,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:32,588 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:10 [2018-01-20 22:32:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:32,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:32,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 55 [2018-01-20 22:32:32,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-20 22:32:32,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-20 22:32:32,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2797, Unknown=0, NotChecked=0, Total=2970 [2018-01-20 22:32:32,702 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 55 states. [2018-01-20 22:32:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:35,231 INFO L93 Difference]: Finished difference Result 186 states and 191 transitions. [2018-01-20 22:32:35,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-20 22:32:35,259 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 81 [2018-01-20 22:32:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:35,261 INFO L225 Difference]: With dead ends: 186 [2018-01-20 22:32:35,261 INFO L226 Difference]: Without dead ends: 175 [2018-01-20 22:32:35,263 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=634, Invalid=6338, Unknown=0, NotChecked=0, Total=6972 [2018-01-20 22:32:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-20 22:32:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 131. [2018-01-20 22:32:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-20 22:32:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-01-20 22:32:35,275 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 81 [2018-01-20 22:32:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:35,275 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-01-20 22:32:35,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-20 22:32:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-01-20 22:32:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-20 22:32:35,276 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:35,276 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:35,276 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash 800329020, now seen corresponding path program 2 times [2018-01-20 22:32:35,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:35,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:35,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:35,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:35,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:35,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:35,935 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 33 DAG size of output 25 [2018-01-20 22:32:36,338 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 40 DAG size of output 30 [2018-01-20 22:32:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:32:36,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:36,899 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:36,903 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:32:36,919 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:32:36,935 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:32:36,940 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:32:36,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:36,947 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-01-20 22:32:36,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:36,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:36,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:32:36,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:36,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:36,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:32:36,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:36,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:36,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-20 22:32:36,973 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-01-20 22:32:36,975 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 8 treesize of output 7 [2018-01-20 22:32:36,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:36,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:36,992 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-01-20 22:32:36,993 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 8 treesize of output 7 [2018-01-20 22:32:36,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:36,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-01-20 22:32:37,010 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 15 treesize of output 11 [2018-01-20 22:32:37,011 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 11 treesize of output 7 [2018-01-20 22:32:37,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-01-20 22:32:37,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,074 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-20 22:32:37,076 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 16 treesize of output 1 [2018-01-20 22:32:37,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,090 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 13 treesize of output 14 [2018-01-20 22:32:37,091 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 14 treesize of output 13 [2018-01-20 22:32:37,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:45 [2018-01-20 22:32:37,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 46 [2018-01-20 22:32:37,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:62 [2018-01-20 22:32:37,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,187 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2018-01-20 22:32:37,188 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 18 treesize of output 16 [2018-01-20 22:32:37,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,215 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2018-01-20 22:32:37,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,218 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 24 treesize of output 35 [2018-01-20 22:32:37,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:70 [2018-01-20 22:32:37,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 110 [2018-01-20 22:32:37,348 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 16 treesize of output 1 [2018-01-20 22:32:37,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,373 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 40 [2018-01-20 22:32:37,375 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 17 [2018-01-20 22:32:37,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:84 [2018-01-20 22:32:37,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 103 [2018-01-20 22:32:37,440 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 16 treesize of output 1 [2018-01-20 22:32:37,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-01-20 22:32:37,470 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 34 treesize of output 17 [2018-01-20 22:32:37,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:84 [2018-01-20 22:32:37,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-01-20 22:32:37,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:84 [2018-01-20 22:32:37,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 93 [2018-01-20 22:32:37,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-01-20 22:32:37,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 60 [2018-01-20 22:32:37,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,640 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 28 treesize of output 43 [2018-01-20 22:32:37,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 16 [2018-01-20 22:32:37,664 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 16 treesize of output 15 [2018-01-20 22:32:37,664 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,666 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,679 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:118, output treesize:108 [2018-01-20 22:32:37,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2018-01-20 22:32:37,754 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 11 treesize of output 3 [2018-01-20 22:32:37,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:37,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:167, output treesize:140 [2018-01-20 22:32:37,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 124 [2018-01-20 22:32:37,821 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 34 treesize of output 44 [2018-01-20 22:32:37,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 143 [2018-01-20 22:32:37,889 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 36 treesize of output 1 [2018-01-20 22:32:37,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:37,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:208, output treesize:121 [2018-01-20 22:32:38,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:38,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:38,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 78 [2018-01-20 22:32:38,486 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2018-01-20 22:32:38,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:38,510 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 18 treesize of output 14 [2018-01-20 22:32:38,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:38,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-01-20 22:32:38,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:38,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:38,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:38,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:130, output treesize:47 [2018-01-20 22:32:38,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:38,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:38,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:38,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:38,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 62 [2018-01-20 22:32:38,652 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-01-20 22:32:38,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:38,666 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 13 treesize of output 10 [2018-01-20 22:32:38,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:38,674 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-01-20 22:32:38,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:38,680 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-01-20 22:32:38,680 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:38,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:38,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:38,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:56, output treesize:10 [2018-01-20 22:32:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:38,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:38,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 32] total 51 [2018-01-20 22:32:38,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-20 22:32:38,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-20 22:32:38,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2363, Unknown=0, NotChecked=0, Total=2550 [2018-01-20 22:32:38,829 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 51 states. [2018-01-20 22:32:40,568 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 127 DAG size of output 91 [2018-01-20 22:32:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:42,421 INFO L93 Difference]: Finished difference Result 262 states and 270 transitions. [2018-01-20 22:32:42,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-20 22:32:42,421 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 86 [2018-01-20 22:32:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:42,422 INFO L225 Difference]: With dead ends: 262 [2018-01-20 22:32:42,422 INFO L226 Difference]: Without dead ends: 223 [2018-01-20 22:32:42,424 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=754, Invalid=6728, Unknown=0, NotChecked=0, Total=7482 [2018-01-20 22:32:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-20 22:32:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 183. [2018-01-20 22:32:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-20 22:32:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 189 transitions. [2018-01-20 22:32:42,441 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 189 transitions. Word has length 86 [2018-01-20 22:32:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:42,442 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 189 transitions. [2018-01-20 22:32:42,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-20 22:32:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 189 transitions. [2018-01-20 22:32:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-20 22:32:42,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:42,443 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-20 22:32:42,443 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash 460805827, now seen corresponding path program 3 times [2018-01-20 22:32:42,444 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:42,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:42,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:42,445 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:32:42,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:42,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 22:32:42,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:42,797 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:42,802 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:32:42,818 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:32:42,833 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:32:42,859 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:32:42,909 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:32:42,911 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:32:42,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:42,916 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-01-20 22:32:42,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:42,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:42,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:32:42,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:42,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:42,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:32:42,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:42,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:42,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-20 22:32:42,989 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:42,991 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 8 treesize of output 7 [2018-01-20 22:32:42,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:42,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,002 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:43,004 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 8 treesize of output 7 [2018-01-20 22:32:43,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-01-20 22:32:43,041 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 25 treesize of output 19 [2018-01-20 22:32:43,042 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 19 treesize of output 10 [2018-01-20 22:32:43,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2018-01-20 22:32:43,101 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-01-20 22:32:43,103 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 16 treesize of output 1 [2018-01-20 22:32:43,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:32 [2018-01-20 22:32:43,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-01-20 22:32:43,119 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 16 treesize of output 1 [2018-01-20 22:32:43,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:32 [2018-01-20 22:32:43,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:43,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:43,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:43,131 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 16 treesize of output 13 [2018-01-20 22:32:43,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2018-01-20 22:32:43,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:32:43,161 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 11 [2018-01-20 22:32:43,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,174 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-01-20 22:32:43,176 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 8 treesize of output 11 [2018-01-20 22:32:43,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,189 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:46 [2018-01-20 22:32:43,241 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 118 treesize of output 110 [2018-01-20 22:32:43,243 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 32 treesize of output 1 [2018-01-20 22:32:43,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,265 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 68 treesize of output 60 [2018-01-20 22:32:43,267 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 32 treesize of output 1 [2018-01-20 22:32:43,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:43,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:39 [2018-01-20 22:32:43,557 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 39 treesize of output 31 [2018-01-20 22:32:43,559 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 31 treesize of output 23 [2018-01-20 22:32:43,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:43,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:43 [2018-01-20 22:32:43,813 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 31 [2018-01-20 22:32:43,814 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 15 treesize of output 7 [2018-01-20 22:32:43,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,819 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-20 22:32:43,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:43,823 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:15 [2018-01-20 22:32:43,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:43,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:43,873 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 24 treesize of output 26 [2018-01-20 22:32:43,877 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-01-20 22:32:43,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:43,885 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 13 treesize of output 10 [2018-01-20 22:32:43,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:43,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:43,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:43,894 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:10 [2018-01-20 22:32:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:32:43,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:43,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27] total 40 [2018-01-20 22:32:43,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-20 22:32:43,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-20 22:32:43,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1417, Unknown=0, NotChecked=0, Total=1560 [2018-01-20 22:32:43,967 INFO L87 Difference]: Start difference. First operand 183 states and 189 transitions. Second operand 40 states. [2018-01-20 22:33:03,243 WARN L146 SmtUtils]: Spent 2040ms on a formula simplification. DAG size of input: 75 DAG size of output 45 Received shutdown request... [2018-01-20 22:33:05,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-20 22:33:05,789 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:33:05,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:33:05 BoogieIcfgContainer [2018-01-20 22:33:05,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:33:05,792 INFO L168 Benchmark]: Toolchain (without parser) took 56860.62 ms. Allocated memory was 305.7 MB in the beginning and 807.4 MB in the end (delta: 501.7 MB). Free memory was 264.0 MB in the beginning and 508.1 MB in the end (delta: -244.2 MB). Peak memory consumption was 257.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:33:05,793 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 305.7 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:33:05,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.44 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 250.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:33:05,794 INFO L168 Benchmark]: Boogie Preprocessor took 46.41 ms. Allocated memory is still 305.7 MB. Free memory was 250.9 MB in the beginning and 249.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-20 22:33:05,794 INFO L168 Benchmark]: RCFGBuilder took 436.72 ms. Allocated memory is still 305.7 MB. Free memory was 248.9 MB in the beginning and 226.3 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:33:05,794 INFO L168 Benchmark]: TraceAbstraction took 56142.76 ms. Allocated memory was 305.7 MB in the beginning and 807.4 MB in the end (delta: 501.7 MB). Free memory was 226.3 MB in the beginning and 508.1 MB in the end (delta: -281.8 MB). Peak memory consumption was 219.9 MB. Max. memory is 5.3 GB. [2018-01-20 22:33:05,796 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 305.7 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.44 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 250.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.41 ms. Allocated memory is still 305.7 MB. Free memory was 250.9 MB in the beginning and 249.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 436.72 ms. Allocated memory is still 305.7 MB. Free memory was 248.9 MB in the beginning and 226.3 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56142.76 ms. Allocated memory was 305.7 MB in the beginning and 807.4 MB in the end (delta: 501.7 MB). Free memory was 226.3 MB in the beginning and 508.1 MB in the end (delta: -281.8 MB). Peak memory consumption was 219.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 72 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L992] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={14:0}] [L992] SLL* head = malloc(sizeof(SLL)); VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L993] FCALL head->next = ((void*)0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L994] FCALL head->data = 0 VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L996] SLL* x = head; VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}] [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}] [L1008] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}] [L1008] FCALL x->next = malloc(sizeof(SLL)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}] [L1009] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}, x->next={20:0}] [L1009] FCALL x->next->data = 2 VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}, x->next={20:0}] [L1011] x = head VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}] [L1013] COND FALSE !(0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}] [L1015] EXPR, FCALL x->data VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}, x->data=1] [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}, x->data=1] [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}] [L1021] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}, x->next={20:0}] [L1021] x = x->next [L1022] EXPR, FCALL x->data VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={20:0}, x->data=2] [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={20:0}] [L1024] x = head VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}] [L1026] EXPR, FCALL x->data VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}, x->data=1] [L1026] COND FALSE !(1 != x->data) [L1032] EXPR, FCALL x->data VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}, x->data=1] [L1032] COND FALSE !(!(1 == x->data)) [L1032] COND FALSE !(0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}] [L1033] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}, x->next={20:0}] [L1033] FCALL free(x->next) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}, x->next={20:0}] [L1034] FCALL free(x) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={20:0}, x={14:0}] [L1036] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 72 locations, 3 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 1089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 31 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 60. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 72 locations, 3 error locations. TIMEOUT Result, 55.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 38.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 484 SDtfs, 3196 SDslu, 7904 SDs, 0 SdLazy, 9284 SolverSat, 836 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 854 GetRequests, 352 SyntacticMatches, 30 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 24.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 311 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 1038 NumberOfCodeBlocks, 1038 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1023 ConstructedInterpolants, 143 QuantifiedInterpolants, 2200663 SizeOfPredicates, 139 NumberOfNonLiveVariables, 1277 ConjunctsInSsa, 357 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 54/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-token_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-33-05-803.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-token_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-33-05-803.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-token_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-33-05-803.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-token_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-33-05-803.csv Completed graceful shutdown