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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:10:01,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:10:01,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:10:01,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:10:01,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:10:01,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:10:01,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:10:01,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:10:01,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:10:01,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:10:01,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:10:01,405 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:10:01,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:10:01,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:10:01,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:10:01,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:10:01,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:10:01,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:10:01,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:10:01,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:10:01,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:10:01,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:10:01,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:10:01,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:10:01,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:10:01,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:10:01,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:10:01,424 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:10:01,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:10:01,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:10:01,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:10:01,426 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:10:01,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:10:01,434 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:10:01,435 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:10:01,435 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:10:01,435 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:10:01,435 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:10:01,435 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:10:01,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:10:01,436 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:10:01,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:10:01,436 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:10:01,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:10:01,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:10:01,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:10:01,437 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:10:01,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:10:01,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:10:01,437 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:10:01,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:10:01,438 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:10:01,438 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:10:01,438 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:10:01,438 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:10:01,438 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:10:01,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:10:01,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:10:01,439 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:10:01,439 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:10:01,439 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:10:01,439 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:10:01,439 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:10:01,440 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:10:01,440 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:10:01,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:10:01,440 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:10:01,441 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:10:01,441 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:10:01,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:10:01,483 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:10:01,486 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:10:01,487 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:10:01,488 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:10:01,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-20 22:10:01,737 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:10:01,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:10:01,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:10:01,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:10:01,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:10:01,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:10:01" (1/1) ... [2018-01-20 22:10:01,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee1e0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01, skipping insertion in model container [2018-01-20 22:10:01,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:10:01" (1/1) ... [2018-01-20 22:10:01,763 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:10:01,801 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:10:01,915 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:10:01,934 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:10:01,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01 WrapperNode [2018-01-20 22:10:01,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:10:01,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:10:01,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:10:01,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:10:01,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01" (1/1) ... [2018-01-20 22:10:01,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01" (1/1) ... [2018-01-20 22:10:01,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01" (1/1) ... [2018-01-20 22:10:01,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01" (1/1) ... [2018-01-20 22:10:01,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01" (1/1) ... [2018-01-20 22:10:01,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01" (1/1) ... [2018-01-20 22:10:01,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01" (1/1) ... [2018-01-20 22:10:01,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:10:01,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:10:01,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:10:01,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:10:01,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01" (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:10:02,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:10:02,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:10:02,051 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:10:02,051 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:10:02,052 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:10:02,052 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:10:02,052 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:10:02,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:10:02,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:10:02,052 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:10:02,053 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:10:02,053 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:10:02,053 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-20 22:10:02,053 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:10:02,053 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:10:02,053 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:10:02,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:10:02,352 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:10:02,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:10:02 BoogieIcfgContainer [2018-01-20 22:10:02,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:10:02,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:10:02,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:10:02,356 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:10:02,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:10:01" (1/3) ... [2018-01-20 22:10:02,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50db035c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:10:02, skipping insertion in model container [2018-01-20 22:10:02,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:10:01" (2/3) ... [2018-01-20 22:10:02,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50db035c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:10:02, skipping insertion in model container [2018-01-20 22:10:02,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:10:02" (3/3) ... [2018-01-20 22:10:02,361 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-20 22:10:02,368 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:10:02,375 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:10:02,412 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:10:02,413 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:10:02,413 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:10:02,413 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:10:02,413 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:10:02,413 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:10:02,413 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:10:02,413 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:10:02,414 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:10:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-20 22:10:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:10:02,435 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:02,436 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:10:02,436 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:10:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash 161638, now seen corresponding path program 1 times [2018-01-20 22:10:02,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:02,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:02,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:02,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:10:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:10:02,535 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:10:02,541 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:10:02,547 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:10:02,548 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:10:02,548 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:10:02,548 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:10:02,548 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:10:02,548 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:10:02,548 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:10:02,549 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:10:02,549 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:10:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-20 22:10:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-20 22:10:02,554 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:02,554 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:02,554 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:10:02,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1534673087, now seen corresponding path program 1 times [2018-01-20 22:10:02,554 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:02,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:02,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:02,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:02,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:02,601 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:10:02,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:10:02,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:10:02,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:10:02,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:10:02,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:10:02,617 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-20 22:10:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:02,727 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2018-01-20 22:10:02,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:10:02,729 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-20 22:10:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:02,740 INFO L225 Difference]: With dead ends: 119 [2018-01-20 22:10:02,741 INFO L226 Difference]: Without dead ends: 60 [2018-01-20 22:10:02,744 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:10:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-20 22:10:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-20 22:10:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-20 22:10:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-01-20 22:10:02,776 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 12 [2018-01-20 22:10:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:02,776 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-01-20 22:10:02,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:10:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-01-20 22:10:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-20 22:10:02,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:02,777 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:02,777 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:10:02,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1359962435, now seen corresponding path program 1 times [2018-01-20 22:10:02,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:02,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:02,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:02,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:10:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:10:02,809 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:10:02,813 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:10:02,815 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:10:02,815 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:10:02,822 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:10:02,822 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:10:02,822 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:10:02,823 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:10:02,823 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:10:02,823 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:10:02,823 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:10:02,823 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:10:02,823 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:10:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-20 22:10:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-20 22:10:02,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:02,825 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:02,825 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:02,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1736948604, now seen corresponding path program 1 times [2018-01-20 22:10:02,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:02,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:02,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:02,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:02,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:02,842 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:10:02,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:10:02,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:10:02,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:10:02,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:10:02,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:10:02,843 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-20 22:10:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:02,850 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2018-01-20 22:10:02,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:10:02,851 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-20 22:10:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:02,851 INFO L225 Difference]: With dead ends: 119 [2018-01-20 22:10:02,851 INFO L226 Difference]: Without dead ends: 58 [2018-01-20 22:10:02,852 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:10:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-20 22:10:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-20 22:10:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-20 22:10:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-01-20 22:10:02,859 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 10 [2018-01-20 22:10:02,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:02,859 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-01-20 22:10:02,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:10:02,859 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-01-20 22:10:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 22:10:02,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:02,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:02,860 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1755007480, now seen corresponding path program 1 times [2018-01-20 22:10:02,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:02,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:02,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:02,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:02,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:02,921 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:10:02,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:10:02,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:10:02,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:10:02,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:10:02,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:10:02,922 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 3 states. [2018-01-20 22:10:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:02,964 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-01-20 22:10:02,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:10:02,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-20 22:10:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:02,967 INFO L225 Difference]: With dead ends: 80 [2018-01-20 22:10:02,967 INFO L226 Difference]: Without dead ends: 77 [2018-01-20 22:10:02,968 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:10:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-20 22:10:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2018-01-20 22:10:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-20 22:10:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-01-20 22:10:02,975 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 14 [2018-01-20 22:10:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:02,975 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-01-20 22:10:02,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:10:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-01-20 22:10:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 22:10:02,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:02,976 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:02,976 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash -108495441, now seen corresponding path program 1 times [2018-01-20 22:10:02,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:02,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:02,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:02,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:02,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:03,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:10:03,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:10:03,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:10:03,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:10:03,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:10:03,025 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 3 states. [2018-01-20 22:10:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:03,041 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-01-20 22:10:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:10:03,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-20 22:10:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:03,042 INFO L225 Difference]: With dead ends: 81 [2018-01-20 22:10:03,042 INFO L226 Difference]: Without dead ends: 62 [2018-01-20 22:10:03,043 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:10:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-20 22:10:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-20 22:10:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-20 22:10:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-01-20 22:10:03,047 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 23 [2018-01-20 22:10:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:03,047 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-01-20 22:10:03,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:10:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-01-20 22:10:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 22:10:03,048 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:03,048 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:03,048 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1477939535, now seen corresponding path program 1 times [2018-01-20 22:10:03,049 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:03,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:03,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:03,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:03,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:03,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:10:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:03,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:03,139 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:10:03,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:03,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:03,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:10:03,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 22:10:03,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:10:03,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:10:03,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:10:03,243 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 5 states. [2018-01-20 22:10:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:03,276 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-01-20 22:10:03,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:10:03,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-20 22:10:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:03,278 INFO L225 Difference]: With dead ends: 67 [2018-01-20 22:10:03,278 INFO L226 Difference]: Without dead ends: 64 [2018-01-20 22:10:03,278 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:10:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-20 22:10:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-20 22:10:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-20 22:10:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-01-20 22:10:03,285 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 33 [2018-01-20 22:10:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:03,286 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-01-20 22:10:03,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:10:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-01-20 22:10:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 22:10:03,287 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:03,288 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] [2018-01-20 22:10:03,288 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:03,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1966760520, now seen corresponding path program 1 times [2018-01-20 22:10:03,288 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:03,288 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:03,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:03,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:03,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:03,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:03,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:03,541 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:10:03,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:03,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:03,825 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int)) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~x~10.base 0)) (not (= main_~x~10.base 0)))) is different from true [2018-01-20 22:10:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-20 22:10:03,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:10:03,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-20 22:10:03,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-20 22:10:03,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-20 22:10:03,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=109, Unknown=1, NotChecked=20, Total=156 [2018-01-20 22:10:03,867 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 13 states. [2018-01-20 22:10:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:04,477 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-01-20 22:10:04,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 22:10:04,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-01-20 22:10:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:04,479 INFO L225 Difference]: With dead ends: 138 [2018-01-20 22:10:04,479 INFO L226 Difference]: Without dead ends: 135 [2018-01-20 22:10:04,480 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=258, Unknown=1, NotChecked=34, Total=380 [2018-01-20 22:10:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-20 22:10:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2018-01-20 22:10:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-20 22:10:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2018-01-20 22:10:04,491 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 42 [2018-01-20 22:10:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:04,491 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2018-01-20 22:10:04,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-20 22:10:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2018-01-20 22:10:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-20 22:10:04,493 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:04,493 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] [2018-01-20 22:10:04,494 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1934136735, now seen corresponding path program 1 times [2018-01-20 22:10:04,495 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:04,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:04,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:04,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:04,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:04,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:10:04,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:10:04,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:10:04,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:10:04,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:10:04,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:10:04,545 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand 3 states. [2018-01-20 22:10:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:04,556 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2018-01-20 22:10:04,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:10:04,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-01-20 22:10:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:04,558 INFO L225 Difference]: With dead ends: 169 [2018-01-20 22:10:04,559 INFO L226 Difference]: Without dead ends: 115 [2018-01-20 22:10:04,559 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:10:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-20 22:10:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-20 22:10:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-20 22:10:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-01-20 22:10:04,571 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 45 [2018-01-20 22:10:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:04,572 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-01-20 22:10:04,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:10:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-01-20 22:10:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-20 22:10:04,575 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:04,575 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] [2018-01-20 22:10:04,575 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:04,575 INFO L82 PathProgramCache]: Analyzing trace with hash -671094140, now seen corresponding path program 1 times [2018-01-20 22:10:04,575 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:04,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:04,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:04,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:04,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:04,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:04,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:10:04,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 22:10:04,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:10:04,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:10:04,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:10:04,848 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 7 states. [2018-01-20 22:10:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:05,097 INFO L93 Difference]: Finished difference Result 205 states and 234 transitions. [2018-01-20 22:10:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-20 22:10:05,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-01-20 22:10:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:05,098 INFO L225 Difference]: With dead ends: 205 [2018-01-20 22:10:05,098 INFO L226 Difference]: Without dead ends: 179 [2018-01-20 22:10:05,099 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-20 22:10:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-20 22:10:05,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 129. [2018-01-20 22:10:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-20 22:10:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-01-20 22:10:05,112 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 49 [2018-01-20 22:10:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:05,113 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-01-20 22:10:05,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:10:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-01-20 22:10:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-20 22:10:05,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:05,122 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] [2018-01-20 22:10:05,122 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:05,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1169201519, now seen corresponding path program 2 times [2018-01-20 22:10:05,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:05,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:05,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:05,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:05,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:05,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:05,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:05,202 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:10:05,212 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:10:05,228 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:05,251 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:05,254 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:10:05,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:05,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:10:05,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-01-20 22:10:05,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:10:05,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:10:05,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:10:05,302 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 5 states. [2018-01-20 22:10:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:05,394 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2018-01-20 22:10:05,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:10:05,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-20 22:10:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:05,395 INFO L225 Difference]: With dead ends: 171 [2018-01-20 22:10:05,395 INFO L226 Difference]: Without dead ends: 143 [2018-01-20 22:10:05,396 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:10:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-20 22:10:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-20 22:10:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-20 22:10:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2018-01-20 22:10:05,407 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 51 [2018-01-20 22:10:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:05,408 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2018-01-20 22:10:05,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:10:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2018-01-20 22:10:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-20 22:10:05,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:05,409 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-20 22:10:05,409 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1564018141, now seen corresponding path program 1 times [2018-01-20 22:10:05,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:05,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:05,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:05,411 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:10:05,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:05,424 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-20 22:10:05,425 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-20 22:10:05,425 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-20 22:10:05,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:05,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:05,503 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:10:05,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:10:05,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:05,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:10:05,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-20 22:10:05,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:10:05,600 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:10:05,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:05,607 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:10:05,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-20 22:10:05,665 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:10:05,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-01-20 22:10:05,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:05,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:05,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:05,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-01-20 22:10:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:05,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:10:05,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-01-20 22:10:05,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 22:10:05,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 22:10:05,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-20 22:10:05,763 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand 12 states. [2018-01-20 22:10:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:06,283 INFO L93 Difference]: Finished difference Result 307 states and 351 transitions. [2018-01-20 22:10:06,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-20 22:10:06,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-01-20 22:10:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:06,285 INFO L225 Difference]: With dead ends: 307 [2018-01-20 22:10:06,285 INFO L226 Difference]: Without dead ends: 286 [2018-01-20 22:10:06,286 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2018-01-20 22:10:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-20 22:10:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 154. [2018-01-20 22:10:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-20 22:10:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2018-01-20 22:10:06,299 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 59 [2018-01-20 22:10:06,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:06,299 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2018-01-20 22:10:06,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 22:10:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2018-01-20 22:10:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-20 22:10:06,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:06,300 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-01-20 22:10:06,300 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash -460382961, now seen corresponding path program 3 times [2018-01-20 22:10:06,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:06,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:06,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:06,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:06,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:06,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:10:06,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:06,392 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:10:06,398 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:10:06,409 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:10:06,416 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:10:06,436 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:10:06,439 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:10:06,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:06,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:10:06,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-01-20 22:10:06,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 22:10:06,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 22:10:06,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-20 22:10:06,509 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 8 states. [2018-01-20 22:10:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:06,641 INFO L93 Difference]: Finished difference Result 228 states and 265 transitions. [2018-01-20 22:10:06,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 22:10:06,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-20 22:10:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:06,643 INFO L225 Difference]: With dead ends: 228 [2018-01-20 22:10:06,643 INFO L226 Difference]: Without dead ends: 144 [2018-01-20 22:10:06,643 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:10:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-20 22:10:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2018-01-20 22:10:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-20 22:10:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-01-20 22:10:06,656 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 61 [2018-01-20 22:10:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:06,656 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-01-20 22:10:06,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 22:10:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-01-20 22:10:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-20 22:10:06,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:06,657 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] [2018-01-20 22:10:06,658 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash 921910806, now seen corresponding path program 1 times [2018-01-20 22:10:06,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:06,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:06,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:06,659 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:10:06,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:06,671 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-20 22:10:06,671 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-20 22:10:06,671 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-20 22:10:06,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:06,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:06,794 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 15 treesize of output 12 [2018-01-20 22:10:06,796 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:10:06,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,844 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:10:06,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-20 22:10:06,908 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 25 treesize of output 37 [2018-01-20 22:10:06,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 26 treesize of output 14 [2018-01-20 22:10:06,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,949 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:10:06,951 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:10:06,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,963 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:10:06,965 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:10:06,966 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,967 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:06,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:10:06,976 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:53, output treesize:27 [2018-01-20 22:10:07,063 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 21 treesize of output 17 [2018-01-20 22:10:07,083 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-01-20 22:10:07,085 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:10:07,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:07,125 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:10:07,133 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:10:07,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:07,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:07,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-01-20 22:10:07,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:95 [2018-01-20 22:10:07,320 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 32 treesize of output 36 [2018-01-20 22:10:07,387 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 32 treesize of output 30 [2018-01-20 22:10:07,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:07,502 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 25 treesize of output 21 [2018-01-20 22:10:07,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:07,556 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 28 treesize of output 32 [2018-01-20 22:10:07,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:07,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:07,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 26 treesize of output 22 [2018-01-20 22:10:07,625 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 13 treesize of output 9 [2018-01-20 22:10:07,625 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:07,630 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:07,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-20 22:10:07,662 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:59, output treesize:39 [2018-01-20 22:10:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:07,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:10:07,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-01-20 22:10:07,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-20 22:10:07,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-20 22:10:07,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-20 22:10:07,837 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 18 states. [2018-01-20 22:10:11,857 WARN L146 SmtUtils]: Spent 3456ms on a formula simplification. DAG size of input: 60 DAG size of output 46 [2018-01-20 22:10:12,077 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 70 DAG size of output 69 [2018-01-20 22:10:12,770 WARN L146 SmtUtils]: Spent 667ms on a formula simplification. DAG size of input: 60 DAG size of output 46 [2018-01-20 22:10:15,551 WARN L146 SmtUtils]: Spent 2758ms on a formula simplification. DAG size of input: 65 DAG size of output 51 [2018-01-20 22:10:22,088 WARN L146 SmtUtils]: Spent 2491ms on a formula simplification. DAG size of input: 60 DAG size of output 36 [2018-01-20 22:10:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:22,249 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2018-01-20 22:10:22,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-20 22:10:22,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-01-20 22:10:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:22,250 INFO L225 Difference]: With dead ends: 213 [2018-01-20 22:10:22,251 INFO L226 Difference]: Without dead ends: 200 [2018-01-20 22:10:22,251 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2018-01-20 22:10:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-20 22:10:22,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 173. [2018-01-20 22:10:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-20 22:10:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 195 transitions. [2018-01-20 22:10:22,267 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 195 transitions. Word has length 65 [2018-01-20 22:10:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:22,268 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 195 transitions. [2018-01-20 22:10:22,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-20 22:10:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 195 transitions. [2018-01-20 22:10:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-20 22:10:22,269 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:22,269 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] [2018-01-20 22:10:22,269 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1141691977, now seen corresponding path program 1 times [2018-01-20 22:10:22,270 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:22,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:22,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:22,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:22,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:22,284 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-20 22:10:22,285 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-20 22:10:22,285 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-20 22:10:22,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:22,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:22,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:10:22,668 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:10:22,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:22,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:22,677 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:10:22,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:43 [2018-01-20 22:10:22,729 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 41 treesize of output 33 [2018-01-20 22:10:22,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-01-20 22:10:22,736 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:10:22,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:22,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:22,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:67 [2018-01-20 22:10:23,203 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int) (v_prenex_19 Int)) (let ((.cse0 (store |c_old(#valid)| main_~x~10.base 1))) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= 0 (select .cse0 v_prenex_19)) (not (= v_prenex_19 0)) (not (= main_~x~10.base 0)) (= (store (store .cse0 v_prenex_19 0) main_~x~10.base 0) |c_#valid|)))) is different from true [2018-01-20 22:10:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-20 22:10:23,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:10:23,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-01-20 22:10:23,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-20 22:10:23,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-20 22:10:23,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=205, Unknown=7, NotChecked=28, Total=272 [2018-01-20 22:10:23,253 INFO L87 Difference]: Start difference. First operand 173 states and 195 transitions. Second operand 17 states. [2018-01-20 22:10:24,304 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 81 DAG size of output 53 [2018-01-20 22:10:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:24,558 INFO L93 Difference]: Finished difference Result 190 states and 213 transitions. [2018-01-20 22:10:24,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-20 22:10:24,558 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-01-20 22:10:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:24,559 INFO L225 Difference]: With dead ends: 190 [2018-01-20 22:10:24,559 INFO L226 Difference]: Without dead ends: 184 [2018-01-20 22:10:24,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=124, Invalid=736, Unknown=14, NotChecked=56, Total=930 [2018-01-20 22:10:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-20 22:10:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-01-20 22:10:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-20 22:10:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 203 transitions. [2018-01-20 22:10:24,577 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 203 transitions. Word has length 66 [2018-01-20 22:10:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:24,577 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 203 transitions. [2018-01-20 22:10:24,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-20 22:10:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2018-01-20 22:10:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-20 22:10:24,578 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:24,578 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:24,578 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120349, now seen corresponding path program 2 times [2018-01-20 22:10:24,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:24,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:24,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:24,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:24,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:24,590 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-20 22:10:24,590 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-20 22:10:24,590 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-20 22:10:24,597 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:10:24,610 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:24,624 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:24,628 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:10:24,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:24,639 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:10:24,641 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:10:24,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-20 22:10:24,652 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 21 treesize of output 16 [2018-01-20 22:10:24,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:24,654 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 16 treesize of output 23 [2018-01-20 22:10:24,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-20 22:10:24,671 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 29 [2018-01-20 22:10:24,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:24,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:24,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:24,677 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 29 treesize of output 37 [2018-01-20 22:10:24,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-01-20 22:10:24,733 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 32 treesize of output 40 [2018-01-20 22:10:24,736 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 33 treesize of output 32 [2018-01-20 22:10:24,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-20 22:10:24,788 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:24,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 52 [2018-01-20 22:10:24,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:24,815 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 4 case distinctions, treesize of input 43 treesize of output 65 [2018-01-20 22:10:24,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-20 22:10:24,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:24,885 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 3 xjuncts. [2018-01-20 22:10:24,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:116 [2018-01-20 22:10:24,933 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 60 treesize of output 58 [2018-01-20 22:10:24,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:24,951 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 55 treesize of output 66 [2018-01-20 22:10:24,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:24,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,010 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 47 treesize of output 49 [2018-01-20 22:10:25,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,013 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 44 treesize of output 53 [2018-01-20 22:10:25,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,078 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 47 treesize of output 49 [2018-01-20 22:10:25,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,081 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 44 treesize of output 53 [2018-01-20 22:10:25,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,099 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-20 22:10:25,127 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:155, output treesize:143 [2018-01-20 22:10:25,178 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 53 treesize of output 57 [2018-01-20 22:10:25,183 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 48 treesize of output 42 [2018-01-20 22:10:25,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,248 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 66 treesize of output 66 [2018-01-20 22:10:25,255 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 59 treesize of output 55 [2018-01-20 22:10:25,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,281 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:25,281 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:25,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2018-01-20 22:10:25,289 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,344 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 53 treesize of output 57 [2018-01-20 22:10:25,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,348 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:25,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-01-20 22:10:25,351 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,374 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 44 treesize of output 38 [2018-01-20 22:10:25,374 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,382 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-20 22:10:25,402 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:173, output treesize:128 [2018-01-20 22:10:25,453 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 49 [2018-01-20 22:10:25,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 59 [2018-01-20 22:10:25,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,522 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 46 [2018-01-20 22:10:25,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-01-20 22:10:25,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,538 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 0 case distinctions, treesize of input 23 treesize of output 15 [2018-01-20 22:10:25,539 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,581 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 38 [2018-01-20 22:10:25,585 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-01-20 22:10:25,585 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,604 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:185, output treesize:73 [2018-01-20 22:10:25,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2018-01-20 22:10:25,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2018-01-20 22:10:25,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-20 22:10:25,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-01-20 22:10:25,807 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-01-20 22:10:25,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,867 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 26 treesize of output 21 [2018-01-20 22:10:25,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:25,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-01-20 22:10:25,899 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:10:25,935 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:25,970 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-20 22:10:25,971 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:25,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:26,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 61 [2018-01-20 22:10:26,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2018-01-20 22:10:26,045 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:26,112 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-01-20 22:10:26,113 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:26,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 51 [2018-01-20 22:10:26,188 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 7 xjuncts. [2018-01-20 22:10:26,259 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 29 treesize of output 17 [2018-01-20 22:10:26,260 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,261 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 28 treesize of output 16 [2018-01-20 22:10:26,261 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,313 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 28 treesize of output 23 [2018-01-20 22:10:26,313 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-01-20 22:10:26,364 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,365 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-01-20 22:10:26,366 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-01-20 22:10:26,434 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,470 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 1 case distinctions, treesize of input 15 treesize of output 13 [2018-01-20 22:10:26,471 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:26,496 INFO L267 ElimStorePlain]: Start of recursive call 10: 12 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:26,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 55 [2018-01-20 22:10:26,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-20 22:10:26,539 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-01-20 22:10:26,568 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,588 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 14 treesize of output 9 [2018-01-20 22:10:26,589 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,608 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 29 treesize of output 23 [2018-01-20 22:10:26,609 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:26,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 17 [2018-01-20 22:10:26,629 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:26,640 INFO L267 ElimStorePlain]: Start of recursive call 21: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:26,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:26,654 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 4 variables, input treesize:213, output treesize:22 [2018-01-20 22:10:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:26,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:10:26,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-01-20 22:10:26,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-20 22:10:26,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-20 22:10:26,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-01-20 22:10:26,787 INFO L87 Difference]: Start difference. First operand 180 states and 203 transitions. Second operand 25 states. [2018-01-20 22:10:28,492 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 61 DAG size of output 57 [2018-01-20 22:10:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:28,577 INFO L93 Difference]: Finished difference Result 304 states and 341 transitions. [2018-01-20 22:10:28,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-20 22:10:28,578 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2018-01-20 22:10:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:28,579 INFO L225 Difference]: With dead ends: 304 [2018-01-20 22:10:28,579 INFO L226 Difference]: Without dead ends: 287 [2018-01-20 22:10:28,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=441, Invalid=2529, Unknown=0, NotChecked=0, Total=2970 [2018-01-20 22:10:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-20 22:10:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 186. [2018-01-20 22:10:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-20 22:10:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2018-01-20 22:10:28,601 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 209 transitions. Word has length 73 [2018-01-20 22:10:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:28,602 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 209 transitions. [2018-01-20 22:10:28,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-20 22:10:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 209 transitions. [2018-01-20 22:10:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-20 22:10:28,603 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:28,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:28,603 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:28,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1983315905, now seen corresponding path program 1 times [2018-01-20 22:10:28,604 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:28,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:28,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:28,605 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:10:28,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:28,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:29,370 WARN L146 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 45 DAG size of output 20 [2018-01-20 22:10:29,648 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 45 DAG size of output 23 [2018-01-20 22:10:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:29,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:29,896 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:10:29,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:29,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:30,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:30,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-01-20 22:10:30,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2018-01-20 22:10:30,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:10:30,128 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:10:30,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-01-20 22:10:30,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-01-20 22:10:30,181 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 12 treesize of output 11 [2018-01-20 22:10:30,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:60 [2018-01-20 22:10:30,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-01-20 22:10:30,262 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2018-01-20 22:10:30,263 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:10:30,275 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:10:30,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:30,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:30,299 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:69, output treesize:73 [2018-01-20 22:10:30,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:30,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:10:30,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:10:30,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-01-20 22:10:30,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:30,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:30,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:10:30,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:30,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:10:30,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-01-20 22:10:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:30,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:10:30,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2018-01-20 22:10:30,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-20 22:10:30,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-20 22:10:30,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-01-20 22:10:30,561 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. Second operand 29 states. [2018-01-20 22:10:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:32,628 INFO L93 Difference]: Finished difference Result 329 states and 373 transitions. [2018-01-20 22:10:32,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-20 22:10:32,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 73 [2018-01-20 22:10:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:32,630 INFO L225 Difference]: With dead ends: 329 [2018-01-20 22:10:32,630 INFO L226 Difference]: Without dead ends: 294 [2018-01-20 22:10:32,631 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=207, Invalid=2145, Unknown=0, NotChecked=0, Total=2352 [2018-01-20 22:10:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-20 22:10:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 246. [2018-01-20 22:10:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-01-20 22:10:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 276 transitions. [2018-01-20 22:10:32,647 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 276 transitions. Word has length 73 [2018-01-20 22:10:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:32,647 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 276 transitions. [2018-01-20 22:10:32,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-20 22:10:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 276 transitions. [2018-01-20 22:10:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-20 22:10:32,648 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:32,648 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:10:32,648 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:32,649 INFO L82 PathProgramCache]: Analyzing trace with hash -420979568, now seen corresponding path program 1 times [2018-01-20 22:10:32,649 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:32,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:32,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:32,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:32,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:32,661 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-20 22:10:32,661 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-20 22:10:32,661 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-20 22:10:32,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:32,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:32,774 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:10:32,786 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:10:32,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,824 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:10:32,831 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:10:32,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-20 22:10:32,897 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 21 treesize of output 16 [2018-01-20 22:10:32,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:32,902 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 16 treesize of output 23 [2018-01-20 22:10:32,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,923 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 21 treesize of output 16 [2018-01-20 22:10:32,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:32,927 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 16 treesize of output 23 [2018-01-20 22:10:32,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-01-20 22:10:32,957 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 29 [2018-01-20 22:10:32,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:32,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:32,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:32,963 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 29 treesize of output 37 [2018-01-20 22:10:32,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,980 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 29 [2018-01-20 22:10:32,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:32,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:32,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:32,987 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 29 treesize of output 37 [2018-01-20 22:10:32,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:32,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-01-20 22:10:33,060 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 32 treesize of output 40 [2018-01-20 22:10:33,070 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 33 treesize of output 32 [2018-01-20 22:10:33,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,119 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 32 treesize of output 40 [2018-01-20 22:10:33,123 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 33 treesize of output 32 [2018-01-20 22:10:33,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-01-20 22:10:33,214 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:33,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 66 [2018-01-20 22:10:33,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:33,241 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 0 case distinctions, treesize of input 51 treesize of output 70 [2018-01-20 22:10:33,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,280 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:33,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 87 [2018-01-20 22:10:33,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:33,310 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 4 case distinctions, treesize of input 78 treesize of output 114 [2018-01-20 22:10:33,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-20 22:10:33,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:33,430 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 3 xjuncts. [2018-01-20 22:10:33,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:246 [2018-01-20 22:10:33,506 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 125 treesize of output 135 [2018-01-20 22:10:33,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:33,519 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 144 treesize of output 209 [2018-01-20 22:10:33,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,712 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 99 treesize of output 111 [2018-01-20 22:10:33,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:33,716 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 110 treesize of output 139 [2018-01-20 22:10:33,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,856 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 99 treesize of output 97 [2018-01-20 22:10:33,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:33,859 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 92 treesize of output 105 [2018-01-20 22:10:33,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:33,895 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:33,992 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 95 treesize of output 99 [2018-01-20 22:10:33,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:33,995 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 100 treesize of output 147 [2018-01-20 22:10:33,995 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:34,019 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:34,092 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 187 treesize of output 165 [2018-01-20 22:10:34,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,095 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 182 treesize of output 289 [2018-01-20 22:10:34,096 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:34,146 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:34,239 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 119 treesize of output 109 [2018-01-20 22:10:34,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,244 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 112 treesize of output 125 [2018-01-20 22:10:34,244 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:34,288 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:34,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-20 22:10:34,352 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:324, output treesize:526 [2018-01-20 22:10:34,454 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 169 treesize of output 163 [2018-01-20 22:10:34,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,464 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 164 treesize of output 226 [2018-01-20 22:10:34,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:34,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:34,718 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 202 treesize of output 150 [2018-01-20 22:10:34,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,725 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 197 treesize of output 237 [2018-01-20 22:10:34,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:34,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:34,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 317 treesize of output 215 [2018-01-20 22:10:34,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:34,977 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 280 treesize of output 379 [2018-01-20 22:10:34,978 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:35,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,079 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:35,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 185 [2018-01-20 22:10:35,093 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:35,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:35,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 153 treesize of output 162 [2018-01-20 22:10:35,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,359 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 147 treesize of output 198 [2018-01-20 22:10:35,360 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:35,456 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:35,566 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 298 treesize of output 260 [2018-01-20 22:10:35,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,592 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 291 treesize of output 367 [2018-01-20 22:10:35,593 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:35,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,730 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:35,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,731 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:35,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 122 treesize of output 245 [2018-01-20 22:10:35,740 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:35,806 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:35,901 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 134 treesize of output 126 [2018-01-20 22:10:35,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:35,908 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 125 treesize of output 139 [2018-01-20 22:10:35,908 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:35,980 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-20 22:10:36,039 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:640, output treesize:578 [2018-01-20 22:10:36,099 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:36,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 195 treesize of output 135 [2018-01-20 22:10:36,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:36,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2018-01-20 22:10:36,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,287 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 97 [2018-01-20 22:10:36,291 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 105 [2018-01-20 22:10:36,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,397 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:36,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 86 [2018-01-20 22:10:36,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 62 [2018-01-20 22:10:36,406 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,415 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,485 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:36,491 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 132 treesize of output 127 [2018-01-20 22:10:36,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:36,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 78 [2018-01-20 22:10:36,497 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,507 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,561 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:36,564 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:36,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 284 treesize of output 198 [2018-01-20 22:10:36,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:36,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:36,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 246 [2018-01-20 22:10:36,581 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,629 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:36,692 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 132 [2018-01-20 22:10:36,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:36,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:36,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:36,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 217 [2018-01-20 22:10:36,699 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:36,736 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:36,783 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 3 xjuncts. [2018-01-20 22:10:36,783 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:612, output treesize:366 [2018-01-20 22:10:37,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 132 [2018-01-20 22:10:37,184 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 102 treesize of output 97 [2018-01-20 22:10:37,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:37,269 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 104 treesize of output 98 [2018-01-20 22:10:37,270 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 93 [2018-01-20 22:10:37,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:37,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-01-20 22:10:37,372 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:37,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:37,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 66 [2018-01-20 22:10:37,534 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 54 treesize of output 49 [2018-01-20 22:10:37,535 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 39 [2018-01-20 22:10:37,576 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:37,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-01-20 22:10:37,610 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 40 [2018-01-20 22:10:37,654 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-01-20 22:10:37,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-20 22:10:37,701 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-01-20 22:10:37,748 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-01-20 22:10:37,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2018-01-20 22:10:37,757 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-01-20 22:10:37,787 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 22 treesize of output 12 [2018-01-20 22:10:37,788 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,807 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:37,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:37,814 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2018-01-20 22:10:37,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2018-01-20 22:10:37,817 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,829 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 33 treesize of output 28 [2018-01-20 22:10:37,830 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-20 22:10:37,840 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,848 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:37,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 71 [2018-01-20 22:10:37,861 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 45 treesize of output 40 [2018-01-20 22:10:37,861 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,898 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-01-20 22:10:37,899 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 22 [2018-01-20 22:10:37,928 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:37,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-01-20 22:10:37,954 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-01-20 22:10:37,964 INFO L267 ElimStorePlain]: Start of recursive call 20: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:38,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 131 [2018-01-20 22:10:38,018 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 119 treesize of output 114 [2018-01-20 22:10:38,019 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:38,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:38,179 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:38,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:38,182 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:38,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 64 [2018-01-20 22:10:38,191 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:38,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:38,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:38,302 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:38,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 64 [2018-01-20 22:10:38,311 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:38,402 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:38,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:38,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 56 [2018-01-20 22:10:38,411 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:38,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:38,520 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 114 treesize of output 84 [2018-01-20 22:10:38,520 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:38,572 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 78 treesize of output 68 [2018-01-20 22:10:38,572 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:38,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:38,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:38,735 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:10:38,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 65 [2018-01-20 22:10:38,736 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:38,775 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 65 treesize of output 60 [2018-01-20 22:10:38,775 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:38,828 INFO L267 ElimStorePlain]: Start of recursive call 25: 13 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:38,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2018-01-20 22:10:38,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 43 [2018-01-20 22:10:38,940 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 4 xjuncts. [2018-01-20 22:10:39,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:39,015 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-01-20 22:10:39,015 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:39,130 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 45 treesize of output 35 [2018-01-20 22:10:39,130 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:39,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-01-20 22:10:39,183 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:39,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 23 [2018-01-20 22:10:39,242 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:39,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:39,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-20 22:10:39,287 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:39,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-01-20 22:10:39,321 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:39,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-01-20 22:10:39,385 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:39,414 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-20 22:10:39,415 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:39,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2018-01-20 22:10:39,448 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:39,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 44 [2018-01-20 22:10:39,491 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 12 xjuncts. [2018-01-20 22:10:39,532 INFO L267 ElimStorePlain]: Start of recursive call 34: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-20 22:10:39,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 8 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-20 22:10:39,550 INFO L202 ElimStorePlain]: Needed 45 recursive calls to eliminate 10 variables, input treesize:535, output treesize:38 [2018-01-20 22:10:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 22:10:39,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:10:39,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-01-20 22:10:39,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-20 22:10:39,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-20 22:10:39,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=425, Unknown=3, NotChecked=0, Total=506 [2018-01-20 22:10:39,728 INFO L87 Difference]: Start difference. First operand 246 states and 276 transitions. Second operand 23 states. [2018-01-20 22:10:40,750 WARN L143 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 114 [2018-01-20 22:10:41,263 WARN L143 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 98 [2018-01-20 22:10:41,462 WARN L143 SmtUtils]: Spent 154ms on a formula simplification that was a NOOP. DAG size: 117 [2018-01-20 22:10:41,821 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 107 DAG size of output 101 [2018-01-20 22:10:42,136 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 107 DAG size of output 99 [2018-01-20 22:10:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:42,324 INFO L93 Difference]: Finished difference Result 406 states and 456 transitions. [2018-01-20 22:10:42,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-20 22:10:42,366 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-01-20 22:10:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:42,367 INFO L225 Difference]: With dead ends: 406 [2018-01-20 22:10:42,367 INFO L226 Difference]: Without dead ends: 368 [2018-01-20 22:10:42,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=357, Invalid=1893, Unknown=6, NotChecked=0, Total=2256 [2018-01-20 22:10:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-01-20 22:10:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 221. [2018-01-20 22:10:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-20 22:10:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 249 transitions. [2018-01-20 22:10:42,383 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 249 transitions. Word has length 79 [2018-01-20 22:10:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:42,384 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 249 transitions. [2018-01-20 22:10:42,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-20 22:10:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 249 transitions. [2018-01-20 22:10:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-20 22:10:42,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:42,385 INFO L322 BasicCegarLoop]: trace histogram [3, 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, 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:10:42,385 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2054748333, now seen corresponding path program 1 times [2018-01-20 22:10:42,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:42,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:42,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:42,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:42,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:42,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:42,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:42,896 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:10:42,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:42,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:42,939 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:10:42,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:42,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:42,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:10:42,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:42,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:42,970 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:10:42,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:42,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:42,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-20 22:10:43,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:10:43,009 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:10:43,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-20 22:10:43,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-20 22:10:43,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:43,038 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 16 treesize of output 23 [2018-01-20 22:10:43,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-01-20 22:10:43,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-20 22:10:43,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:43,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:43,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:43,076 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 29 treesize of output 37 [2018-01-20 22:10:43,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2018-01-20 22:10:43,092 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 28 treesize of output 29 [2018-01-20 22:10:43,093 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:10:43,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-20 22:10:43,151 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 58 treesize of output 42 [2018-01-20 22:10:43,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:43,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 54 [2018-01-20 22:10:43,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-01-20 22:10:43,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:43,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2018-01-20 22:10:43,369 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 20 treesize of output 13 [2018-01-20 22:10:43,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:43,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:43,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 29 [2018-01-20 22:10:43,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-20 22:10:43,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:43,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:10:43,424 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:68, output treesize:35 [2018-01-20 22:10:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:43,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:10:43,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 33 [2018-01-20 22:10:43,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-20 22:10:43,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-20 22:10:43,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2018-01-20 22:10:43,594 INFO L87 Difference]: Start difference. First operand 221 states and 249 transitions. Second operand 33 states. [2018-01-20 22:10:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:45,549 INFO L93 Difference]: Finished difference Result 426 states and 486 transitions. [2018-01-20 22:10:45,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-20 22:10:45,549 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 80 [2018-01-20 22:10:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:45,551 INFO L225 Difference]: With dead ends: 426 [2018-01-20 22:10:45,551 INFO L226 Difference]: Without dead ends: 397 [2018-01-20 22:10:45,552 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=359, Invalid=3181, Unknown=0, NotChecked=0, Total=3540 [2018-01-20 22:10:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-20 22:10:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 307. [2018-01-20 22:10:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-01-20 22:10:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 348 transitions. [2018-01-20 22:10:45,571 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 348 transitions. Word has length 80 [2018-01-20 22:10:45,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:45,572 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 348 transitions. [2018-01-20 22:10:45,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-20 22:10:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 348 transitions. [2018-01-20 22:10:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-20 22:10:45,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:45,572 INFO L322 BasicCegarLoop]: trace histogram [3, 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, 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:10:45,573 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash 93840355, now seen corresponding path program 2 times [2018-01-20 22:10:45,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:45,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:45,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:45,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:10:45,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:45,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:46,058 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 28 DAG size of output 22 [2018-01-20 22:10:46,193 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 27 DAG size of output 21 [2018-01-20 22:10:46,327 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 34 DAG size of output 26 [2018-01-20 22:10:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:10:46,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:10:46,658 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:10:46,665 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:10:46,677 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:46,693 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:46,703 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:10:46,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:46,722 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:10:46,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:10:46,759 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:10:46,761 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:10:46,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-20 22:10:46,786 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 21 treesize of output 16 [2018-01-20 22:10:46,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:46,788 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 16 treesize of output 23 [2018-01-20 22:10:46,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-20 22:10:46,819 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 29 [2018-01-20 22:10:46,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:46,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:46,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:46,824 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 29 treesize of output 37 [2018-01-20 22:10:46,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2018-01-20 22:10:46,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:46,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:46,859 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:10:46,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-01-20 22:10:46,909 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 28 treesize of output 29 [2018-01-20 22:10:46,911 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:10:46,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-20 22:10:46,950 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 37 treesize of output 36 [2018-01-20 22:10:46,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:46,952 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 18 treesize of output 27 [2018-01-20 22:10:46,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:46,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-01-20 22:10:46,996 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 41 [2018-01-20 22:10:46,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:46,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:46,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-20 22:10:47,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-01-20 22:10:47,050 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 53 treesize of output 48 [2018-01-20 22:10:47,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-20 22:10:47,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2018-01-20 22:10:47,116 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 68 treesize of output 61 [2018-01-20 22:10:47,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-20 22:10:47,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:59 [2018-01-20 22:10:47,164 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 62 treesize of output 59 [2018-01-20 22:10:47,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 36 [2018-01-20 22:10:47,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,194 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:10:47,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-01-20 22:10:47,243 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 120 treesize of output 82 [2018-01-20 22:10:47,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 127 [2018-01-20 22:10:47,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,283 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:10:47,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:102 [2018-01-20 22:10:47,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 71 [2018-01-20 22:10:47,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 56 [2018-01-20 22:10:47,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-20 22:10:47,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,458 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 64 [2018-01-20 22:10:47,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2018-01-20 22:10:47,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:47,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 59 [2018-01-20 22:10:47,476 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:47,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:47,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:47,506 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:109, output treesize:17 [2018-01-20 22:10:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:10:47,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:10:47,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2018-01-20 22:10:47,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-20 22:10:47,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-20 22:10:47,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=968, Unknown=0, NotChecked=0, Total=1056 [2018-01-20 22:10:47,642 INFO L87 Difference]: Start difference. First operand 307 states and 348 transitions. Second operand 33 states. [2018-01-20 22:10:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:50,171 INFO L93 Difference]: Finished difference Result 440 states and 505 transitions. [2018-01-20 22:10:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-20 22:10:50,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 80 [2018-01-20 22:10:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:50,172 INFO L225 Difference]: With dead ends: 440 [2018-01-20 22:10:50,172 INFO L226 Difference]: Without dead ends: 396 [2018-01-20 22:10:50,173 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=580, Invalid=3580, Unknown=0, NotChecked=0, Total=4160 [2018-01-20 22:10:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-01-20 22:10:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 313. [2018-01-20 22:10:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-01-20 22:10:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 355 transitions. [2018-01-20 22:10:50,207 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 355 transitions. Word has length 80 [2018-01-20 22:10:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:50,208 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 355 transitions. [2018-01-20 22:10:50,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-20 22:10:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 355 transitions. [2018-01-20 22:10:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-20 22:10:50,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:50,209 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-01-20 22:10:50,209 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash 209846235, now seen corresponding path program 2 times [2018-01-20 22:10:50,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:50,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:50,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:50,211 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:10:50,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:50,219 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-20 22:10:50,220 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-20 22:10:50,220 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-20 22:10:50,227 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:10:50,245 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:50,267 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:10:50,275 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:10:50,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:10:50,283 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:10:50,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:10:50,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,303 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:10:50,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-20 22:10:50,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:10:50,338 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:10:50,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,347 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:10:50,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-01-20 22:10:50,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:10:50,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-01-20 22:10:50,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-01-20 22:10:50,432 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 12 treesize of output 11 [2018-01-20 22:10:50,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-20 22:10:50,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-01-20 22:10:50,490 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 14 treesize of output 13 [2018-01-20 22:10:50,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,506 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:10:50,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-20 22:10:50,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2018-01-20 22:10:50,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 48 [2018-01-20 22:10:50,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,584 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:10:50,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-01-20 22:10:50,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-01-20 22:10:50,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-01-20 22:10:50,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,637 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:10:50,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:60 [2018-01-20 22:10:50,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 80 [2018-01-20 22:10:50,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-01-20 22:10:50,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-01-20 22:10:50,683 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:10:50,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:50,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:10:50,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:76 [2018-01-20 22:10:50,759 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 23 treesize of output 22 [2018-01-20 22:10:50,763 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:10:50,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:50,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:50,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:50,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:144 [2018-01-20 22:10:50,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:50,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 91 [2018-01-20 22:10:50,990 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 87 [2018-01-20 22:10:50,991 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:10:51,078 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-01-20 22:10:51,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-20 22:10:51,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,212 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 62 [2018-01-20 22:10:51,213 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-01-20 22:10:51,297 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 14 treesize of output 9 [2018-01-20 22:10:51,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 17 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:51,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:51,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 83 [2018-01-20 22:10:51,382 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 83 [2018-01-20 22:10:51,383 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:10:51,453 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 39 treesize of output 31 [2018-01-20 22:10:51,453 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-01-20 22:10:51,505 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-20 22:10:51,555 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,603 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-20 22:10:51,603 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2018-01-20 22:10:51,625 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,637 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 26 treesize of output 17 [2018-01-20 22:10:51,638 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:51,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:10:51,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-01-20 22:10:51,651 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,661 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 29 treesize of output 25 [2018-01-20 22:10:51,662 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-20 22:10:51,719 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 1 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:10:51,719 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-01-20 22:10:51,726 INFO L267 ElimStorePlain]: Start of recursive call 8: 17 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:51,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:10:51,734 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:237, output treesize:9 [2018-01-20 22:10:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:10:51,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:10:51,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-01-20 22:10:51,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-20 22:10:51,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-20 22:10:51,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-01-20 22:10:51,824 INFO L87 Difference]: Start difference. First operand 313 states and 355 transitions. Second operand 23 states. [2018-01-20 22:10:53,799 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 85 DAG size of output 78 [2018-01-20 22:10:53,943 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 89 DAG size of output 82 [2018-01-20 22:10:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:10:54,258 INFO L93 Difference]: Finished difference Result 457 states and 516 transitions. [2018-01-20 22:10:54,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-20 22:10:54,258 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2018-01-20 22:10:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:10:54,260 INFO L225 Difference]: With dead ends: 457 [2018-01-20 22:10:54,260 INFO L226 Difference]: Without dead ends: 450 [2018-01-20 22:10:54,261 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=593, Invalid=2713, Unknown=0, NotChecked=0, Total=3306 [2018-01-20 22:10:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-01-20 22:10:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 320. [2018-01-20 22:10:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-01-20 22:10:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 363 transitions. [2018-01-20 22:10:54,283 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 363 transitions. Word has length 82 [2018-01-20 22:10:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:10:54,283 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 363 transitions. [2018-01-20 22:10:54,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-20 22:10:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 363 transitions. [2018-01-20 22:10:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-20 22:10:54,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:10:54,284 INFO L322 BasicCegarLoop]: trace histogram [4, 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] [2018-01-20 22:10:54,284 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation]=== [2018-01-20 22:10:54,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1662423642, now seen corresponding path program 1 times [2018-01-20 22:10:54,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:10:54,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:10:54,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:54,285 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:10:54,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:10:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:10:54,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:10:54,432 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-01-20 22:10:54,433 ERROR L119 erpolLogProxyWrapper]: Interpolant 44 not inductive: (Check returned sat) [2018-01-20 22:10:54,433 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-20 22:10:54,436 INFO L168 Benchmark]: Toolchain (without parser) took 52698.51 ms. Allocated memory was 304.6 MB in the beginning and 709.9 MB in the end (delta: 405.3 MB). Free memory was 261.9 MB in the beginning and 372.2 MB in the end (delta: -110.2 MB). Peak memory consumption was 295.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:10:54,437 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 304.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:10:54,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.75 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 250.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:10:54,438 INFO L168 Benchmark]: Boogie Preprocessor took 41.17 ms. Allocated memory is still 304.6 MB. Free memory was 250.0 MB in the beginning and 248.0 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:10:54,438 INFO L168 Benchmark]: RCFGBuilder took 357.31 ms. Allocated memory is still 304.6 MB. Free memory was 248.0 MB in the beginning and 225.5 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-01-20 22:10:54,438 INFO L168 Benchmark]: TraceAbstraction took 52081.76 ms. Allocated memory was 304.6 MB in the beginning and 709.9 MB in the end (delta: 405.3 MB). Free memory was 225.5 MB in the beginning and 372.2 MB in the end (delta: -146.7 MB). Peak memory consumption was 258.5 MB. Max. memory is 5.3 GB. [2018-01-20 22:10:54,440 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.13 ms. Allocated memory is still 304.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.75 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 250.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.17 ms. Allocated memory is still 304.6 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 357.31 ms. Allocated memory is still 304.6 MB. Free memory was 248.0 MB in the beginning and 225.5 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52081.76 ms. Allocated memory was 304.6 MB in the beginning and 709.9 MB in the end (delta: 405.3 MB). Free memory was 225.5 MB in the beginning and 372.2 MB in the end (delta: -146.7 MB). Peak memory consumption was 258.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 63 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=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; VAL [c1=0, c2=0, first={0:0}, last={0:0}] [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, c1=0, c1 < 5 && __VERIFIER_nondet_int()=0, c2=0, first={0:0}, last={0:0}] [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND FALSE !(c1 > 0) VAL [c1=0, c2=0, first={0:0}, last={0:0}] [L682] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 63 locations, 3 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-10-54-446.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-10-54-446.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-10-54-446.csv Received shutdown request...