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/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:28:37,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:28:37,624 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:28:37,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:28:37,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:28:37,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:28:37,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:28:37,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:28:37,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:28:37,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:28:37,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:28:37,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:28:37,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:28:37,650 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:28:37,651 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:28:37,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:28:37,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:28:37,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:28:37,659 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:28:37,660 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:28:37,662 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:28:37,663 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:28:37,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:28:37,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:28:37,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:28:37,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:28:37,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:28:37,667 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:28:37,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:28:37,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:28:37,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:28:37,668 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:28:37,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:28:37,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:28:37,677 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:28:37,677 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:28:37,677 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:28:37,677 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:28:37,677 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:28:37,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:28:37,678 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:28:37,678 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:28:37,678 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:28:37,678 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:28:37,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:28:37,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:28:37,679 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:28:37,679 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:28:37,679 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:28:37,679 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:28:37,679 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:28:37,679 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:28:37,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:28:37,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:28:37,680 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:28:37,680 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:28:37,680 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:28:37,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:28:37,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:28:37,681 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:28:37,681 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:28:37,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:28:37,681 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:28:37,681 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:28:37,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:28:37,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:28:37,682 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:28:37,682 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:28:37,682 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:28:37,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:28:37,724 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:28:37,728 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:28:37,729 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:28:37,729 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:28:37,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-01-23 14:28:37,901 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:28:37,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:28:37,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:28:37,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:28:37,912 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:28:37,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:28:37" (1/1) ... [2018-01-23 14:28:37,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c86d839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:37, skipping insertion in model container [2018-01-23 14:28:37,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:28:37" (1/1) ... [2018-01-23 14:28:37,930 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:28:37,968 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:28:38,089 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:28:38,104 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:28:38,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38 WrapperNode [2018-01-23 14:28:38,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:28:38,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:28:38,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:28:38,110 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:28:38,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38" (1/1) ... [2018-01-23 14:28:38,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38" (1/1) ... [2018-01-23 14:28:38,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38" (1/1) ... [2018-01-23 14:28:38,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38" (1/1) ... [2018-01-23 14:28:38,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38" (1/1) ... [2018-01-23 14:28:38,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38" (1/1) ... [2018-01-23 14:28:38,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38" (1/1) ... [2018-01-23 14:28:38,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:28:38,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:28:38,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:28:38,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:28:38,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38" (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-23 14:28:38,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:28:38,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:28:38,192 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:28:38,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:28:38,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:28:38,405 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:28:38,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:28:38 BoogieIcfgContainer [2018-01-23 14:28:38,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:28:38,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:28:38,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:28:38,409 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:28:38,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:28:37" (1/3) ... [2018-01-23 14:28:38,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d5ee47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:28:38, skipping insertion in model container [2018-01-23 14:28:38,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:38" (2/3) ... [2018-01-23 14:28:38,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d5ee47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:28:38, skipping insertion in model container [2018-01-23 14:28:38,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:28:38" (3/3) ... [2018-01-23 14:28:38,413 INFO L105 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-01-23 14:28:38,420 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:28:38,427 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:28:38,464 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:28:38,464 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:28:38,464 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:28:38,464 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:28:38,464 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:28:38,465 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:28:38,465 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:28:38,465 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:28:38,466 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:28:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-23 14:28:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:28:38,495 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:38,497 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:28:38,497 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:28:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash 98024, now seen corresponding path program 1 times [2018-01-23 14:28:38,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:38,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:38,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:38,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:38,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:28:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:28:38,609 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:28:38,616 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:28:38,624 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:28:38,624 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:28:38,624 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:28:38,624 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:28:38,624 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:28:38,624 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:28:38,625 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:28:38,625 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:28:38,625 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:28:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-23 14:28:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-23 14:28:38,627 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:38,627 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:38,627 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:28:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1566967016, now seen corresponding path program 1 times [2018-01-23 14:28:38,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:38,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:38,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:38,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:38,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:38,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:38,697 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-23 14:28:38,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:38,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:28:38,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:28:38,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:28:38,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:28:38,721 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-23 14:28:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:38,808 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-23 14:28:38,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:28:38,809 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-23 14:28:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:38,818 INFO L225 Difference]: With dead ends: 60 [2018-01-23 14:28:38,818 INFO L226 Difference]: Without dead ends: 40 [2018-01-23 14:28:38,820 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-23 14:28:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-23 14:28:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-23 14:28:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-23 14:28:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-23 14:28:38,852 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2018-01-23 14:28:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:38,852 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-23 14:28:38,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:28:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-23 14:28:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-23 14:28:38,853 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:38,853 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:38,854 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:28:38,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2022925235, now seen corresponding path program 1 times [2018-01-23 14:28:38,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:38,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:38,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:38,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:38,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:38,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:38,955 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-23 14:28:38,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:38,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:28:38,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:28:38,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:28:38,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:28:38,958 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-23 14:28:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:39,117 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-01-23 14:28:39,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:28:39,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-23 14:28:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:39,122 INFO L225 Difference]: With dead ends: 73 [2018-01-23 14:28:39,122 INFO L226 Difference]: Without dead ends: 68 [2018-01-23 14:28:39,123 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:28:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-23 14:28:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2018-01-23 14:28:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-23 14:28:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-23 14:28:39,131 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2018-01-23 14:28:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:39,131 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-23 14:28:39,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:28:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-23 14:28:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-23 14:28:39,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:39,132 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, 1, 1, 1, 1, 1] [2018-01-23 14:28:39,133 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:28:39,133 INFO L82 PathProgramCache]: Analyzing trace with hash 745482112, now seen corresponding path program 1 times [2018-01-23 14:28:39,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:39,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:39,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:39,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:39,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:28:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:28:39,183 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:28:39,189 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:28:39,193 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:28:39,193 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:28:39,202 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:28:39,202 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:28:39,202 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:28:39,202 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:28:39,202 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:28:39,202 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:28:39,203 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:28:39,203 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:28:39,203 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:28:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-23 14:28:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-23 14:28:39,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:39,205 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:39,205 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:39,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1567082781, now seen corresponding path program 1 times [2018-01-23 14:28:39,205 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:39,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:39,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:39,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:39,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:39,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:39,232 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-23 14:28:39,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:39,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:28:39,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:28:39,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:28:39,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:28:39,233 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-23 14:28:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:39,236 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-23 14:28:39,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:28:39,236 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-23 14:28:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:39,237 INFO L225 Difference]: With dead ends: 60 [2018-01-23 14:28:39,237 INFO L226 Difference]: Without dead ends: 38 [2018-01-23 14:28:39,238 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-23 14:28:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-23 14:28:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-23 14:28:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-23 14:28:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-23 14:28:39,243 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 16 [2018-01-23 14:28:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:39,243 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-23 14:28:39,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:28:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-23 14:28:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:28:39,244 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:39,244 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:39,245 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1749589112, now seen corresponding path program 1 times [2018-01-23 14:28:39,245 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:39,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:39,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:39,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:39,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:39,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:39,302 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-23 14:28:39,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:39,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:28:39,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:28:39,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:28:39,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:28:39,304 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-23 14:28:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:39,388 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-23 14:28:39,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:28:39,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-23 14:28:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:39,392 INFO L225 Difference]: With dead ends: 69 [2018-01-23 14:28:39,392 INFO L226 Difference]: Without dead ends: 66 [2018-01-23 14:28:39,393 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:28:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-23 14:28:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-01-23 14:28:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-23 14:28:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-23 14:28:39,397 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-23 14:28:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:39,398 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-23 14:28:39,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:28:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-23 14:28:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-23 14:28:39,399 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:39,399 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, 1, 1, 1] [2018-01-23 14:28:39,399 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1944907653, now seen corresponding path program 1 times [2018-01-23 14:28:39,400 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:39,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:39,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:39,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:39,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:39,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:39,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:39,629 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-23 14:28:39,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:39,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:39,784 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~4.base 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)))) is different from true [2018-01-23 14:28:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-23 14:28:39,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:39,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-23 14:28:39,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:28:39,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:28:39,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2018-01-23 14:28:39,834 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-01-23 14:28:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:40,236 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-23 14:28:40,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:28:40,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-23 14:28:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:40,240 INFO L225 Difference]: With dead ends: 63 [2018-01-23 14:28:40,240 INFO L226 Difference]: Without dead ends: 60 [2018-01-23 14:28:40,240 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=160, Unknown=1, NotChecked=26, Total=240 [2018-01-23 14:28:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-23 14:28:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-01-23 14:28:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-23 14:28:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-23 14:28:40,245 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 26 [2018-01-23 14:28:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:40,246 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-23 14:28:40,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:28:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-23 14:28:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-23 14:28:40,247 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:40,247 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, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:40,249 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:40,249 INFO L82 PathProgramCache]: Analyzing trace with hash 66158503, now seen corresponding path program 1 times [2018-01-23 14:28:40,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:40,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:40,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:40,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:40,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:40,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:40,524 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-23 14:28:40,524 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:40,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:28:40,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:28:40,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:28:40,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:28:40,525 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 7 states. [2018-01-23 14:28:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:40,663 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-23 14:28:40,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:28:40,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-23 14:28:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:40,664 INFO L225 Difference]: With dead ends: 71 [2018-01-23 14:28:40,664 INFO L226 Difference]: Without dead ends: 58 [2018-01-23 14:28:40,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:28:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-23 14:28:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-23 14:28:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-23 14:28:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-23 14:28:40,670 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2018-01-23 14:28:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:40,670 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-23 14:28:40,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:28:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-23 14:28:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:28:40,671 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:40,671 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:40,671 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:40,671 INFO L82 PathProgramCache]: Analyzing trace with hash 304338011, now seen corresponding path program 1 times [2018-01-23 14:28:40,671 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:40,671 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:40,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:40,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:40,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:40,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:40,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:40,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:28:40,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:28:40,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:28:40,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:28:40,740 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-23 14:28:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:40,839 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-01-23 14:28:40,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:28:40,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-23 14:28:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:40,840 INFO L225 Difference]: With dead ends: 91 [2018-01-23 14:28:40,841 INFO L226 Difference]: Without dead ends: 88 [2018-01-23 14:28:40,841 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:28:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-23 14:28:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2018-01-23 14:28:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-23 14:28:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-23 14:28:40,847 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 30 [2018-01-23 14:28:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:40,848 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-23 14:28:40,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:28:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-23 14:28:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-23 14:28:40,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:40,849 INFO L322 BasicCegarLoop]: trace histogram [3, 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-23 14:28:40,849 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash 264537048, now seen corresponding path program 2 times [2018-01-23 14:28:40,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:40,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:40,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:40,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:40,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:40,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:40,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:40,962 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-23 14:28:40,967 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:28:40,977 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:28:40,984 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:28:40,986 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:28:40,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:41,024 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-23 14:28:41,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 14:28:41,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-23 14:28:41,046 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-23 14:28:41,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:41,050 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-23 14:28:41,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-23 14:28:41,079 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 30 treesize of output 23 [2018-01-23 14:28:41,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:41,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:41,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:41,084 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 23 treesize of output 46 [2018-01-23 14:28:41,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-23 14:28:41,132 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 29 treesize of output 21 [2018-01-23 14:28:41,135 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 21 treesize of output 3 [2018-01-23 14:28:41,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,138 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-23 14:28:41,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-01-23 14:28:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:41,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:41,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2018-01-23 14:28:41,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-23 14:28:41,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-23 14:28:41,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-23 14:28:41,193 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 15 states. [2018-01-23 14:28:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:41,488 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-23 14:28:41,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:28:41,489 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-23 14:28:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:41,489 INFO L225 Difference]: With dead ends: 68 [2018-01-23 14:28:41,489 INFO L226 Difference]: Without dead ends: 46 [2018-01-23 14:28:41,490 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:28:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-23 14:28:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-23 14:28:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-23 14:28:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-23 14:28:41,496 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 33 [2018-01-23 14:28:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:41,496 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-23 14:28:41,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-23 14:28:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-23 14:28:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:28:41,498 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:41,498 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, 1, 1, 1, 1] [2018-01-23 14:28:41,498 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1962892734, now seen corresponding path program 1 times [2018-01-23 14:28:41,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:41,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:41,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:41,499 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:28:41,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:41,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:41,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:41,723 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-23 14:28:41,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:41,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:41,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:28:41,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-23 14:28:41,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:41,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:41,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:28:41,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-01-23 14:28:41,810 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-23 14:28:41,812 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-23 14:28:41,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-23 14:28:41,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-23 14:28:41,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:28:41,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,853 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-23 14:28:41,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-01-23 14:28:41,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-01-23 14:28:41,894 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 32 treesize of output 37 [2018-01-23 14:28:41,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:41,916 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-23 14:28:41,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-23 14:28:42,034 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 48 treesize of output 39 [2018-01-23 14:28:42,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:28:42,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:42,058 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-23 14:28:42,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-01-23 14:28:42,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:28:42,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-23 14:28:42,102 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 23 treesize of output 21 [2018-01-23 14:28:42,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-23 14:28:42,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:28:42,113 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:42,119 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:28:42,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-23 14:28:42,135 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:97, output treesize:32 [2018-01-23 14:28:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:42,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:42,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-01-23 14:28:42,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-23 14:28:42,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-23 14:28:42,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-01-23 14:28:42,205 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 21 states. [2018-01-23 14:28:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:42,959 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-01-23 14:28:42,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:28:42,959 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-01-23 14:28:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:42,960 INFO L225 Difference]: With dead ends: 104 [2018-01-23 14:28:42,960 INFO L226 Difference]: Without dead ends: 101 [2018-01-23 14:28:42,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2018-01-23 14:28:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-23 14:28:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 66. [2018-01-23 14:28:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-23 14:28:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-23 14:28:42,967 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 37 [2018-01-23 14:28:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:42,967 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-23 14:28:42,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-23 14:28:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-23 14:28:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-23 14:28:42,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:42,968 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:42,968 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1346194821, now seen corresponding path program 2 times [2018-01-23 14:28:42,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:42,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:42,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:42,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:42,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:42,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:43,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:43,521 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:28:43,527 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:28:43,538 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:28:43,547 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:28:43,551 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:28:43,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:43,745 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-23 14:28:43,747 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-23 14:28:43,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:43,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:43,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:43,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-23 14:28:43,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:43,791 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 56 treesize of output 60 [2018-01-23 14:28:43,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:28:43,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:43,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:43,807 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-23 14:28:43,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-23 14:28:43,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:43,850 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 59 treesize of output 57 [2018-01-23 14:28:43,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-01-23 14:28:43,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:43,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:43,867 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-23 14:28:43,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:55 [2018-01-23 14:28:44,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:44,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-01-23 14:28:44,057 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2018-01-23 14:28:44,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:28:44,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:28:44,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:44,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:28:44,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:44,184 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 66 treesize of output 61 [2018-01-23 14:28:44,194 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2018-01-23 14:28:44,196 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:28:44,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:28:44,219 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:44,234 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:28:44,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-01-23 14:28:44,306 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:133, output treesize:162 [2018-01-23 14:28:44,912 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~4.base 1))) (and (not (= v_subst_1 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)) (= (select .cse0 v_subst_1) 0) (= |c_#valid| (store (store .cse0 v_subst_1 0) main_~y~4.base 0))))) is different from true [2018-01-23 14:28:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-23 14:28:44,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:44,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2018-01-23 14:28:44,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-23 14:28:44,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-23 14:28:44,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=728, Unknown=20, NotChecked=54, Total=870 [2018-01-23 14:28:44,948 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 30 states. [2018-01-23 14:28:46,053 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 123 DAG size of output 44 [2018-01-23 14:28:46,252 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 98 DAG size of output 37 [2018-01-23 14:28:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:46,788 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-01-23 14:28:46,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-23 14:28:46,788 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-01-23 14:28:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:46,789 INFO L225 Difference]: With dead ends: 101 [2018-01-23 14:28:46,790 INFO L226 Difference]: Without dead ends: 98 [2018-01-23 14:28:46,791 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=202, Invalid=1588, Unknown=20, NotChecked=82, Total=1892 [2018-01-23 14:28:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-23 14:28:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2018-01-23 14:28:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-23 14:28:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-23 14:28:46,799 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 44 [2018-01-23 14:28:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:46,800 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-23 14:28:46,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-23 14:28:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-23 14:28:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-23 14:28:46,801 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:46,801 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:46,801 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2126030707, now seen corresponding path program 1 times [2018-01-23 14:28:46,802 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:46,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:46,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:46,803 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:28:46,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:46,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:28:46,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:46,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-23 14:28:46,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:28:46,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:28:46,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:28:46,980 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 10 states. [2018-01-23 14:28:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:47,222 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2018-01-23 14:28:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-23 14:28:47,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-23 14:28:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:47,224 INFO L225 Difference]: With dead ends: 143 [2018-01-23 14:28:47,224 INFO L226 Difference]: Without dead ends: 127 [2018-01-23 14:28:47,224 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2018-01-23 14:28:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-23 14:28:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2018-01-23 14:28:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-23 14:28:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-01-23 14:28:47,233 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 45 [2018-01-23 14:28:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:47,233 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-01-23 14:28:47,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:28:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-01-23 14:28:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-23 14:28:47,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:47,234 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-23 14:28:47,234 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash 886772723, now seen corresponding path program 1 times [2018-01-23 14:28:47,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:47,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:47,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:47,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:47,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:47,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:48,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:48,007 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-23 14:28:48,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:48,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:48,061 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-23 14:28:48,063 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-23 14:28:48,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-23 14:28:48,119 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-23 14:28:48,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:48,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-23 14:28:48,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,126 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 21 treesize of output 17 [2018-01-23 14:28:48,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:28:48,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:28:48,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:28:48,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:28:48,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:43, output treesize:15 [2018-01-23 14:28:48,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-23 14:28:48,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:28:48,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-23 14:28:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:28:48,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:28:48,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 28 [2018-01-23 14:28:48,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-23 14:28:48,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-23 14:28:48,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-01-23 14:28:48,210 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 28 states. [2018-01-23 14:28:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:49,773 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-01-23 14:28:49,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-23 14:28:49,773 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-01-23 14:28:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:49,774 INFO L225 Difference]: With dead ends: 146 [2018-01-23 14:28:49,774 INFO L226 Difference]: Without dead ends: 123 [2018-01-23 14:28:49,775 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=485, Invalid=3055, Unknown=0, NotChecked=0, Total=3540 [2018-01-23 14:28:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-23 14:28:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 99. [2018-01-23 14:28:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-23 14:28:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-23 14:28:49,782 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 47 [2018-01-23 14:28:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:49,782 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-23 14:28:49,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-23 14:28:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-23 14:28:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-23 14:28:49,783 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:49,783 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-23 14:28:49,783 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:49,783 INFO L82 PathProgramCache]: Analyzing trace with hash 345788657, now seen corresponding path program 2 times [2018-01-23 14:28:49,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:49,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:49,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:49,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:49,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:49,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:50,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:50,729 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:28:50,734 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:28:50,743 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:28:50,753 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:28:50,758 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:28:50,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:50,768 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-23 14:28:50,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:28:50,808 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-23 14:28:50,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 14:28:50,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-23 14:28:50,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:50,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:50,857 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-23 14:28:50,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-23 14:28:50,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:28:50,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 8 treesize of output 7 [2018-01-23 14:28:50,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,925 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-23 14:28:50,926 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-23 14:28:50,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,934 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-01-23 14:28:50,967 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 69 treesize of output 64 [2018-01-23 14:28:50,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:50,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:50,971 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 24 treesize of output 51 [2018-01-23 14:28:50,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-01-23 14:28:50,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-23 14:28:50,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:50,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:64 [2018-01-23 14:28:51,042 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 64 treesize of output 63 [2018-01-23 14:28:51,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:51,045 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 57 [2018-01-23 14:28:51,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,067 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 65 treesize of output 57 [2018-01-23 14:28:51,069 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 54 treesize of output 61 [2018-01-23 14:28:51,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-01-23 14:28:51,211 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 68 treesize of output 57 [2018-01-23 14:28:51,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-23 14:28:51,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,229 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2018-01-23 14:28:51,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:28:51,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:28:51,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-23 14:28:51,280 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:82, output treesize:134 [2018-01-23 14:28:51,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-01-23 14:28:51,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:51,519 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 20 treesize of output 15 [2018-01-23 14:28:51,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:28:51,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:51,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:51,536 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 20 treesize of output 29 [2018-01-23 14:28:51,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-23 14:28:51,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:28:51,558 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-23 14:28:51,559 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:10 [2018-01-23 14:28:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:51,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:51,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2018-01-23 14:28:51,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-23 14:28:51,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-23 14:28:51,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2018-01-23 14:28:51,644 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 36 states. [2018-01-23 14:28:52,604 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 151 DAG size of output 72 [2018-01-23 14:28:52,831 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 111 DAG size of output 96 [2018-01-23 14:28:53,367 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 167 DAG size of output 123 [2018-01-23 14:28:53,781 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 140 DAG size of output 76 [2018-01-23 14:28:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:54,316 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-01-23 14:28:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:28:54,317 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2018-01-23 14:28:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:54,317 INFO L225 Difference]: With dead ends: 134 [2018-01-23 14:28:54,317 INFO L226 Difference]: Without dead ends: 117 [2018-01-23 14:28:54,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=305, Invalid=2887, Unknown=0, NotChecked=0, Total=3192 [2018-01-23 14:28:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-23 14:28:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-01-23 14:28:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-23 14:28:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-23 14:28:54,325 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 47 [2018-01-23 14:28:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:54,326 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-23 14:28:54,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-23 14:28:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-23 14:28:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:28:54,327 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:54,327 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-23 14:28:54,327 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash 273996961, now seen corresponding path program 1 times [2018-01-23 14:28:54,327 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:54,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:54,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:54,328 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:28:54,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:54,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:55,145 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 72 DAG size of output 37 [2018-01-23 14:28:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:56,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:56,126 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:28:56,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:56,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:56,290 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-23 14:28:56,292 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-23 14:28:56,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:56,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:56,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:56,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-23 14:28:56,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:56,348 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 56 treesize of output 60 [2018-01-23 14:28:56,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:28:56,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:56,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:56,365 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-23 14:28:56,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-23 14:28:56,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:56,484 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 77 treesize of output 73 [2018-01-23 14:28:56,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:56,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 89 [2018-01-23 14:28:56,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:56,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:56,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:28:56,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-01-23 14:28:56,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:56,929 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 102 treesize of output 89 [2018-01-23 14:28:56,933 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:56,934 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:56,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:56,945 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 2 case distinctions, treesize of input 73 treesize of output 83 [2018-01-23 14:28:56,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-23 14:28:57,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:28:57,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:57,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-23 14:28:57,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:57,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-01-23 14:28:57,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:57,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:57,298 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 91 [2018-01-23 14:28:57,306 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-01-23 14:28:57,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:28:57,824 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:58,184 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-01-23 14:28:58,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 12 xjuncts. [2018-01-23 14:28:58,997 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:205, output treesize:673 [2018-01-23 14:28:59,282 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 178 DAG size of output 81 [2018-01-23 14:28:59,629 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 130 DAG size of output 95 [2018-01-23 14:29:00,113 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int) (v_prenex_30 Int) (v_subst_3 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~4.base 1))) (let ((.cse1 (store .cse0 v_subst_3 1))) (and (not (= v_prenex_30 0)) (= 0 (select .cse0 v_subst_3)) (not (= v_subst_3 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)) (= (select .cse1 v_prenex_30) 0) (= |c_#valid| (store (store (store .cse1 v_prenex_30 0) v_subst_3 0) main_~y~4.base 0)))))) is different from true [2018-01-23 14:29:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-23 14:29:00,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:00,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-23 14:29:00,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-23 14:29:00,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-23 14:29:00,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1236, Unknown=13, NotChecked=70, Total=1406 [2018-01-23 14:29:00,165 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 38 states. [2018-01-23 14:29:01,504 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 135 DAG size of output 51 [2018-01-23 14:29:01,862 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 176 DAG size of output 56 [2018-01-23 14:29:02,056 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 120 DAG size of output 54 [2018-01-23 14:29:02,394 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 192 DAG size of output 57 [2018-01-23 14:29:02,614 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 195 DAG size of output 75 [2018-01-23 14:29:02,813 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 191 DAG size of output 69 [2018-01-23 14:29:03,032 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 118 DAG size of output 74 [2018-01-23 14:29:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:03,601 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-01-23 14:29:03,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-23 14:29:03,601 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 48 [2018-01-23 14:29:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:03,602 INFO L225 Difference]: With dead ends: 123 [2018-01-23 14:29:03,602 INFO L226 Difference]: Without dead ends: 120 [2018-01-23 14:29:03,602 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=269, Invalid=2799, Unknown=16, NotChecked=108, Total=3192 [2018-01-23 14:29:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-23 14:29:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2018-01-23 14:29:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-23 14:29:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-01-23 14:29:03,607 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 48 [2018-01-23 14:29:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:03,608 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-01-23 14:29:03,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-23 14:29:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-01-23 14:29:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:29:03,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:03,608 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:29:03,608 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1926183067, now seen corresponding path program 3 times [2018-01-23 14:29:03,609 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:03,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:03,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:03,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:03,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:03,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:03,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:03,788 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:29:03,793 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:29:03,803 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:29:03,809 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:29:03,827 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:29:03,829 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:29:03,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:03,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:29:03,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-23 14:29:03,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:03,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:03,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:29:03,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-01-23 14:29:03,878 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-23 14:29:03,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 14:29:03,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-23 14:29:03,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-23 14:29:03,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:29:03,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,909 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-23 14:29:03,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-01-23 14:29:03,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-23 14:29:03,932 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:03,933 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 34 treesize of output 45 [2018-01-23 14:29:03,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,945 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-23 14:29:03,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-01-23 14:29:04,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-01-23 14:29:04,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 7 treesize of output 1 [2018-01-23 14:29:04,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:04,024 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 25 treesize of output 15 [2018-01-23 14:29:04,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:04,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:04,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:04,030 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:4 [2018-01-23 14:29:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:04,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:04,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 17 [2018-01-23 14:29:04,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-23 14:29:04,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-23 14:29:04,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:29:04,074 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 17 states. [2018-01-23 14:29:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:09,115 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-23 14:29:09,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-23 14:29:09,116 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-01-23 14:29:09,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:09,116 INFO L225 Difference]: With dead ends: 140 [2018-01-23 14:29:09,116 INFO L226 Difference]: Without dead ends: 137 [2018-01-23 14:29:09,117 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=451, Invalid=1271, Unknown=0, NotChecked=0, Total=1722 [2018-01-23 14:29:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-23 14:29:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 103. [2018-01-23 14:29:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-23 14:29:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-23 14:29:09,126 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 48 [2018-01-23 14:29:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:09,127 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-23 14:29:09,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-23 14:29:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-23 14:29:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-23 14:29:09,128 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:09,128 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-23 14:29:09,128 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash 636693771, now seen corresponding path program 1 times [2018-01-23 14:29:09,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:09,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:09,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:09,129 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:29:09,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:09,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:09,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:09,722 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-23 14:29:09,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:09,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:09,768 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-23 14:29:09,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:29:09,792 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-23 14:29:09,793 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-23 14:29:09,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-23 14:29:09,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:09,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:09,827 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-23 14:29:09,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-23 14:29:09,898 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-23 14:29:09,900 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-23 14:29:09,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-01-23 14:29:09,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:29:09,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-01-23 14:29:09,964 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 69 treesize of output 64 [2018-01-23 14:29:09,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:09,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:09,969 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 24 treesize of output 51 [2018-01-23 14:29:09,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-01-23 14:29:09,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-23 14:29:09,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:10,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:10,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:10,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:64 [2018-01-23 14:29:10,048 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 64 treesize of output 63 [2018-01-23 14:29:10,051 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 44 treesize of output 49 [2018-01-23 14:29:10,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:10,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:10,071 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 65 treesize of output 57 [2018-01-23 14:29:10,074 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 54 treesize of output 61 [2018-01-23 14:29:10,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:10,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:10,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:10,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:61 [2018-01-23 14:29:10,181 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 61 treesize of output 52 [2018-01-23 14:29:10,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-23 14:29:10,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:10,192 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 36 treesize of output 33 [2018-01-23 14:29:10,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:10,203 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-23 14:29:10,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:10,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:68, output treesize:69 [2018-01-23 14:29:10,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-23 14:29:10,390 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 15 treesize of output 11 [2018-01-23 14:29:10,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:29:10,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:10,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:10,406 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 20 treesize of output 29 [2018-01-23 14:29:10,407 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-23 14:29:10,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:29:10,429 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-23 14:29:10,429 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:10 [2018-01-23 14:29:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:10,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:10,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 35 [2018-01-23 14:29:10,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-23 14:29:10,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-23 14:29:10,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2018-01-23 14:29:10,497 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 35 states. [2018-01-23 14:29:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:12,413 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-01-23 14:29:12,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-23 14:29:12,413 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 51 [2018-01-23 14:29:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:12,414 INFO L225 Difference]: With dead ends: 138 [2018-01-23 14:29:12,414 INFO L226 Difference]: Without dead ends: 121 [2018-01-23 14:29:12,415 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=438, Invalid=3222, Unknown=0, NotChecked=0, Total=3660 [2018-01-23 14:29:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-23 14:29:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2018-01-23 14:29:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-23 14:29:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-23 14:29:12,422 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 51 [2018-01-23 14:29:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:12,422 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-23 14:29:12,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-23 14:29:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-23 14:29:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-23 14:29:12,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:12,423 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:29:12,423 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1085382690, now seen corresponding path program 4 times [2018-01-23 14:29:12,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:12,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:12,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:12,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:12,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:12,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:12,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:12,802 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:29:12,807 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-23 14:29:12,843 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:29:12,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:12,852 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-23 14:29:12,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:29:12,862 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-23 14:29:12,864 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-23 14:29:12,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-23 14:29:12,899 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-23 14:29:12,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:12,901 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-23 14:29:12,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-23 14:29:12,939 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 30 treesize of output 23 [2018-01-23 14:29:12,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:12,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:12,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:12,944 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 23 treesize of output 46 [2018-01-23 14:29:12,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:12,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-23 14:29:13,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:13,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:13,024 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-23 14:29:13,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-01-23 14:29:13,083 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 33 treesize of output 34 [2018-01-23 14:29:13,085 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-23 14:29:13,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-01-23 14:29:13,131 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 65 treesize of output 43 [2018-01-23 14:29:13,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:13,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2018-01-23 14:29:13,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-01-23 14:29:13,183 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 59 treesize of output 45 [2018-01-23 14:29:13,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:13,185 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 46 treesize of output 61 [2018-01-23 14:29:13,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:13,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-01-23 14:29:13,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:13,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2018-01-23 14:29:13,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:13,738 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 73 [2018-01-23 14:29:13,739 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-23 14:29:13,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 104 dim-0 vars, End of recursive call: 104 dim-0 vars, and 112 xjuncts. [2018-01-23 14:29:14,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-01-23 14:29:14,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:14,157 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 23 treesize of output 16 [2018-01-23 14:29:14,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:14,159 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 23 treesize of output 16 [2018-01-23 14:29:14,159 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:14,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-01-23 14:29:14,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:14,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:29:14,183 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-23 14:29:14,183 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:64, output treesize:31 [2018-01-23 14:29:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:14,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:14,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 35 [2018-01-23 14:29:14,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-23 14:29:14,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-23 14:29:14,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2018-01-23 14:29:14,308 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 35 states. [2018-01-23 14:29:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:16,074 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-01-23 14:29:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-23 14:29:16,075 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 51 [2018-01-23 14:29:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:16,075 INFO L225 Difference]: With dead ends: 130 [2018-01-23 14:29:16,075 INFO L226 Difference]: Without dead ends: 87 [2018-01-23 14:29:16,076 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=338, Invalid=3202, Unknown=0, NotChecked=0, Total=3540 [2018-01-23 14:29:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-23 14:29:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-01-23 14:29:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-23 14:29:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-23 14:29:16,080 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 51 [2018-01-23 14:29:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:16,081 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-23 14:29:16,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-23 14:29:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-23 14:29:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-23 14:29:16,081 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:16,081 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:29:16,081 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1764225032, now seen corresponding path program 5 times [2018-01-23 14:29:16,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:16,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:16,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:16,082 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:29:16,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:16,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:16,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:16,537 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-23 14:29:16,542 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-23 14:29:16,551 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:29:16,556 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:29:16,568 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:29:16,569 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:29:16,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:16,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:29:16,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-23 14:29:16,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:16,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:16,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-23 14:29:16,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2018-01-23 14:29:16,637 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-23 14:29:16,639 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-23 14:29:16,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-23 14:29:16,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-01-23 14:29:16,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:29:16,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,687 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-23 14:29:16,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-01-23 14:29:16,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-01-23 14:29:16,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:16,741 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 41 treesize of output 54 [2018-01-23 14:29:16,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,758 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-23 14:29:16,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:56 [2018-01-23 14:29:16,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:16,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:16,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:16,844 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 20 treesize of output 21 [2018-01-23 14:29:16,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,853 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-23 14:29:16,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:56 [2018-01-23 14:29:16,933 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 56 treesize of output 60 [2018-01-23 14:29:16,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:29:16,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:16,964 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-23 14:29:16,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2018-01-23 14:29:17,015 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 75 [2018-01-23 14:29:17,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:17,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:17,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 110 [2018-01-23 14:29:17,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:29:17,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:29:17,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:17,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:191 [2018-01-23 14:29:17,189 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 91 [2018-01-23 14:29:17,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:17,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 113 [2018-01-23 14:29:17,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:17,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:17,253 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-23 14:29:17,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:17,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 96 [2018-01-23 14:29:17,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:17,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:17,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:17,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:217, output treesize:209 [2018-01-23 14:29:17,776 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 125 treesize of output 124 [2018-01-23 14:29:17,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:17,809 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 97 treesize of output 96 [2018-01-23 14:29:17,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:17,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:17,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:231, output treesize:213 [2018-01-23 14:29:18,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 82 [2018-01-23 14:29:18,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,070 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 61 [2018-01-23 14:29:18,075 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-01-23 14:29:18,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,112 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 38 treesize of output 36 [2018-01-23 14:29:18,113 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-23 14:29:18,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-23 14:29:18,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-01-23 14:29:18,144 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,145 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 16 treesize of output 9 [2018-01-23 14:29:18,145 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-23 14:29:18,147 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:29:18,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 82 [2018-01-23 14:29:18,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,264 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2018-01-23 14:29:18,266 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-01-23 14:29:18,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,291 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 20 treesize of output 16 [2018-01-23 14:29:18,291 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:29:18,301 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,307 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:29:18,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 94 [2018-01-23 14:29:18,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,406 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 61 [2018-01-23 14:29:18,408 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:29:18,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 74 [2018-01-23 14:29:18,445 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-01-23 14:29:18,485 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 18 [2018-01-23 14:29:18,485 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,486 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 28 treesize of output 21 [2018-01-23 14:29:18,486 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-01-23 14:29:18,488 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,510 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:29:18,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 94 [2018-01-23 14:29:18,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,626 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 61 [2018-01-23 14:29:18,627 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:29:18,653 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 35 treesize of output 16 [2018-01-23 14:29:18,653 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:18,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:18,678 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-01-23 14:29:18,679 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 5 xjuncts. [2018-01-23 14:29:18,717 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-23 14:29:18,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 12 xjuncts. [2018-01-23 14:29:18,867 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 14 variables, input treesize:469, output treesize:299 [2018-01-23 14:29:19,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:19,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:29:19,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:19,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:19,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-01-23 14:29:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:19,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:19,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 40 [2018-01-23 14:29:19,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-23 14:29:19,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-23 14:29:19,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2018-01-23 14:29:19,150 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 40 states. [2018-01-23 14:29:20,708 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 85 DAG size of output 63 [2018-01-23 14:29:21,381 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 120 DAG size of output 69 [2018-01-23 14:29:22,002 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 142 DAG size of output 101 [2018-01-23 14:29:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:22,703 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2018-01-23 14:29:22,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-23 14:29:22,704 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 55 [2018-01-23 14:29:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:22,704 INFO L225 Difference]: With dead ends: 195 [2018-01-23 14:29:22,705 INFO L226 Difference]: Without dead ends: 192 [2018-01-23 14:29:22,706 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=575, Invalid=5745, Unknown=0, NotChecked=0, Total=6320 [2018-01-23 14:29:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-23 14:29:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 115. [2018-01-23 14:29:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-23 14:29:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-23 14:29:22,715 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 55 [2018-01-23 14:29:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:22,716 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-23 14:29:22,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-23 14:29:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-23 14:29:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-23 14:29:22,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:22,716 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-01-23 14:29:22,716 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1371763707, now seen corresponding path program 6 times [2018-01-23 14:29:22,717 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:22,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:22,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:22,717 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:29:22,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:22,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:24,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:24,824 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-23 14:29:24,829 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-23 14:29:24,839 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:29:24,843 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:29:24,850 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:29:24,862 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:29:24,867 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:29:24,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:25,043 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-23 14:29:25,044 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-23 14:29:25,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-23 14:29:25,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,103 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 56 treesize of output 60 [2018-01-23 14:29:25,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:29:25,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,119 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-23 14:29:25,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-23 14:29:25,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2018-01-23 14:29:25,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,182 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 56 treesize of output 71 [2018-01-23 14:29:25,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,199 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-23 14:29:25,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-01-23 14:29:25,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 113 [2018-01-23 14:29:25,470 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 18 treesize of output 16 [2018-01-23 14:29:25,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,497 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-23 14:29:25,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:86 [2018-01-23 14:29:25,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,590 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 142 [2018-01-23 14:29:25,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,620 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 227 [2018-01-23 14:29:25,623 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-01-23 14:29:25,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-23 14:29:25,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-01-23 14:29:25,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:144, output treesize:548 [2018-01-23 14:29:26,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,014 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 143 [2018-01-23 14:29:26,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,028 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 201 [2018-01-23 14:29:26,029 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-23 14:29:26,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:26,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,118 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 157 [2018-01-23 14:29:26,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:26,131 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 218 [2018-01-23 14:29:26,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:26,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:26,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:26,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:279, output treesize:271 [2018-01-23 14:29:28,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 136 [2018-01-23 14:29:28,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,746 INFO L477 Elim1Store]: Elim1 applied some 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 3 case distinctions, treesize of input 79 treesize of output 110 [2018-01-23 14:29:28,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-23 14:29:28,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:28,791 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 74 treesize of output 78 [2018-01-23 14:29:28,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:28,813 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 64 treesize of output 49 [2018-01-23 14:29:28,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:28,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:29,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 136 [2018-01-23 14:29:29,107 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 15 treesize of output 12 [2018-01-23 14:29:29,107 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-23 14:29:29,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,140 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 75 treesize of output 76 [2018-01-23 14:29:29,140 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:29,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,165 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 59 treesize of output 43 [2018-01-23 14:29:29,165 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:29,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,168 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 60 treesize of output 49 [2018-01-23 14:29:29,168 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:29:29,194 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:29,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 124 [2018-01-23 14:29:29,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,517 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 70 [2018-01-23 14:29:29,517 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:29,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,545 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 68 treesize of output 72 [2018-01-23 14:29:29,545 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:29,561 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 64 treesize of output 49 [2018-01-23 14:29:29,562 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:29,584 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:29,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 124 [2018-01-23 14:29:29,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,869 INFO L477 Elim1Store]: Elim1 applied some 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 85 treesize of output 103 [2018-01-23 14:29:29,870 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:29,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:29,900 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 82 treesize of output 68 [2018-01-23 14:29:29,900 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:29,920 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 64 treesize of output 49 [2018-01-23 14:29:29,921 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:29,948 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:30,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts. [2018-01-23 14:29:30,223 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 14 variables, input treesize:685, output treesize:417 [2018-01-23 14:29:30,559 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int) (v_arrayElimCell_125 Int) (v_prenex_206 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~4.base 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_125 1))) (and (= 0 (select .cse0 v_arrayElimCell_125)) (= 0 (select .cse1 v_prenex_206)) (= (store (store (store .cse1 v_prenex_206 0) v_arrayElimCell_125 0) main_~y~4.base 0) |c_#valid|) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)) (not (= v_prenex_206 0)) (not (= 0 v_arrayElimCell_125)))))) is different from true [2018-01-23 14:29:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-01-23 14:29:30,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:30,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2018-01-23 14:29:30,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-23 14:29:30,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-23 14:29:30,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2807, Unknown=14, NotChecked=106, Total=3080 [2018-01-23 14:29:30,627 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 56 states. Received shutdown request... [2018-01-23 14:29:31,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:29:31,444 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:29:31,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:29:31 BoogieIcfgContainer [2018-01-23 14:29:31,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:29:31,446 INFO L168 Benchmark]: Toolchain (without parser) took 53544.13 ms. Allocated memory was 304.1 MB in the beginning and 744.0 MB in the end (delta: 439.9 MB). Free memory was 262.4 MB in the beginning and 639.8 MB in the end (delta: -377.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 5.3 GB. [2018-01-23 14:29:31,447 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:29:31,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.15 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:29:31,447 INFO L168 Benchmark]: Boogie Preprocessor took 32.95 ms. Allocated memory is still 304.1 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:29:31,448 INFO L168 Benchmark]: RCFGBuilder took 262.74 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 231.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:29:31,448 INFO L168 Benchmark]: TraceAbstraction took 53038.78 ms. Allocated memory was 304.1 MB in the beginning and 744.0 MB in the end (delta: 439.9 MB). Free memory was 231.7 MB in the beginning and 639.8 MB in the end (delta: -408.1 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. [2018-01-23 14:29:31,449 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.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.15 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.95 ms. Allocated memory is still 304.1 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 262.74 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 231.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53038.78 ms. Allocated memory was 304.1 MB in the beginning and 744.0 MB in the end (delta: 439.9 MB). Free memory was 231.7 MB in the beginning and 639.8 MB in the end (delta: -408.1 MB). Peak memory consumption was 31.8 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, 43 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=43occurred 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: [L633] Node* list = ((void *)0); [L634] Node* y = ((void *)0); VAL [list={0:0}, y={0:0}] [L635] EXPR, FCALL malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={0:0}] [L635] y = malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L636] FCALL y->next = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L637] FCALL y->prev = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L638] FCALL y->pData = &y->data VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L639] list = y VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L640] COND FALSE !(__VERIFIER_nondet_int()) [L655] COND TRUE ((void *)0) != list [L657] y = list VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] EXPR, FCALL list->next VAL [list={15:0}, list->next={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] list = list->next [L659] EXPR, FCALL y->pData VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}, y->pData={15:12}] [L659] COND FALSE !(&y->data != y->pData) [L663] FCALL free(y) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L655] COND FALSE !(((void *)0) != list) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L665] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 96 SDslu, 58 SDs, 0 SdLazy, 44 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, 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, 2 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (115states) and interpolant automaton (currently 9 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. TIMEOUT Result, 52.2s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 568 SDtfs, 2290 SDslu, 5118 SDs, 0 SdLazy, 9395 SolverSat, 1050 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1088 GetRequests, 417 SyntacticMatches, 48 SemanticMatches, 622 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6137 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=16, 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, 16 MinimizatonAttempts, 369 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 1237 NumberOfCodeBlocks, 1237 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1208 ConstructedInterpolants, 185 QuantifiedInterpolants, 2119943 SizeOfPredicates, 202 NumberOfNonLiveVariables, 1897 ConjunctsInSsa, 495 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 98/443 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-29-31-455.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-29-31-455.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-29-31-455.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-29-31-455.csv Completed graceful shutdown