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-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:31:27,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:31:27,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:31:27,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:31:27,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:31:27,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:31:27,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:31:27,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:31:27,647 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:31:27,648 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:31:27,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:31:27,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:31:27,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:31:27,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:31:27,651 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:31:27,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:31:27,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:31:27,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:31:27,659 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:31:27,660 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:31:27,662 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:31:27,663 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:31:27,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:31:27,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:31:27,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:31:27,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:31:27,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:31:27,667 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:31:27,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:31:27,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:31:27,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:31:27,668 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:31:27,678 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:31:27,678 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:31:27,679 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:31:27,679 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:31:27,680 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:31:27,680 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:31:27,680 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:31:27,681 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:31:27,681 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:31:27,681 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:31:27,681 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:31:27,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:31:27,682 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:31:27,682 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:31:27,682 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:31:27,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:31:27,682 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:31:27,682 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:31:27,683 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:31:27,683 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:31:27,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:31:27,683 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:31:27,683 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:31:27,684 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:31:27,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:31:27,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:31:27,684 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:31:27,684 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:31:27,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:31:27,685 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:31:27,685 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:31:27,685 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:31:27,685 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:31:27,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:31:27,686 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:31:27,687 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:31:27,687 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:31:27,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:31:27,735 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:31:27,740 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:31:27,742 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:31:27,742 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:31:27,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:31:27,922 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:31:27,927 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:31:27,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:31:27,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:31:27,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:31:27,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:31:27" (1/1) ... [2018-01-20 22:31:27,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6479bd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:27, skipping insertion in model container [2018-01-20 22:31:27,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:31:27" (1/1) ... [2018-01-20 22:31:27,958 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:31:28,001 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:31:28,116 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:31:28,137 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:31:28,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28 WrapperNode [2018-01-20 22:31:28,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:31:28,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:31:28,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:31:28,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:31:28,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28" (1/1) ... [2018-01-20 22:31:28,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28" (1/1) ... [2018-01-20 22:31:28,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28" (1/1) ... [2018-01-20 22:31:28,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28" (1/1) ... [2018-01-20 22:31:28,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28" (1/1) ... [2018-01-20 22:31:28,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28" (1/1) ... [2018-01-20 22:31:28,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28" (1/1) ... [2018-01-20 22:31:28,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:31:28,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:31:28,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:31:28,186 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:31:28,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28" (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:31:28,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:31:28,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:31:28,232 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:31:28,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:31:28,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:31:28,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:31:28,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:31:28,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:31:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:31:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:31:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:31:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:31:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:31:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:31:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:31:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:31:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:31:28,662 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:31:28,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:31:28 BoogieIcfgContainer [2018-01-20 22:31:28,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:31:28,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:31:28,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:31:28,666 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:31:28,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:31:27" (1/3) ... [2018-01-20 22:31:28,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc7bd64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:31:28, skipping insertion in model container [2018-01-20 22:31:28,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:28" (2/3) ... [2018-01-20 22:31:28,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc7bd64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:31:28, skipping insertion in model container [2018-01-20 22:31:28,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:31:28" (3/3) ... [2018-01-20 22:31:28,670 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:31:28,676 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:31:28,683 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:31:28,722 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:31:28,722 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:31:28,722 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:31:28,722 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:31:28,722 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:31:28,722 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:31:28,722 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:31:28,723 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:31:28,723 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:31:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-01-20 22:31:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:31:28,746 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:28,747 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:31:28,747 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:31:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash 330448, now seen corresponding path program 1 times [2018-01-20 22:31:28,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:28,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:28,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:28,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:28,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:31:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:31:28,849 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:31:28,855 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:31:28,863 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:31:28,863 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:31:28,863 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:31:28,863 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:31:28,864 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:31:28,864 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:31:28,864 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:31:28,864 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:31:28,864 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:31:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-01-20 22:31:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 22:31:28,872 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:28,872 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:31:28,872 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:28,873 INFO L82 PathProgramCache]: Analyzing trace with hash 439581356, now seen corresponding path program 1 times [2018-01-20 22:31:28,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:28,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:28,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:28,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:28,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:28,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:29,027 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:31:29,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:29,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:31:29,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:31:29,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:31:29,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:31:29,048 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2018-01-20 22:31:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:29,081 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-01-20 22:31:29,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:31:29,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-01-20 22:31:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:29,095 INFO L225 Difference]: With dead ends: 194 [2018-01-20 22:31:29,095 INFO L226 Difference]: Without dead ends: 106 [2018-01-20 22:31:29,099 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:31:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-20 22:31:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-20 22:31:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-20 22:31:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-01-20 22:31:29,145 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 32 [2018-01-20 22:31:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:29,146 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-01-20 22:31:29,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:31:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-01-20 22:31:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-20 22:31:29,148 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:29,148 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:31:29,149 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1763191735, now seen corresponding path program 1 times [2018-01-20 22:31:29,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:29,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:29,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:29,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:29,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:29,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:29,230 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:31:29,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:29,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:31:29,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:31:29,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:31:29,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:31:29,234 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 3 states. [2018-01-20 22:31:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:29,286 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2018-01-20 22:31:29,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:31:29,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-01-20 22:31:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:29,291 INFO L225 Difference]: With dead ends: 226 [2018-01-20 22:31:29,292 INFO L226 Difference]: Without dead ends: 130 [2018-01-20 22:31:29,293 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:31:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-20 22:31:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 117. [2018-01-20 22:31:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-20 22:31:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2018-01-20 22:31:29,305 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 49 [2018-01-20 22:31:29,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:29,305 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2018-01-20 22:31:29,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:31:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2018-01-20 22:31:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-20 22:31:29,308 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:29,308 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, 1] [2018-01-20 22:31:29,308 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash 651675214, now seen corresponding path program 1 times [2018-01-20 22:31:29,309 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:29,309 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:29,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:29,310 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:29,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:29,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:31:29,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:29,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:31:29,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:31:29,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:31:29,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:31:29,464 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand 5 states. [2018-01-20 22:31:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:29,641 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2018-01-20 22:31:29,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:31:29,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-01-20 22:31:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:29,643 INFO L225 Difference]: With dead ends: 208 [2018-01-20 22:31:29,643 INFO L226 Difference]: Without dead ends: 197 [2018-01-20 22:31:29,644 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:31:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-20 22:31:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2018-01-20 22:31:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-20 22:31:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2018-01-20 22:31:29,658 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 61 [2018-01-20 22:31:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:29,659 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2018-01-20 22:31:29,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:31:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2018-01-20 22:31:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-20 22:31:29,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:29,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:29,662 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:29,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1008289951, now seen corresponding path program 1 times [2018-01-20 22:31:29,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:29,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:29,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:29,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:29,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:29,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-20 22:31:29,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:29,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 22:31:29,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:31:29,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:31:29,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:31:29,783 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 6 states. [2018-01-20 22:31:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:29,985 INFO L93 Difference]: Finished difference Result 243 states and 267 transitions. [2018-01-20 22:31:29,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 22:31:29,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-01-20 22:31:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:29,989 INFO L225 Difference]: With dead ends: 243 [2018-01-20 22:31:29,989 INFO L226 Difference]: Without dead ends: 197 [2018-01-20 22:31:29,990 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-20 22:31:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-20 22:31:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2018-01-20 22:31:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-20 22:31:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-01-20 22:31:30,004 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 79 [2018-01-20 22:31:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:30,005 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-01-20 22:31:30,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:31:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-01-20 22:31:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-20 22:31:30,008 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:30,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:30,009 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:30,009 INFO L82 PathProgramCache]: Analyzing trace with hash -159123330, now seen corresponding path program 1 times [2018-01-20 22:31:30,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:30,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:30,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:30,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:30,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:30,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-20 22:31:30,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:30,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 22:31:30,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:31:30,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:31:30,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:31:30,185 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 7 states. [2018-01-20 22:31:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:30,408 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2018-01-20 22:31:30,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:31:30,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-01-20 22:31:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:30,411 INFO L225 Difference]: With dead ends: 222 [2018-01-20 22:31:30,411 INFO L226 Difference]: Without dead ends: 148 [2018-01-20 22:31:30,412 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-20 22:31:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-20 22:31:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2018-01-20 22:31:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-20 22:31:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-01-20 22:31:30,430 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 81 [2018-01-20 22:31:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:30,430 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-01-20 22:31:30,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:31:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-01-20 22:31:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-20 22:31:30,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:30,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:30,432 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:30,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1056516608, now seen corresponding path program 1 times [2018-01-20 22:31:30,433 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:30,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:30,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:30,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:30,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:30,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:31:30,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:30,663 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:31:30,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:30,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:30,835 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:31:30,839 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:31:30,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:30,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:30,857 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:31:30,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-20 22:31:30,872 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 16 treesize of output 12 [2018-01-20 22:31:30,880 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 12 treesize of output 4 [2018-01-20 22:31:30,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:30,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:30,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:30,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-01-20 22:31:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:31:30,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:30,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-20 22:31:30,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:31:30,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:31:30,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:31:30,936 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 9 states. [2018-01-20 22:31:31,285 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 23 DAG size of output 19 [2018-01-20 22:31:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:31,541 INFO L93 Difference]: Finished difference Result 298 states and 324 transitions. [2018-01-20 22:31:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 22:31:31,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-01-20 22:31:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:31,543 INFO L225 Difference]: With dead ends: 298 [2018-01-20 22:31:31,544 INFO L226 Difference]: Without dead ends: 285 [2018-01-20 22:31:31,544 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:31:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-20 22:31:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 183. [2018-01-20 22:31:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-20 22:31:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2018-01-20 22:31:31,558 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 81 [2018-01-20 22:31:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:31,558 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2018-01-20 22:31:31,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:31:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2018-01-20 22:31:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-20 22:31:31,559 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:31,560 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:31,560 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2073781002, now seen corresponding path program 1 times [2018-01-20 22:31:31,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:31,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:31,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:31,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:31,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:31,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:31:31,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:31,761 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:31:31,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:31,822 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:31,851 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:31:31,861 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:31:31,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:31,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:31,876 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:31:31,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-20 22:31:31,885 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 16 treesize of output 12 [2018-01-20 22:31:31,887 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 12 treesize of output 4 [2018-01-20 22:31:31,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:31,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:31,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:31,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-01-20 22:31:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:31:31,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:31,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-20 22:31:31,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:31:31,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:31:31,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:31:31,928 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand 9 states. [2018-01-20 22:31:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:32,294 INFO L93 Difference]: Finished difference Result 317 states and 345 transitions. [2018-01-20 22:31:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 22:31:32,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-01-20 22:31:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:32,296 INFO L225 Difference]: With dead ends: 317 [2018-01-20 22:31:32,296 INFO L226 Difference]: Without dead ends: 304 [2018-01-20 22:31:32,297 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:31:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-20 22:31:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 197. [2018-01-20 22:31:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-20 22:31:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2018-01-20 22:31:32,309 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 83 [2018-01-20 22:31:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:32,310 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2018-01-20 22:31:32,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:31:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2018-01-20 22:31:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-20 22:31:32,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:32,312 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:32,312 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 781104601, now seen corresponding path program 1 times [2018-01-20 22:31:32,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:32,312 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:32,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:32,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:32,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:32,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-20 22:31:32,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:32,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:31:32,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:31:32,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:31:32,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:31:32,389 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand 3 states. [2018-01-20 22:31:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:32,405 INFO L93 Difference]: Finished difference Result 291 states and 323 transitions. [2018-01-20 22:31:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:31:32,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-01-20 22:31:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:32,406 INFO L225 Difference]: With dead ends: 291 [2018-01-20 22:31:32,407 INFO L226 Difference]: Without dead ends: 197 [2018-01-20 22:31:32,407 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:31:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-20 22:31:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-01-20 22:31:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-20 22:31:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2018-01-20 22:31:32,419 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 92 [2018-01-20 22:31:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:32,420 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2018-01-20 22:31:32,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:31:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2018-01-20 22:31:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-20 22:31:32,421 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:32,422 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:32,422 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash 832080079, now seen corresponding path program 2 times [2018-01-20 22:31:32,422 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:32,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:32,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:32,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:32,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:32,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-20 22:31:32,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:32,625 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:31:32,632 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:31:32,657 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:32,748 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:32,751 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:32,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:32,863 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:31:32,865 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:31:32,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,874 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:31:32,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-01-20 22:31:32,912 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 16 treesize of output 12 [2018-01-20 22:31:32,914 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 12 treesize of output 4 [2018-01-20 22:31:32,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,916 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:31:32,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-01-20 22:31:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-20 22:31:32,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:32,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-01-20 22:31:32,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-20 22:31:32,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-20 22:31:32,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-20 22:31:32,962 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand 16 states. [2018-01-20 22:31:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:33,516 INFO L93 Difference]: Finished difference Result 287 states and 311 transitions. [2018-01-20 22:31:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-20 22:31:33,516 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2018-01-20 22:31:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:33,518 INFO L225 Difference]: With dead ends: 287 [2018-01-20 22:31:33,518 INFO L226 Difference]: Without dead ends: 282 [2018-01-20 22:31:33,518 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2018-01-20 22:31:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-01-20 22:31:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 238. [2018-01-20 22:31:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-20 22:31:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 262 transitions. [2018-01-20 22:31:33,536 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 262 transitions. Word has length 94 [2018-01-20 22:31:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:33,537 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 262 transitions. [2018-01-20 22:31:33,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-20 22:31:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 262 transitions. [2018-01-20 22:31:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-20 22:31:33,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:33,539 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:33,539 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1265792568, now seen corresponding path program 1 times [2018-01-20 22:31:33,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:33,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:33,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:33,540 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:31:33,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:33,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:34,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:34,672 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:31:34,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:34,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:35,096 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_1 Int) (main_~head~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~head~5.base 1))) (let ((.cse1 (store .cse0 v_prenex_2 1))) (and (= 0 (select .cse0 v_prenex_2)) (= |c_#valid| (store (store .cse1 v_prenex_1 1) main_~head~5.base 0)) (not (= 0 main_~head~5.base)) (= 0 (select .cse1 v_prenex_1)) (= 0 (select |c_old(#valid)| main_~head~5.base)))))) is different from true [2018-01-20 22:31:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2018-01-20 22:31:35,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:35,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 26 [2018-01-20 22:31:35,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-20 22:31:35,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-20 22:31:35,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=498, Unknown=2, NotChecked=46, Total=650 [2018-01-20 22:31:35,182 INFO L87 Difference]: Start difference. First operand 238 states and 262 transitions. Second operand 26 states. [2018-01-20 22:31:36,605 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 74 DAG size of output 72 [2018-01-20 22:31:36,869 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 64 DAG size of output 64 [2018-01-20 22:31:37,031 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 63 DAG size of output 61 [2018-01-20 22:31:38,489 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 79 DAG size of output 72 [2018-01-20 22:31:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:40,548 INFO L93 Difference]: Finished difference Result 1159 states and 1275 transitions. [2018-01-20 22:31:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-20 22:31:40,549 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95 [2018-01-20 22:31:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:40,553 INFO L225 Difference]: With dead ends: 1159 [2018-01-20 22:31:40,553 INFO L226 Difference]: Without dead ends: 1152 [2018-01-20 22:31:40,554 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=541, Invalid=2519, Unknown=24, NotChecked=108, Total=3192 [2018-01-20 22:31:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2018-01-20 22:31:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 397. [2018-01-20 22:31:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-01-20 22:31:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 447 transitions. [2018-01-20 22:31:40,587 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 447 transitions. Word has length 95 [2018-01-20 22:31:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:40,587 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 447 transitions. [2018-01-20 22:31:40,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-20 22:31:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 447 transitions. [2018-01-20 22:31:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-20 22:31:40,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:40,588 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:40,588 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash -390068147, now seen corresponding path program 3 times [2018-01-20 22:31:40,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:40,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:40,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:40,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:40,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:40,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-20 22:31:40,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:40,992 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:31:41,001 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:31:41,020 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:31:41,070 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:31:41,072 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:41,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:41,090 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:31:41,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:31:41,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:41,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:41,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:31:41,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-20 22:31:41,185 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:31:41,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:31:41,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,218 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:31:41,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-01-20 22:31:41,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:41,318 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 35 treesize of output 36 [2018-01-20 22:31:41,320 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:31:41,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2018-01-20 22:31:41,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-01-20 22:31:41,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:41,437 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 30 treesize of output 18 [2018-01-20 22:31:41,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,451 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:31:41,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:31 [2018-01-20 22:31:41,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-01-20 22:31:41,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, 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:31:41,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,551 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:31:41,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:41,556 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:31:41,556 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2018-01-20 22:31:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-20 22:31:41,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:41,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-01-20 22:31:41,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-20 22:31:41,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-20 22:31:41,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-01-20 22:31:41,614 INFO L87 Difference]: Start difference. First operand 397 states and 447 transitions. Second operand 25 states. [2018-01-20 22:31:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:43,024 INFO L93 Difference]: Finished difference Result 790 states and 878 transitions. [2018-01-20 22:31:43,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-20 22:31:43,024 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-01-20 22:31:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:43,026 INFO L225 Difference]: With dead ends: 790 [2018-01-20 22:31:43,026 INFO L226 Difference]: Without dead ends: 686 [2018-01-20 22:31:43,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=397, Invalid=1673, Unknown=0, NotChecked=0, Total=2070 [2018-01-20 22:31:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-01-20 22:31:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 406. [2018-01-20 22:31:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-01-20 22:31:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 456 transitions. [2018-01-20 22:31:43,059 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 456 transitions. Word has length 99 [2018-01-20 22:31:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:43,060 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 456 transitions. [2018-01-20 22:31:43,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-20 22:31:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 456 transitions. [2018-01-20 22:31:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-20 22:31:43,061 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:43,061 INFO L322 BasicCegarLoop]: trace histogram [3, 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, 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:31:43,061 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:43,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1613645068, now seen corresponding path program 2 times [2018-01-20 22:31:43,061 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:43,061 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:43,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:43,062 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:31:43,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:43,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:31:43,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:43,385 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:31:43,396 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:31:43,417 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:43,466 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:43,469 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:43,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:43,623 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:31:43,627 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:31:43,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:43,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:43,630 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:31:43,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-20 22:31:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:31:43,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:43,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2018-01-20 22:31:43,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-20 22:31:43,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-20 22:31:43,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-01-20 22:31:43,661 INFO L87 Difference]: Start difference. First operand 406 states and 456 transitions. Second operand 17 states. [2018-01-20 22:31:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:44,203 INFO L93 Difference]: Finished difference Result 542 states and 596 transitions. [2018-01-20 22:31:44,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-20 22:31:44,203 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 100 [2018-01-20 22:31:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:44,206 INFO L225 Difference]: With dead ends: 542 [2018-01-20 22:31:44,206 INFO L226 Difference]: Without dead ends: 521 [2018-01-20 22:31:44,206 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-01-20 22:31:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-01-20 22:31:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 430. [2018-01-20 22:31:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-01-20 22:31:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 482 transitions. [2018-01-20 22:31:44,256 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 482 transitions. Word has length 100 [2018-01-20 22:31:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:44,256 INFO L432 AbstractCegarLoop]: Abstraction has 430 states and 482 transitions. [2018-01-20 22:31:44,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-20 22:31:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 482 transitions. [2018-01-20 22:31:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-20 22:31:44,257 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:44,257 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:44,257 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:44,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1975736536, now seen corresponding path program 1 times [2018-01-20 22:31:44,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:44,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:44,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:44,258 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:31:44,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:44,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-20 22:31:45,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:45,026 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:31:45,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:45,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:45,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 69 [2018-01-20 22:31:45,356 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 58 treesize of output 42 [2018-01-20 22:31:45,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,405 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 50 [2018-01-20 22:31:45,405 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:45,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:45,469 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 57 treesize of output 54 [2018-01-20 22:31:45,472 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:31:45,472 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,511 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 38 treesize of output 35 [2018-01-20 22:31:45,520 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:31:45,521 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,525 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,528 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 38 treesize of output 35 [2018-01-20 22:31:45,531 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:31:45,531 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,537 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 50 [2018-01-20 22:31:45,572 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 39 treesize of output 23 [2018-01-20 22:31:45,572 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,598 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 31 [2018-01-20 22:31:45,599 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:45,615 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:45,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:31:45,634 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:115, output treesize:58 [2018-01-20 22:31:45,694 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 41 treesize of output 38 [2018-01-20 22:31:45,697 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:31:45,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 49 [2018-01-20 22:31:45,795 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 38 treesize of output 37 [2018-01-20 22:31:45,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,827 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2018-01-20 22:31:45,828 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:45,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:45,909 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 40 treesize of output 37 [2018-01-20 22:31:45,913 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:31:45,914 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,928 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 53 [2018-01-20 22:31:45,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 42 treesize of output 41 [2018-01-20 22:31:45,992 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,025 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2018-01-20 22:31:46,026 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:46,047 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:46,101 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 37 treesize of output 34 [2018-01-20 22:31:46,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 8 treesize of output 7 [2018-01-20 22:31:46,104 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,110 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,112 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 35 treesize of output 32 [2018-01-20 22:31:46,114 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:31:46,115 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,122 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,171 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 36 treesize of output 33 [2018-01-20 22:31:46,173 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:31:46,173 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,179 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-20 22:31:46,221 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:123, output treesize:127 [2018-01-20 22:31:46,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-01-20 22:31:46,311 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:31:46,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2018-01-20 22:31:46,358 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 43 treesize of output 41 [2018-01-20 22:31:46,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:46,388 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 43 treesize of output 38 [2018-01-20 22:31:46,389 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-20 22:31:46,416 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2018-01-20 22:31:46,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-01-20 22:31:46,462 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,494 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 45 treesize of output 38 [2018-01-20 22:31:46,494 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-20 22:31:46,519 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,540 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:46,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-20 22:31:46,575 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:137, output treesize:131 [2018-01-20 22:31:46,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,716 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 19 treesize of output 20 [2018-01-20 22:31:46,718 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 12 [2018-01-20 22:31:46,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-01-20 22:31:46,811 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 15 treesize of output 11 [2018-01-20 22:31:46,816 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 11 treesize of output 8 [2018-01-20 22:31:46,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:46,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:46,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:46,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-20 22:31:46,879 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 6 treesize of output 5 [2018-01-20 22:31:46,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-20 22:31:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-20 22:31:46,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:46,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 41 [2018-01-20 22:31:46,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-20 22:31:46,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-20 22:31:46,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1501, Unknown=0, NotChecked=0, Total=1640 [2018-01-20 22:31:46,998 INFO L87 Difference]: Start difference. First operand 430 states and 482 transitions. Second operand 41 states. [2018-01-20 22:31:48,565 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 108 DAG size of output 59 [2018-01-20 22:31:49,453 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 92 DAG size of output 78 [2018-01-20 22:31:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:50,108 INFO L93 Difference]: Finished difference Result 801 states and 891 transitions. [2018-01-20 22:31:50,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-20 22:31:50,109 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 102 [2018-01-20 22:31:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:50,111 INFO L225 Difference]: With dead ends: 801 [2018-01-20 22:31:50,111 INFO L226 Difference]: Without dead ends: 704 [2018-01-20 22:31:50,113 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=951, Invalid=5691, Unknown=0, NotChecked=0, Total=6642 [2018-01-20 22:31:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-01-20 22:31:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 437. [2018-01-20 22:31:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-01-20 22:31:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 489 transitions. [2018-01-20 22:31:50,145 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 489 transitions. Word has length 102 [2018-01-20 22:31:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:50,145 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 489 transitions. [2018-01-20 22:31:50,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-20 22:31:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 489 transitions. [2018-01-20 22:31:50,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-20 22:31:50,146 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:50,146 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:50,146 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:50,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1661833282, now seen corresponding path program 1 times [2018-01-20 22:31:50,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:50,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:50,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:50,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:50,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:50,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:31:50,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:50,304 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:31:50,310 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:50,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:50,416 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:31:50,420 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 11 treesize of output 8 [2018-01-20 22:31:50,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:50,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:50,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:50,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-01-20 22:31:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:31:50,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:50,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 21 [2018-01-20 22:31:50,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-20 22:31:50,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-20 22:31:50,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-01-20 22:31:50,481 INFO L87 Difference]: Start difference. First operand 437 states and 489 transitions. Second operand 21 states. [2018-01-20 22:31:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:51,025 INFO L93 Difference]: Finished difference Result 580 states and 639 transitions. [2018-01-20 22:31:51,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-20 22:31:51,025 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-01-20 22:31:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:51,027 INFO L225 Difference]: With dead ends: 580 [2018-01-20 22:31:51,027 INFO L226 Difference]: Without dead ends: 559 [2018-01-20 22:31:51,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2018-01-20 22:31:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-01-20 22:31:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 430. [2018-01-20 22:31:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-01-20 22:31:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 482 transitions. [2018-01-20 22:31:51,062 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 482 transitions. Word has length 102 [2018-01-20 22:31:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:51,062 INFO L432 AbstractCegarLoop]: Abstraction has 430 states and 482 transitions. [2018-01-20 22:31:51,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-20 22:31:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 482 transitions. [2018-01-20 22:31:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-20 22:31:51,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:51,063 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:51,063 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:51,064 INFO L82 PathProgramCache]: Analyzing trace with hash -471619372, now seen corresponding path program 1 times [2018-01-20 22:31:51,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:51,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:51,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:51,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:51,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:51,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:31:51,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:51,737 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:31:51,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:51,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:51,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2018-01-20 22:31:51,942 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 53 treesize of output 52 [2018-01-20 22:31:51,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:51,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 58 [2018-01-20 22:31:52,026 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 49 treesize of output 48 [2018-01-20 22:31:52,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2018-01-20 22:31:52,111 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 53 treesize of output 52 [2018-01-20 22:31:52,112 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 58 [2018-01-20 22:31:52,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2018-01-20 22:31:52,191 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-01-20 22:31:52,217 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,231 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:52,251 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:105, output treesize:89 [2018-01-20 22:31:52,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 70 [2018-01-20 22:31:52,332 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 59 treesize of output 49 [2018-01-20 22:31:52,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 59 [2018-01-20 22:31:52,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:52,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 68 [2018-01-20 22:31:52,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-01-20 22:31:52,449 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 58 [2018-01-20 22:31:52,498 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:52,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 65 [2018-01-20 22:31:52,573 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 50 treesize of output 42 [2018-01-20 22:31:52,573 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 47 [2018-01-20 22:31:52,614 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:52,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:52,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 67 [2018-01-20 22:31:52,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-01-20 22:31:52,683 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-01-20 22:31:52,730 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:52,746 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:31:52,771 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:121, output treesize:71 [2018-01-20 22:31:52,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2018-01-20 22:31:52,946 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-01-20 22:31:52,947 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:31:52,963 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 47 treesize of output 40 [2018-01-20 22:31:52,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:52,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-01-20 22:31:52,979 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:31:52,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:31:53,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 45 [2018-01-20 22:31:53,019 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 41 treesize of output 30 [2018-01-20 22:31:53,019 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:53,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-20 22:31:53,031 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:53,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:53,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-20 22:31:53,044 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:53,055 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:31:53,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-01-20 22:31:53,079 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:103, output treesize:149 [2018-01-20 22:31:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:31:53,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:53,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2018-01-20 22:31:53,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-20 22:31:53,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-20 22:31:53,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2018-01-20 22:31:53,295 INFO L87 Difference]: Start difference. First operand 430 states and 482 transitions. Second operand 37 states. [2018-01-20 22:31:54,352 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 98 DAG size of output 66 [2018-01-20 22:31:54,674 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 101 DAG size of output 69 [2018-01-20 22:31:54,911 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 130 DAG size of output 76 [2018-01-20 22:31:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:56,995 INFO L93 Difference]: Finished difference Result 1057 states and 1173 transitions. [2018-01-20 22:31:56,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-20 22:31:56,996 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 105 [2018-01-20 22:31:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:56,997 INFO L225 Difference]: With dead ends: 1057 [2018-01-20 22:31:56,997 INFO L226 Difference]: Without dead ends: 669 [2018-01-20 22:31:57,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=969, Invalid=5037, Unknown=0, NotChecked=0, Total=6006 [2018-01-20 22:31:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-01-20 22:31:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 534. [2018-01-20 22:31:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-01-20 22:31:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 589 transitions. [2018-01-20 22:31:57,079 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 589 transitions. Word has length 105 [2018-01-20 22:31:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:57,080 INFO L432 AbstractCegarLoop]: Abstraction has 534 states and 589 transitions. [2018-01-20 22:31:57,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-20 22:31:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 589 transitions. [2018-01-20 22:31:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-20 22:31:57,081 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:57,082 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:57,082 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash 531869476, now seen corresponding path program 4 times [2018-01-20 22:31:57,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:57,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:57,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:57,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:57,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:57,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-20 22:31:57,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:57,829 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:31:57,836 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:31:57,866 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:57,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:57,873 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:31:57,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:57,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:57,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:31:57,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:57,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:57,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:31:57,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:57,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:57,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-20 22:31:57,956 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:31:57,957 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:31:57,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:57,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:57,966 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:31:57,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-20 22:31:58,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:58,044 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:31:58,046 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:31:58,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2018-01-20 22:31:58,162 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 51 treesize of output 50 [2018-01-20 22:31:58,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:58,165 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 22 treesize of output 14 [2018-01-20 22:31:58,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:41 [2018-01-20 22:31:58,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:58,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:58,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:58,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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:31:58,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2018-01-20 22:31:58,229 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 42 treesize of output 41 [2018-01-20 22:31:58,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-01-20 22:31:58,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,244 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:31:58,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-01-20 22:31:58,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:58,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:58,368 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 67 treesize of output 71 [2018-01-20 22:31:58,369 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:31:58,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,384 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:31:58,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:55 [2018-01-20 22:31:58,435 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-01-20 22:31:58,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:58,442 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 38 treesize of output 22 [2018-01-20 22:31:58,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,456 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:31:58,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2018-01-20 22:31:58,556 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 67 treesize of output 42 [2018-01-20 22:31:58,558 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:31:58,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,563 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:31:58,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,567 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:31:58,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:58,572 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:31:58,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2018-01-20 22:31:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-20 22:31:58,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:58,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 48 [2018-01-20 22:31:58,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-20 22:31:58,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-20 22:31:58,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2093, Unknown=0, NotChecked=0, Total=2256 [2018-01-20 22:31:58,659 INFO L87 Difference]: Start difference. First operand 534 states and 589 transitions. Second operand 48 states. [2018-01-20 22:32:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:02,837 INFO L93 Difference]: Finished difference Result 952 states and 1044 transitions. [2018-01-20 22:32:02,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-20 22:32:02,838 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2018-01-20 22:32:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:02,839 INFO L225 Difference]: With dead ends: 952 [2018-01-20 22:32:02,839 INFO L226 Difference]: Without dead ends: 760 [2018-01-20 22:32:02,842 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2636 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1318, Invalid=8582, Unknown=0, NotChecked=0, Total=9900 [2018-01-20 22:32:02,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-01-20 22:32:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 513. [2018-01-20 22:32:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-01-20 22:32:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 564 transitions. [2018-01-20 22:32:02,910 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 564 transitions. Word has length 111 [2018-01-20 22:32:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:02,910 INFO L432 AbstractCegarLoop]: Abstraction has 513 states and 564 transitions. [2018-01-20 22:32:02,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-20 22:32:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 564 transitions. [2018-01-20 22:32:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-20 22:32:02,912 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:02,912 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,912 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:32:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1917037198, now seen corresponding path program 1 times [2018-01-20 22:32:02,912 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:02,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:02,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:02,913 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:32:02,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:02,931 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:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-20 22:32:02,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:02,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:32:02,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:32:02,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:32:02,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:32:02,990 INFO L87 Difference]: Start difference. First operand 513 states and 564 transitions. Second operand 4 states. [2018-01-20 22:32:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:03,161 INFO L93 Difference]: Finished difference Result 628 states and 692 transitions. [2018-01-20 22:32:03,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:32:03,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-01-20 22:32:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:03,162 INFO L225 Difference]: With dead ends: 628 [2018-01-20 22:32:03,162 INFO L226 Difference]: Without dead ends: 560 [2018-01-20 22:32:03,163 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:32:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-01-20 22:32:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 527. [2018-01-20 22:32:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-01-20 22:32:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 582 transitions. [2018-01-20 22:32:03,205 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 582 transitions. Word has length 112 [2018-01-20 22:32:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:03,205 INFO L432 AbstractCegarLoop]: Abstraction has 527 states and 582 transitions. [2018-01-20 22:32:03,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:32:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 582 transitions. [2018-01-20 22:32:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-20 22:32:03,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:03,206 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,206 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:32:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash 373053973, now seen corresponding path program 3 times [2018-01-20 22:32:03,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:03,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:03,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:03,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:03,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:03,220 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:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-20 22:32:03,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:03,719 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:03,724 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:32:03,741 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:32:03,774 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:32:03,778 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:32:03,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:03,784 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:03,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:03,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:03,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:32:03,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:03,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:03,899 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:03,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:03,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:03,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-20 22:32:03,934 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:03,935 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:03,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:03,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:03,947 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:03,948 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:03,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:03,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:03,958 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:03,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-01-20 22:32:04,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,032 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 36 treesize of output 37 [2018-01-20 22:32:04,034 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:04,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,052 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 19 treesize of output 24 [2018-01-20 22:32:04,054 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:04,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-01-20 22:32:04,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-01-20 22:32:04,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,104 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 30 treesize of output 18 [2018-01-20 22:32:04,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,127 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 50 treesize of output 45 [2018-01-20 22:32:04,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,131 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 30 treesize of output 18 [2018-01-20 22:32:04,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,143 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:04,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:55 [2018-01-20 22:32:04,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,638 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 82 treesize of output 75 [2018-01-20 22:32:04,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,680 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 74 treesize of output 75 [2018-01-20 22:32:04,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:04,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:157, output treesize:143 [2018-01-20 22:32:04,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,868 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 105 treesize of output 106 [2018-01-20 22:32:04,870 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:04,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 106 [2018-01-20 22:32:04,937 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:04,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:04,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:04,995 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 103 [2018-01-20 22:32:04,997 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:04,997 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,045 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 90 treesize of output 87 [2018-01-20 22:32:05,046 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:05,046 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,057 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:05,083 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:219, output treesize:139 [2018-01-20 22:32:05,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,159 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 96 [2018-01-20 22:32:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-20 22:32:05,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2018-01-20 22:32:05,222 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 22 treesize of output 20 [2018-01-20 22:32:05,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,274 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 78 treesize of output 83 [2018-01-20 22:32:05,276 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:05,276 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,288 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,323 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 78 treesize of output 87 [2018-01-20 22:32:05,325 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:05,325 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,337 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:05,363 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:181, output treesize:145 [2018-01-20 22:32:05,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,439 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 102 treesize of output 91 [2018-01-20 22:32:05,440 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 35 treesize of output 27 [2018-01-20 22:32:05,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:05,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-01-20 22:32:05,455 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,467 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:05,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:32:05,510 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 57 treesize of output 45 [2018-01-20 22:32:05,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-20 22:32:05,513 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,520 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 12 treesize of output 4 [2018-01-20 22:32:05,520 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2018-01-20 22:32:05,551 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 38 treesize of output 37 [2018-01-20 22:32:05,552 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:05,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-01-20 22:32:05,570 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,580 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:05,580 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,606 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2018-01-20 22:32:05,607 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:05,608 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:32:05,614 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,617 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:05,626 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:197, output treesize:9 [2018-01-20 22:32:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-20 22:32:05,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:05,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2018-01-20 22:32:05,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-20 22:32:05,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-20 22:32:05,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1150, Unknown=1, NotChecked=0, Total=1260 [2018-01-20 22:32:05,724 INFO L87 Difference]: Start difference. First operand 527 states and 582 transitions. Second operand 36 states. [2018-01-20 22:32:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:07,875 INFO L93 Difference]: Finished difference Result 885 states and 975 transitions. [2018-01-20 22:32:07,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-20 22:32:07,875 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 113 [2018-01-20 22:32:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:07,877 INFO L225 Difference]: With dead ends: 885 [2018-01-20 22:32:07,877 INFO L226 Difference]: Without dead ends: 771 [2018-01-20 22:32:07,878 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=498, Invalid=3161, Unknown=1, NotChecked=0, Total=3660 [2018-01-20 22:32:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-01-20 22:32:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 551. [2018-01-20 22:32:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-01-20 22:32:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 609 transitions. [2018-01-20 22:32:07,937 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 609 transitions. Word has length 113 [2018-01-20 22:32:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:07,938 INFO L432 AbstractCegarLoop]: Abstraction has 551 states and 609 transitions. [2018-01-20 22:32:07,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-20 22:32:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 609 transitions. [2018-01-20 22:32:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-20 22:32:07,939 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:07,939 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,939 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:32:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1960338665, now seen corresponding path program 1 times [2018-01-20 22:32:07,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:07,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:07,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:07,940 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:32:07,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:07,958 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:08,628 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-01-20 22:32:08,783 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 52 DAG size of output 52 [2018-01-20 22:32:09,011 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 62 DAG size of output 62 [2018-01-20 22:32:09,280 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 59 DAG size of output 58 [2018-01-20 22:32:09,491 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 57 DAG size of output 57 [2018-01-20 22:32:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-20 22:32:10,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:10,874 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:10,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:10,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:10,913 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:10,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:10,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:10,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:32:11,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:11,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:11,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:32:11,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-20 22:32:11,255 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:11,256 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:11,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,266 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:11,268 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:11,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,275 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:11,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-01-20 22:32:11,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:11,573 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 27 treesize of output 28 [2018-01-20 22:32:11,574 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:11,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,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:11,589 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 19 treesize of output 24 [2018-01-20 22:32:11,590 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:11,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-01-20 22:32:11,710 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 50 treesize of output 45 [2018-01-20 22:32:11,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:11,720 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 30 treesize of output 18 [2018-01-20 22:32:11,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-01-20 22:32:11,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:11,747 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 30 treesize of output 18 [2018-01-20 22:32:11,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,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:11,780 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:11,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:41 [2018-01-20 22:32:11,928 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:11,930 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:11,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,934 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:11,935 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:11,941 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:11,941 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-01-20 22:32:12,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 67 [2018-01-20 22:32:12,235 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 47 treesize of output 31 [2018-01-20 22:32:12,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:12,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 28 [2018-01-20 22:32:12,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:12,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:12,324 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 2 xjuncts. [2018-01-20 22:32:12,324 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:65 [2018-01-20 22:32:12,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:12,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 73 [2018-01-20 22:32:12,434 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 53 treesize of output 52 [2018-01-20 22:32:12,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:12,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-01-20 22:32:12,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:12,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:12,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:12,619 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 36 treesize of output 42 [2018-01-20 22:32:12,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-20 22:32:12,620 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:12,628 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:12,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:32:12,653 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:81, output treesize:97 [2018-01-20 22:32:12,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:12,782 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 41 [2018-01-20 22:32:12,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2018-01-20 22:32:12,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:12,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:12,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:12,843 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 4 case distinctions, treesize of input 53 treesize of output 65 [2018-01-20 22:32:12,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 69 [2018-01-20 22:32:12,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:12,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 49 [2018-01-20 22:32:12,893 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:12,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-20 22:32:12,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-01-20 22:32:12,969 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:91, output treesize:206 [2018-01-20 22:32:13,946 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2018-01-20 22:32:13,951 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:13,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:32:13,956 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:13,956 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,957 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 17 treesize of output 13 [2018-01-20 22:32:13,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:13,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:13,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,974 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,974 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,975 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:13,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2018-01-20 22:32:13,998 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 75 [2018-01-20 22:32:13,998 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-20 22:32:14,024 INFO L267 ElimStorePlain]: Start of recursive call 7: 94 dim-0 vars, End of recursive call: 94 dim-0 vars, and 54 xjuncts. [2018-01-20 22:32:14,201 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:14,201 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,209 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 27 treesize of output 21 [2018-01-20 22:32:14,209 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,210 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 17 treesize of output 13 [2018-01-20 22:32:14,210 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:14,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:14,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:32:14,226 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:130, output treesize:9 [2018-01-20 22:32:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-20 22:32:14,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:14,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 54 [2018-01-20 22:32:14,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-20 22:32:14,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-20 22:32:14,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2651, Unknown=0, NotChecked=0, Total=2862 [2018-01-20 22:32:14,482 INFO L87 Difference]: Start difference. First operand 551 states and 609 transitions. Second operand 54 states. [2018-01-20 22:32:15,497 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 127 DAG size of output 80 Received shutdown request... [2018-01-20 22:32:15,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 22:32:15,762 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:32:15,765 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:32:15,765 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:32:15,765 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:32:15,765 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:32:15,765 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:32:15,766 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:32:15,766 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:32:15,766 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:32:15,766 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:32:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-01-20 22:32:15,768 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:32:15,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:32:15 BoogieIcfgContainer [2018-01-20 22:32:15,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:32:15,770 INFO L168 Benchmark]: Toolchain (without parser) took 47847.31 ms. Allocated memory was 303.6 MB in the beginning and 848.8 MB in the end (delta: 545.3 MB). Free memory was 263.5 MB in the beginning and 400.3 MB in the end (delta: -136.8 MB). Peak memory consumption was 408.5 MB. Max. memory is 5.3 GB. [2018-01-20 22:32:15,771 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 303.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:32:15,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.80 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 250.4 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:32:15,772 INFO L168 Benchmark]: Boogie Preprocessor took 40.60 ms. Allocated memory is still 303.6 MB. Free memory was 250.4 MB in the beginning and 248.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:32:15,772 INFO L168 Benchmark]: RCFGBuilder took 476.93 ms. Allocated memory is still 303.6 MB. Free memory was 248.4 MB in the beginning and 217.2 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 5.3 GB. [2018-01-20 22:32:15,773 INFO L168 Benchmark]: TraceAbstraction took 47105.48 ms. Allocated memory was 303.6 MB in the beginning and 848.8 MB in the end (delta: 545.3 MB). Free memory was 217.2 MB in the beginning and 400.3 MB in the end (delta: -183.1 MB). Peak memory consumption was 362.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:32:15,774 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.22 ms. Allocated memory is still 303.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.80 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 250.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.60 ms. Allocated memory is still 303.6 MB. Free memory was 250.4 MB in the beginning and 248.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 476.93 ms. Allocated memory is still 303.6 MB. Free memory was 248.4 MB in the beginning and 217.2 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 47105.48 ms. Allocated memory was 303.6 MB in the beginning and 848.8 MB in the end (delta: 545.3 MB). Free memory was 217.2 MB in the beginning and 400.3 MB in the end (delta: -183.1 MB). Peak memory consumption was 362.1 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) * 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, 109 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=109occurred 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 - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1). Cancelled while BasicCegarLoop was constructing difference of abstraction (551states) and interpolant automaton (currently 8 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 140. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 109 locations, 3 error locations. TIMEOUT Result, 46.9s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1820 SDtfs, 13749 SDslu, 15794 SDs, 0 SdLazy, 12440 SolverSat, 1600 SolverUnsat, 210 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1741 GetRequests, 1106 SyntacticMatches, 27 SemanticMatches, 607 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8471 ImplicationChecksByTransitivity, 26.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=18, 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.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 2578 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 2902 NumberOfCodeBlocks, 2861 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2871 ConstructedInterpolants, 230 QuantifiedInterpolants, 6371062 SizeOfPredicates, 182 NumberOfNonLiveVariables, 3135 ConjunctsInSsa, 468 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 426/637 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while IsEmpty was searching accepting run (input had 109 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 109 locations, 3 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred 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: 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-sorted_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-32-15-780.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-sorted_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-32-15-780.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-sorted_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-32-15-780.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-sorted_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-32-15-780.csv Completed graceful shutdown