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/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:15:21,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:15:21,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:15:21,605 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:15:21,605 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:15:21,606 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:15:21,607 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:15:21,609 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:15:21,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:15:21,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:15:21,613 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:15:21,613 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:15:21,614 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:15:21,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:15:21,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:15:21,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:15:21,620 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:15:21,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:15:21,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:15:21,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:15:21,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:15:21,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:15:21,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:15:21,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:15:21,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:15:21,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:15:21,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:15:21,631 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:15:21,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:15:21,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:15:21,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:15:21,632 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:15:21,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:15:21,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:15:21,643 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:15:21,643 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:15:21,644 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:15:21,644 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:15:21,644 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:15:21,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:15:21,645 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:15:21,645 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:15:21,645 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:15:21,645 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:15:21,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:15:21,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:15:21,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:15:21,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:15:21,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:15:21,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:15:21,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:15:21,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:15:21,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:15:21,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:15:21,648 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:15:21,648 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:15:21,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:15:21,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:15:21,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:15:21,649 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:15:21,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:15:21,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:15:21,649 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:15:21,649 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:15:21,650 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:15:21,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:15:21,650 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:15:21,651 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:15:21,651 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:15:21,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:15:21,698 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:15:21,702 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:15:21,704 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:15:21,704 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:15:21,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-20 22:15:21,841 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:15:21,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:15:21,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:15:21,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:15:21,852 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:15:21,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:15:21" (1/1) ... [2018-01-20 22:15:21,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5274b3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:21, skipping insertion in model container [2018-01-20 22:15:21,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:15:21" (1/1) ... [2018-01-20 22:15:21,873 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:15:21,890 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:15:21,998 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:15:22,017 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:15:22,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22 WrapperNode [2018-01-20 22:15:22,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:15:22,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:15:22,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:15:22,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:15:22,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22" (1/1) ... [2018-01-20 22:15:22,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22" (1/1) ... [2018-01-20 22:15:22,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22" (1/1) ... [2018-01-20 22:15:22,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22" (1/1) ... [2018-01-20 22:15:22,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22" (1/1) ... [2018-01-20 22:15:22,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22" (1/1) ... [2018-01-20 22:15:22,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22" (1/1) ... [2018-01-20 22:15:22,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:15:22,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:15:22,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:15:22,059 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:15:22,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:15:22,110 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:15:22,111 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:15:22,111 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-01-20 22:15:22,111 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-20 22:15:22,111 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:15:22,111 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:15:22,111 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:15:22,112 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:15:22,112 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:15:22,112 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:15:22,112 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-01-20 22:15:22,112 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-20 22:15:22,112 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:15:22,113 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:15:22,113 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:15:22,367 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:15:22,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:15:22 BoogieIcfgContainer [2018-01-20 22:15:22,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:15:22,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:15:22,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:15:22,371 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:15:22,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:15:21" (1/3) ... [2018-01-20 22:15:22,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8a3546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:15:22, skipping insertion in model container [2018-01-20 22:15:22,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:15:22" (2/3) ... [2018-01-20 22:15:22,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8a3546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:15:22, skipping insertion in model container [2018-01-20 22:15:22,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:15:22" (3/3) ... [2018-01-20 22:15:22,373 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-20 22:15:22,379 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:15:22,385 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-20 22:15:22,418 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:15:22,419 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:15:22,419 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:15:22,419 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:15:22,419 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:15:22,419 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:15:22,419 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:15:22,419 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == barErr0EnsuresViolation======== [2018-01-20 22:15:22,420 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:15:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 22:15:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 22:15:22,447 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:22,448 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] [2018-01-20 22:15:22,449 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr0EnsuresViolation]=== [2018-01-20 22:15:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash -492377012, now seen corresponding path program 1 times [2018-01-20 22:15:22,456 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:22,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:22,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:22,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:22,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:22,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:15:22,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:15:22,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:15:22,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:15:22,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:15:22,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:15:22,623 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-20 22:15:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:22,650 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-01-20 22:15:22,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:15:22,651 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 22:15:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:22,656 INFO L225 Difference]: With dead ends: 114 [2018-01-20 22:15:22,657 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:15:22,661 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:15:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:15:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:15:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:15:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:15:22,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-20 22:15:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:22,684 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:15:22,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:15:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:15:22,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:15:22,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:15:22,790 INFO L404 ceAbstractionStarter]: At program point L13'''(lines 13 15) the Hoare annotation is: true [2018-01-20 22:15:22,790 INFO L401 ceAbstractionStarter]: For program point barErr0EnsuresViolation(lines 11 17) no Hoare annotation was computed. [2018-01-20 22:15:22,790 INFO L401 ceAbstractionStarter]: For program point L13''(lines 13 15) no Hoare annotation was computed. [2018-01-20 22:15:22,790 INFO L401 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-20 22:15:22,790 INFO L401 ceAbstractionStarter]: For program point L13(lines 13 15) no Hoare annotation was computed. [2018-01-20 22:15:22,791 INFO L404 ceAbstractionStarter]: At program point barENTRY(lines 11 17) the Hoare annotation is: true [2018-01-20 22:15:22,791 INFO L401 ceAbstractionStarter]: For program point L13''''(lines 13 15) no Hoare annotation was computed. [2018-01-20 22:15:22,791 INFO L401 ceAbstractionStarter]: For program point barFINAL(lines 11 17) no Hoare annotation was computed. [2018-01-20 22:15:22,791 INFO L401 ceAbstractionStarter]: For program point L14'(line 14) no Hoare annotation was computed. [2018-01-20 22:15:22,791 INFO L401 ceAbstractionStarter]: For program point barEXIT(lines 11 17) no Hoare annotation was computed. [2018-01-20 22:15:22,791 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 43) no Hoare annotation was computed. [2018-01-20 22:15:22,792 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 43) no Hoare annotation was computed. [2018-01-20 22:15:22,792 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 43) the Hoare annotation is: true [2018-01-20 22:15:22,792 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 43) no Hoare annotation was computed. [2018-01-20 22:15:22,792 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 20 29) no Hoare annotation was computed. [2018-01-20 22:15:22,792 INFO L401 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-20 22:15:22,792 INFO L401 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-20 22:15:22,792 INFO L401 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-20 22:15:22,793 INFO L401 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-20 22:15:22,793 INFO L401 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-20 22:15:22,793 INFO L401 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-20 22:15:22,793 INFO L401 ceAbstractionStarter]: For program point L25'(lines 25 27) no Hoare annotation was computed. [2018-01-20 22:15:22,793 INFO L401 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-20 22:15:22,793 INFO L401 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-20 22:15:22,793 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 20 29) no Hoare annotation was computed. [2018-01-20 22:15:22,794 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 20 29) the Hoare annotation is: true [2018-01-20 22:15:22,794 INFO L401 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-20 22:15:22,794 INFO L401 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-20 22:15:22,794 INFO L401 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-20 22:15:22,794 INFO L404 ceAbstractionStarter]: At program point L22''''(lines 22 24) the Hoare annotation is: true [2018-01-20 22:15:22,794 INFO L404 ceAbstractionStarter]: At program point L22'''(lines 22 24) the Hoare annotation is: true [2018-01-20 22:15:22,794 INFO L401 ceAbstractionStarter]: For program point fooErr0EnsuresViolation(lines 20 29) no Hoare annotation was computed. [2018-01-20 22:15:22,795 INFO L401 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-20 22:15:22,795 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 43) the Hoare annotation is: true [2018-01-20 22:15:22,795 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-01-20 22:15:22,795 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 43) the Hoare annotation is: true [2018-01-20 22:15:22,795 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 43) no Hoare annotation was computed. [2018-01-20 22:15:22,795 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-01-20 22:15:22,796 INFO L404 ceAbstractionStarter]: At program point L36''(lines 36 40) the Hoare annotation is: true [2018-01-20 22:15:22,796 INFO L401 ceAbstractionStarter]: For program point L33''(lines 33 35) no Hoare annotation was computed. [2018-01-20 22:15:22,796 INFO L401 ceAbstractionStarter]: For program point L34''(line 34) no Hoare annotation was computed. [2018-01-20 22:15:22,796 INFO L404 ceAbstractionStarter]: At program point L33'''(lines 33 35) the Hoare annotation is: true [2018-01-20 22:15:22,796 INFO L401 ceAbstractionStarter]: For program point L32''(line 32) no Hoare annotation was computed. [2018-01-20 22:15:22,796 INFO L401 ceAbstractionStarter]: For program point L37'(line 37) no Hoare annotation was computed. [2018-01-20 22:15:22,796 INFO L401 ceAbstractionStarter]: For program point L32''''(line 32) no Hoare annotation was computed. [2018-01-20 22:15:22,797 INFO L401 ceAbstractionStarter]: For program point L32'''''(line 32) no Hoare annotation was computed. [2018-01-20 22:15:22,797 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 31 42) no Hoare annotation was computed. [2018-01-20 22:15:22,797 INFO L401 ceAbstractionStarter]: For program point L36'''(lines 36 40) no Hoare annotation was computed. [2018-01-20 22:15:22,797 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 31 42) no Hoare annotation was computed. [2018-01-20 22:15:22,797 INFO L401 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-01-20 22:15:22,797 INFO L401 ceAbstractionStarter]: For program point L32'''(line 32) no Hoare annotation was computed. [2018-01-20 22:15:22,798 INFO L404 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: true [2018-01-20 22:15:22,798 INFO L401 ceAbstractionStarter]: For program point L33(lines 33 35) no Hoare annotation was computed. [2018-01-20 22:15:22,798 INFO L401 ceAbstractionStarter]: For program point L34'''(line 34) no Hoare annotation was computed. [2018-01-20 22:15:22,798 INFO L401 ceAbstractionStarter]: For program point L33''''(lines 33 35) no Hoare annotation was computed. [2018-01-20 22:15:22,798 INFO L401 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-01-20 22:15:22,798 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 31 42) no Hoare annotation was computed. [2018-01-20 22:15:22,798 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 31 42) the Hoare annotation is: true [2018-01-20 22:15:22,799 INFO L401 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2018-01-20 22:15:22,799 INFO L401 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-01-20 22:15:22,799 INFO L401 ceAbstractionStarter]: For program point L34'(line 34) no Hoare annotation was computed. [2018-01-20 22:15:22,799 INFO L401 ceAbstractionStarter]: For program point L32'(line 32) no Hoare annotation was computed. [2018-01-20 22:15:22,803 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:15:22,803 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:15:22,803 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:15:22,803 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:15:22,804 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:15:22,804 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:15:22,804 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:15:22,804 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:15:22,804 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:15:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 22:15:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:15:22,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:22,807 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:15:22,807 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:15:22,807 INFO L82 PathProgramCache]: Analyzing trace with hash 136143, now seen corresponding path program 1 times [2018-01-20 22:15:22,808 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:22,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:22,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:22,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:22,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:15:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:15:22,839 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:15:22,843 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:15:22,847 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:15:22,847 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:15:22,847 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:15:22,847 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:15:22,847 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:15:22,847 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:15:22,847 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:15:22,848 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-20 22:15:22,848 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:15:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 22:15:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 22:15:22,852 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:22,852 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:22,852 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-20 22:15:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1220349549, now seen corresponding path program 1 times [2018-01-20 22:15:22,852 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:22,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:22,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:22,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:22,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:22,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:15:22,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:15:22,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:15:22,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:15:22,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:15:22,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:15:22,896 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-20 22:15:22,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:22,904 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-01-20 22:15:22,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:15:22,905 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-20 22:15:22,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:22,907 INFO L225 Difference]: With dead ends: 114 [2018-01-20 22:15:22,908 INFO L226 Difference]: Without dead ends: 43 [2018-01-20 22:15:22,909 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:15:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-20 22:15:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-20 22:15:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 22:15:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-20 22:15:22,919 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-01-20 22:15:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:22,919 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-20 22:15:22,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:15:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-20 22:15:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 22:15:22,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:22,920 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:22,921 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr0EnsuresViolation]=== [2018-01-20 22:15:22,921 INFO L82 PathProgramCache]: Analyzing trace with hash 390316661, now seen corresponding path program 1 times [2018-01-20 22:15:22,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:22,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:22,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:22,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:22,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:22,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:15:23,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:15:23,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:15:23,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:15:23,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:15:23,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:15:23,071 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-01-20 22:15:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:23,194 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-20 22:15:23,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:15:23,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-20 22:15:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:23,195 INFO L225 Difference]: With dead ends: 43 [2018-01-20 22:15:23,195 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:15:23,196 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:15:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:15:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:15:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:15:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:15:23,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-20 22:15:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:23,197 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:15:23,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:15:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:15:23,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:15:23,200 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:15:23,200 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:15:23,200 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:15:23,200 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:15:23,200 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:15:23,200 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:15:23,200 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:15:23,200 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:15:23,201 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:15:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 22:15:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 22:15:23,203 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:23,204 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:23,204 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:23,204 INFO L82 PathProgramCache]: Analyzing trace with hash -851979775, now seen corresponding path program 1 times [2018-01-20 22:15:23,204 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:23,204 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:23,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:23,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:23,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:23,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:15:23,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:15:23,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:15:23,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:15:23,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:15:23,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:15:23,220 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-20 22:15:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:23,227 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-01-20 22:15:23,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:15:23,228 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-20 22:15:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:23,229 INFO L225 Difference]: With dead ends: 114 [2018-01-20 22:15:23,229 INFO L226 Difference]: Without dead ends: 57 [2018-01-20 22:15:23,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:15:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-20 22:15:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-20 22:15:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-20 22:15:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-01-20 22:15:23,234 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2018-01-20 22:15:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:23,234 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-01-20 22:15:23,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:15:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-01-20 22:15:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 22:15:23,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:23,235 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-20 22:15:23,235 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:23,235 INFO L82 PathProgramCache]: Analyzing trace with hash -178858898, now seen corresponding path program 1 times [2018-01-20 22:15:23,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:23,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:23,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:23,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:23,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:23,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:15:23,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:15:23,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:15:23,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:15:23,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:15:23,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:15:23,264 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 3 states. [2018-01-20 22:15:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:23,286 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-01-20 22:15:23,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:15:23,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-01-20 22:15:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:23,289 INFO L225 Difference]: With dead ends: 76 [2018-01-20 22:15:23,289 INFO L226 Difference]: Without dead ends: 61 [2018-01-20 22:15:23,290 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:15:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-20 22:15:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-01-20 22:15:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-20 22:15:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-20 22:15:23,302 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 19 [2018-01-20 22:15:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:23,302 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-20 22:15:23,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:15:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-20 22:15:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 22:15:23,304 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:23,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:23,304 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:23,305 INFO L82 PathProgramCache]: Analyzing trace with hash -853032378, now seen corresponding path program 1 times [2018-01-20 22:15:23,305 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:23,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:23,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:23,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:23,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:23,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:23,362 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-20 22:15:23,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:23,362 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:23,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:23,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:23,448 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-20 22:15:23,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:23,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-20 22:15:23,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:15:23,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:15:23,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:15:23,481 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-20 22:15:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:23,531 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-01-20 22:15:23,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:15:23,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-20 22:15:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:23,533 INFO L225 Difference]: With dead ends: 80 [2018-01-20 22:15:23,534 INFO L226 Difference]: Without dead ends: 68 [2018-01-20 22:15:23,534 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:15:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-20 22:15:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-01-20 22:15:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-20 22:15:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-20 22:15:23,542 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 46 [2018-01-20 22:15:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:23,542 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-20 22:15:23,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:15:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-20 22:15:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-20 22:15:23,546 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:23,546 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:23,547 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:23,547 INFO L82 PathProgramCache]: Analyzing trace with hash -723838693, now seen corresponding path program 2 times [2018-01-20 22:15:23,547 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:23,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:23,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:23,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:23,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:23,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-20 22:15:23,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:23,649 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:23,655 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:15:23,674 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:23,686 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:23,688 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:23,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-20 22:15:23,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:15:23,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-01-20 22:15:23,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 22:15:23,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 22:15:23,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-20 22:15:23,760 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 10 states. [2018-01-20 22:15:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:24,164 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2018-01-20 22:15:24,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-20 22:15:24,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-01-20 22:15:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:24,167 INFO L225 Difference]: With dead ends: 160 [2018-01-20 22:15:24,168 INFO L226 Difference]: Without dead ends: 114 [2018-01-20 22:15:24,168 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:15:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-20 22:15:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2018-01-20 22:15:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-20 22:15:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-01-20 22:15:24,176 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 71 [2018-01-20 22:15:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:24,176 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-01-20 22:15:24,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 22:15:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-01-20 22:15:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-20 22:15:24,178 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:24,178 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:24,178 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash 830349990, now seen corresponding path program 1 times [2018-01-20 22:15:24,179 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:24,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:24,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:24,179 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:24,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:24,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-20 22:15:24,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:24,320 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:24,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:24,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:15:24,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:15:24,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-01-20 22:15:24,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 22:15:24,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 22:15:24,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-20 22:15:24,532 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 12 states. [2018-01-20 22:15:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:24,820 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2018-01-20 22:15:24,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:15:24,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2018-01-20 22:15:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:24,823 INFO L225 Difference]: With dead ends: 190 [2018-01-20 22:15:24,823 INFO L226 Difference]: Without dead ends: 110 [2018-01-20 22:15:24,825 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-01-20 22:15:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-20 22:15:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2018-01-20 22:15:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-20 22:15:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-01-20 22:15:24,838 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 108 [2018-01-20 22:15:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:24,839 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-01-20 22:15:24,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 22:15:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-01-20 22:15:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-20 22:15:24,843 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:24,843 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:24,843 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:24,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1031334774, now seen corresponding path program 1 times [2018-01-20 22:15:24,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:24,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:24,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:24,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:24,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:24,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-01-20 22:15:25,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:25,064 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:25,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:25,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 174 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-01-20 22:15:25,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:25,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-01-20 22:15:25,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-20 22:15:25,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-20 22:15:25,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:15:25,292 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 14 states. [2018-01-20 22:15:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:25,616 INFO L93 Difference]: Finished difference Result 252 states and 287 transitions. [2018-01-20 22:15:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 22:15:25,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 154 [2018-01-20 22:15:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:25,618 INFO L225 Difference]: With dead ends: 252 [2018-01-20 22:15:25,618 INFO L226 Difference]: Without dead ends: 193 [2018-01-20 22:15:25,619 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-01-20 22:15:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-20 22:15:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 135. [2018-01-20 22:15:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-20 22:15:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2018-01-20 22:15:25,635 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 154 [2018-01-20 22:15:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:25,635 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2018-01-20 22:15:25,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-20 22:15:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2018-01-20 22:15:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-01-20 22:15:25,638 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:25,638 INFO L322 BasicCegarLoop]: trace histogram [12, 9, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:25,638 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1652402302, now seen corresponding path program 2 times [2018-01-20 22:15:25,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:25,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:25,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:25,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:25,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:25,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-01-20 22:15:25,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:25,917 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:25,922 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:15:25,943 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:25,983 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:25,992 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:25,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 382 proven. 2 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-01-20 22:15:26,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:26,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-01-20 22:15:26,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-20 22:15:26,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-20 22:15:26,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-01-20 22:15:26,145 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand 16 states. [2018-01-20 22:15:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:26,422 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2018-01-20 22:15:26,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-20 22:15:26,423 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 208 [2018-01-20 22:15:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:26,424 INFO L225 Difference]: With dead ends: 256 [2018-01-20 22:15:26,424 INFO L226 Difference]: Without dead ends: 158 [2018-01-20 22:15:26,425 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-01-20 22:15:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-20 22:15:26,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2018-01-20 22:15:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-20 22:15:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2018-01-20 22:15:26,440 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 208 [2018-01-20 22:15:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:26,441 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2018-01-20 22:15:26,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-20 22:15:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2018-01-20 22:15:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-20 22:15:26,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:26,445 INFO L322 BasicCegarLoop]: trace histogram [15, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:26,445 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1533664142, now seen corresponding path program 3 times [2018-01-20 22:15:26,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:26,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:26,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:26,446 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:26,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:26,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-01-20 22:15:26,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:26,679 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:26,684 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:15:26,705 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:26,713 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:26,724 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:26,736 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:26,738 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:26,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 205 proven. 10 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2018-01-20 22:15:26,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:26,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-01-20 22:15:26,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-20 22:15:26,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-20 22:15:26,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:15:26,869 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand 14 states. [2018-01-20 22:15:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:27,172 INFO L93 Difference]: Finished difference Result 347 states and 409 transitions. [2018-01-20 22:15:27,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-20 22:15:27,173 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 270 [2018-01-20 22:15:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:27,176 INFO L225 Difference]: With dead ends: 347 [2018-01-20 22:15:27,176 INFO L226 Difference]: Without dead ends: 335 [2018-01-20 22:15:27,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-01-20 22:15:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-20 22:15:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 204. [2018-01-20 22:15:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-20 22:15:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 231 transitions. [2018-01-20 22:15:27,195 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 231 transitions. Word has length 270 [2018-01-20 22:15:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:27,196 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 231 transitions. [2018-01-20 22:15:27,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-20 22:15:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 231 transitions. [2018-01-20 22:15:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-01-20 22:15:27,200 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:27,200 INFO L322 BasicCegarLoop]: trace histogram [22, 18, 15, 15, 15, 15, 15, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:27,200 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1619197343, now seen corresponding path program 4 times [2018-01-20 22:15:27,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:27,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:27,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:27,201 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:27,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:27,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1647 trivial. 0 not checked. [2018-01-20 22:15:27,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:27,501 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:27,506 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:15:27,583 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:27,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 1172 proven. 9 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2018-01-20 22:15:27,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:27,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-01-20 22:15:27,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-20 22:15:27,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-20 22:15:27,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-01-20 22:15:27,823 INFO L87 Difference]: Start difference. First operand 204 states and 231 transitions. Second operand 20 states. [2018-01-20 22:15:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:28,224 INFO L93 Difference]: Finished difference Result 465 states and 577 transitions. [2018-01-20 22:15:28,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-20 22:15:28,225 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 341 [2018-01-20 22:15:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:28,227 INFO L225 Difference]: With dead ends: 465 [2018-01-20 22:15:28,227 INFO L226 Difference]: Without dead ends: 348 [2018-01-20 22:15:28,228 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2018-01-20 22:15:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-20 22:15:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 213. [2018-01-20 22:15:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-20 22:15:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-01-20 22:15:28,248 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 341 [2018-01-20 22:15:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:28,249 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-01-20 22:15:28,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-20 22:15:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-01-20 22:15:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-01-20 22:15:28,252 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:28,252 INFO L322 BasicCegarLoop]: trace histogram [26, 25, 18, 18, 18, 18, 17, 17, 17, 17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:28,252 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:28,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1303612877, now seen corresponding path program 5 times [2018-01-20 22:15:28,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:28,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:28,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:28,253 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:28,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:28,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2857 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2018-01-20 22:15:28,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:28,741 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:28,747 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 22:15:28,778 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:28,793 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:28,812 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:28,829 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:28,849 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:28,895 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:28,898 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:28,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2857 backedges. 1502 proven. 70 refuted. 0 times theorem prover too weak. 1285 trivial. 0 not checked. [2018-01-20 22:15:29,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:29,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-01-20 22:15:29,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-20 22:15:29,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-20 22:15:29,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:15:29,135 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 22 states. [2018-01-20 22:15:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:29,820 INFO L93 Difference]: Finished difference Result 454 states and 532 transitions. [2018-01-20 22:15:29,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 22:15:29,820 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 413 [2018-01-20 22:15:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:29,823 INFO L225 Difference]: With dead ends: 454 [2018-01-20 22:15:29,823 INFO L226 Difference]: Without dead ends: 231 [2018-01-20 22:15:29,825 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2018-01-20 22:15:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-01-20 22:15:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2018-01-20 22:15:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-20 22:15:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2018-01-20 22:15:29,845 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 413 [2018-01-20 22:15:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:29,846 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2018-01-20 22:15:29,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-20 22:15:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2018-01-20 22:15:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-01-20 22:15:29,851 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:29,851 INFO L322 BasicCegarLoop]: trace histogram [30, 30, 21, 21, 21, 21, 21, 21, 21, 21, 21, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:29,851 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:29,852 INFO L82 PathProgramCache]: Analyzing trace with hash -532121145, now seen corresponding path program 6 times [2018-01-20 22:15:29,852 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:29,852 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:29,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:29,853 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:29,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:29,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3984 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 3714 trivial. 0 not checked. [2018-01-20 22:15:30,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:30,377 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:30,382 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 22:15:30,424 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:15:30,428 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:15:30,437 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:15:30,450 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:15:30,466 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:15:30,511 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:15:30,606 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:15:30,947 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:15:30,952 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:30,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:30,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:15:30,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:30,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:30,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:15:31,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-20 22:15:31,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-20 22:15:31,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-01-20 22:15:31,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-01-20 22:15:31,304 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 17 treesize of output 16 [2018-01-20 22:15:31,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:15:31,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11 [2018-01-20 22:15:31,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:15:31,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:15:31,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2018-01-20 22:15:31,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:31,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-01-20 22:15:31,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-20 22:15:31,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:15:31,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-01-20 22:15:31,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:31,685 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 32 treesize of output 31 [2018-01-20 22:15:31,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:31,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:31,698 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 20 treesize of output 35 [2018-01-20 22:15:31,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:15:31,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2018-01-20 22:15:31,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-01-20 22:15:31,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-01-20 22:15:31,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-20 22:15:31,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:31,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:31,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:32,001 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2018-01-20 22:15:32,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:32,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:32,017 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 47 [2018-01-20 22:15:32,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-20 22:15:32,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:15:32,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:15:32,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-01-20 22:15:32,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-01-20 22:15:32,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-20 22:15:32,056 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:32,059 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:32,063 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:32,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-01-20 22:15:32,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:32,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 22 [2018-01-20 22:15:32,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:32,077 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 18 treesize of output 31 [2018-01-20 22:15:32,077 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:32,083 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:32,090 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:32,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-20 22:15:32,108 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:36, output treesize:37 [2018-01-20 22:15:32,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:15:32,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:32,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:15:32,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:55 [2018-01-20 22:15:32,446 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.base| Int)) (and (= (select |c_#valid| |foo_~#a~3.base|) 0) (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (let ((.cse0 (store (select |c_old(#memory_int)| |foo_~#a~3.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (store .cse0 4 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse0) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)))))) (= (let ((.cse1 (select |c_#memory_int| |foo_~#a~3.base|))) (+ (select .cse1 4) (select .cse1 0))) 0))) is different from true [2018-01-20 22:15:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3984 backedges. 1377 proven. 67 refuted. 0 times theorem prover too weak. 2538 trivial. 2 not checked. [2018-01-20 22:15:32,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:32,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 38] total 48 [2018-01-20 22:15:32,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-20 22:15:32,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-20 22:15:32,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1971, Unknown=1, NotChecked=90, Total=2256 [2018-01-20 22:15:32,751 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand 48 states. [2018-01-20 22:15:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:35,926 INFO L93 Difference]: Finished difference Result 413 states and 467 transitions. [2018-01-20 22:15:35,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-20 22:15:35,926 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 477 [2018-01-20 22:15:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:35,929 INFO L225 Difference]: With dead ends: 413 [2018-01-20 22:15:35,929 INFO L226 Difference]: Without dead ends: 291 [2018-01-20 22:15:35,932 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 441 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=521, Invalid=5485, Unknown=4, NotChecked=152, Total=6162 [2018-01-20 22:15:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-20 22:15:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 247. [2018-01-20 22:15:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-20 22:15:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 281 transitions. [2018-01-20 22:15:35,959 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 281 transitions. Word has length 477 [2018-01-20 22:15:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:35,959 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 281 transitions. [2018-01-20 22:15:35,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-20 22:15:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 281 transitions. [2018-01-20 22:15:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-01-20 22:15:35,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:35,962 INFO L322 BasicCegarLoop]: trace histogram [34, 34, 24, 24, 24, 24, 24, 24, 24, 24, 24, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:35,962 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:35,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1036125280, now seen corresponding path program 1 times [2018-01-20 22:15:35,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:35,963 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:35,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:35,964 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:35,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:36,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 4788 trivial. 0 not checked. [2018-01-20 22:15:36,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:36,537 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:36,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:36,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 2826 proven. 24 refuted. 0 times theorem prover too weak. 2273 trivial. 0 not checked. [2018-01-20 22:15:37,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:37,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-20 22:15:37,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-20 22:15:37,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-20 22:15:37,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2018-01-20 22:15:37,009 INFO L87 Difference]: Start difference. First operand 247 states and 281 transitions. Second operand 24 states. [2018-01-20 22:15:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:37,555 INFO L93 Difference]: Finished difference Result 504 states and 581 transitions. [2018-01-20 22:15:37,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-20 22:15:37,555 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 535 [2018-01-20 22:15:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:37,558 INFO L225 Difference]: With dead ends: 504 [2018-01-20 22:15:37,558 INFO L226 Difference]: Without dead ends: 389 [2018-01-20 22:15:37,559 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 22:15:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-20 22:15:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 292. [2018-01-20 22:15:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-20 22:15:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 330 transitions. [2018-01-20 22:15:37,583 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 330 transitions. Word has length 535 [2018-01-20 22:15:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:37,583 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 330 transitions. [2018-01-20 22:15:37,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-20 22:15:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 330 transitions. [2018-01-20 22:15:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-01-20 22:15:37,586 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:37,587 INFO L322 BasicCegarLoop]: trace histogram [45, 38, 34, 34, 34, 34, 34, 27, 27, 27, 27, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:37,587 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1422391620, now seen corresponding path program 2 times [2018-01-20 22:15:37,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:37,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:37,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:37,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:37,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:37,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7840 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 7433 trivial. 0 not checked. [2018-01-20 22:15:38,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:38,338 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:38,345 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:15:38,383 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:38,486 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:38,511 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:38,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7840 backedges. 4068 proven. 21 refuted. 0 times theorem prover too weak. 3751 trivial. 0 not checked. [2018-01-20 22:15:38,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:38,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-01-20 22:15:38,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-20 22:15:38,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-20 22:15:38,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-01-20 22:15:38,982 INFO L87 Difference]: Start difference. First operand 292 states and 330 transitions. Second operand 26 states. [2018-01-20 22:15:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:39,894 INFO L93 Difference]: Finished difference Result 469 states and 539 transitions. [2018-01-20 22:15:39,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 22:15:39,895 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 635 [2018-01-20 22:15:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:39,897 INFO L225 Difference]: With dead ends: 469 [2018-01-20 22:15:39,897 INFO L226 Difference]: Without dead ends: 315 [2018-01-20 22:15:39,899 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=1393, Unknown=0, NotChecked=0, Total=1722 [2018-01-20 22:15:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-01-20 22:15:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 307. [2018-01-20 22:15:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-01-20 22:15:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 351 transitions. [2018-01-20 22:15:39,931 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 351 transitions. Word has length 635 [2018-01-20 22:15:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:39,932 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 351 transitions. [2018-01-20 22:15:39,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-20 22:15:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 351 transitions. [2018-01-20 22:15:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-01-20 22:15:39,941 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:39,941 INFO L322 BasicCegarLoop]: trace histogram [50, 50, 38, 38, 38, 38, 38, 38, 38, 38, 38, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:39,941 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2002889800, now seen corresponding path program 3 times [2018-01-20 22:15:39,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:39,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:39,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:39,943 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:39,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:40,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11209 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 10723 trivial. 0 not checked. [2018-01-20 22:15:40,846 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:40,846 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:40,851 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:15:40,890 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:40,896 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:40,903 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:40,912 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:40,941 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:40,987 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:15:40,990 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:41,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11209 backedges. 2034 proven. 44 refuted. 0 times theorem prover too weak. 9131 trivial. 0 not checked. [2018-01-20 22:15:41,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:41,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-01-20 22:15:41,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-20 22:15:41,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-20 22:15:41,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2018-01-20 22:15:41,543 INFO L87 Difference]: Start difference. First operand 307 states and 351 transitions. Second operand 27 states. [2018-01-20 22:15:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:42,515 INFO L93 Difference]: Finished difference Result 700 states and 849 transitions. [2018-01-20 22:15:42,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-20 22:15:42,515 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 739 [2018-01-20 22:15:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:42,522 INFO L225 Difference]: With dead ends: 700 [2018-01-20 22:15:42,522 INFO L226 Difference]: Without dead ends: 688 [2018-01-20 22:15:42,523 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 22:15:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-01-20 22:15:42,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 358. [2018-01-20 22:15:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-20 22:15:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 414 transitions. [2018-01-20 22:15:42,569 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 414 transitions. Word has length 739 [2018-01-20 22:15:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:42,571 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 414 transitions. [2018-01-20 22:15:42,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-20 22:15:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 414 transitions. [2018-01-20 22:15:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2018-01-20 22:15:42,580 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:42,580 INFO L322 BasicCegarLoop]: trace histogram [63, 55, 50, 50, 50, 50, 50, 42, 42, 42, 42, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:42,580 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash 270789449, now seen corresponding path program 4 times [2018-01-20 22:15:42,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:42,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:42,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:42,582 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:42,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:42,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15999 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 15427 trivial. 0 not checked. [2018-01-20 22:15:43,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:43,725 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:43,730 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:15:43,883 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:43,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15999 backedges. 8105 proven. 38 refuted. 0 times theorem prover too weak. 7856 trivial. 0 not checked. [2018-01-20 22:15:44,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:44,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-01-20 22:15:44,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-20 22:15:44,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-20 22:15:44,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-01-20 22:15:44,405 INFO L87 Difference]: Start difference. First operand 358 states and 414 transitions. Second operand 30 states. [2018-01-20 22:15:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:45,128 INFO L93 Difference]: Finished difference Result 901 states and 1181 transitions. [2018-01-20 22:15:45,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-20 22:15:45,129 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 856 [2018-01-20 22:15:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:45,135 INFO L225 Difference]: With dead ends: 901 [2018-01-20 22:15:45,135 INFO L226 Difference]: Without dead ends: 728 [2018-01-20 22:15:45,138 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 843 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=439, Invalid=1913, Unknown=0, NotChecked=0, Total=2352 [2018-01-20 22:15:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-01-20 22:15:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 382. [2018-01-20 22:15:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-01-20 22:15:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 449 transitions. [2018-01-20 22:15:45,206 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 449 transitions. Word has length 856 [2018-01-20 22:15:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:45,207 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 449 transitions. [2018-01-20 22:15:45,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-20 22:15:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 449 transitions. [2018-01-20 22:15:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2018-01-20 22:15:45,218 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:45,218 INFO L322 BasicCegarLoop]: trace histogram [69, 68, 55, 55, 55, 55, 54, 54, 54, 54, 54, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:45,218 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:45,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1393414499, now seen corresponding path program 5 times [2018-01-20 22:15:45,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:45,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:45,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:45,220 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:45,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:45,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 21340 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 20675 trivial. 0 not checked. [2018-01-20 22:15:46,596 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:46,596 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:46,606 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 22:15:46,662 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:46,673 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:46,749 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:46,975 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:47,413 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:15:47,440 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:15:47,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:47,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-20 22:15:47,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-20 22:15:47,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:47,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:47,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:47,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:1 [2018-01-20 22:15:47,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-01-20 22:15:47,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-20 22:15:47,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:47,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 12 treesize of output 11 [2018-01-20 22:15:47,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:47,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:47,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:15:47,774 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11 [2018-01-20 22:15:47,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-01-20 22:15:47,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-20 22:15:47,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:47,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:47,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:15:47,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-20 22:15:48,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2018-01-20 22:15:48,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:48,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-01-20 22:15:48,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:48,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:48,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 49 [2018-01-20 22:15:48,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:15:48,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:15:48,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:15:48,079 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:71 [2018-01-20 22:15:48,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-01-20 22:15:48,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-01-20 22:15:48,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-20 22:15:48,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:48,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:48,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:48,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:48,522 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2018-01-20 22:15:48,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:48,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:48,533 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 47 [2018-01-20 22:15:48,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-20 22:15:48,549 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:15:48,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:15:48,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-01-20 22:15:48,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-01-20 22:15:48,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-20 22:15:48,571 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:48,574 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:48,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:48,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-01-20 22:15:48,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:48,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 22 [2018-01-20 22:15:48,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:48,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 18 treesize of output 31 [2018-01-20 22:15:48,586 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:48,590 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:48,594 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:48,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-20 22:15:48,607 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:36, output treesize:37 [2018-01-20 22:15:49,165 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 84 DAG size of output 69 [2018-01-20 22:15:49,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 91 [2018-01-20 22:15:49,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-01-20 22:15:49,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,175 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 39 treesize of output 47 [2018-01-20 22:15:49,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,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, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 88 [2018-01-20 22:15:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-01-20 22:15:49,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,259 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 39 [2018-01-20 22:15:49,259 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,271 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 [2018-01-20 22:15:49,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,308 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 39 [2018-01-20 22:15:49,308 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,320 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 99 [2018-01-20 22:15:49,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,381 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:15:49,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 130 [2018-01-20 22:15:49,394 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 78 [2018-01-20 22:15:49,394 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-20 22:15:49,429 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:15:49,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 77 [2018-01-20 22:15:49,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,566 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 39 [2018-01-20 22:15:49,566 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,579 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,640 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:15:49,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 114 [2018-01-20 22:15:49,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 70 [2018-01-20 22:15:49,657 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-20 22:15:49,687 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:15:49,762 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:15:49,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-20 22:15:49,810 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:181, output treesize:205 [2018-01-20 22:15:49,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 76 [2018-01-20 22:15:49,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,945 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:15:49,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,948 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 163 [2018-01-20 22:15:49,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:49,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:49,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,001 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:15:50,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 180 [2018-01-20 22:15:50,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:15:50,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:15:50,121 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 68 treesize of output 51 [2018-01-20 22:15:50,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 163 [2018-01-20 22:15:50,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:50,151 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:50,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-20 22:15:50,185 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:145, output treesize:168 [2018-01-20 22:15:50,759 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 49 DAG size of output 42 [2018-01-20 22:15:50,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-01-20 22:15:50,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2018-01-20 22:15:50,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:50,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-01-20 22:15:50,794 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 22:15:50,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:50,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 71 [2018-01-20 22:15:50,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,816 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:15:50,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2018-01-20 22:15:50,820 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:50,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:50,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 89 [2018-01-20 22:15:50,890 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-01-20 22:15:50,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:15:50,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:15:50,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:15:51,000 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 38 treesize of output 35 [2018-01-20 22:15:51,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-01-20 22:15:51,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-01-20 22:15:51,009 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 35 treesize of output 38 [2018-01-20 22:15:51,010 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,014 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,018 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,024 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2018-01-20 22:15:51,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-01-20 22:15:51,075 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-01-20 22:15:51,110 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 22:15:51,110 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:51,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:51,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:51,119 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:15:51,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2018-01-20 22:15:51,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:51,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:51,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:51,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:15:51,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-01-20 22:15:51,128 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,138 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,142 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,148 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-01-20 22:15:51,176 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:78, output treesize:111 [2018-01-20 22:15:51,523 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.base| Int)) (and (= |c_foo_#t~ret5| (let ((.cse0 (select |c_#memory_int| |foo_~#a~3.base|))) (+ (select .cse0 4) (select .cse0 8) (select .cse0 0)))) (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (let ((.cse1 (let ((.cse2 (store (select |c_old(#memory_int)| |foo_~#a~3.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (store .cse2 4 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse2) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)))))) (store .cse1 8 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse1) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 8)))))))) is different from true [2018-01-20 22:15:51,527 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.base| Int)) (and (= 0 (let ((.cse0 (select |c_#memory_int| |foo_~#a~3.base|))) (+ (select .cse0 4) (select .cse0 8) (select .cse0 0)))) (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (let ((.cse1 (let ((.cse2 (store (select |c_old(#memory_int)| |foo_~#a~3.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (store .cse2 4 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse2) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)))))) (store .cse1 8 (select (select (store |c_old(#memory_int)| |foo_~#a~3.base| .cse1) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 8)))))))) is different from true [2018-01-20 22:15:51,550 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-20 22:15:51,550 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:747, output treesize:1 [2018-01-20 22:15:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 21340 backedges. 5284 proven. 236 refuted. 0 times theorem prover too weak. 15810 trivial. 10 not checked. [2018-01-20 22:15:52,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:52,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 52] total 67 [2018-01-20 22:15:52,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-01-20 22:15:52,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-01-20 22:15:52,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3829, Unknown=2, NotChecked=254, Total=4422 [2018-01-20 22:15:52,390 INFO L87 Difference]: Start difference. First operand 382 states and 449 transitions. Second operand 67 states. [2018-01-20 22:15:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:15:57,260 INFO L93 Difference]: Finished difference Result 1071 states and 1292 transitions. [2018-01-20 22:15:57,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-01-20 22:15:57,260 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 970 [2018-01-20 22:15:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:15:57,264 INFO L225 Difference]: With dead ends: 1071 [2018-01-20 22:15:57,264 INFO L226 Difference]: Without dead ends: 846 [2018-01-20 22:15:57,269 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 918 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=528, Invalid=7850, Unknown=2, NotChecked=362, Total=8742 [2018-01-20 22:15:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-01-20 22:15:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 420. [2018-01-20 22:15:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-01-20 22:15:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 497 transitions. [2018-01-20 22:15:57,344 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 497 transitions. Word has length 970 [2018-01-20 22:15:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:15:57,345 INFO L432 AbstractCegarLoop]: Abstraction has 420 states and 497 transitions. [2018-01-20 22:15:57,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-01-20 22:15:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 497 transitions. [2018-01-20 22:15:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1050 [2018-01-20 22:15:57,358 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:15:57,359 INFO L322 BasicCegarLoop]: trace histogram [76, 73, 61, 61, 61, 61, 58, 58, 58, 58, 58, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:15:57,359 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:15:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash -760958465, now seen corresponding path program 7 times [2018-01-20 22:15:57,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:15:57,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:15:57,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:57,360 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:15:57,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:15:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:57,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:15:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 25293 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 24528 trivial. 0 not checked. [2018-01-20 22:15:59,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:15:59,026 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:15:59,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:15:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:15:59,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:15:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 25293 backedges. 2104 proven. 10 refuted. 0 times theorem prover too weak. 23179 trivial. 0 not checked. [2018-01-20 22:15:59,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:15:59,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 24 [2018-01-20 22:15:59,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-20 22:15:59,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-20 22:15:59,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-01-20 22:15:59,904 INFO L87 Difference]: Start difference. First operand 420 states and 497 transitions. Second operand 24 states. [2018-01-20 22:16:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:16:00,279 INFO L93 Difference]: Finished difference Result 1181 states and 1419 transitions. [2018-01-20 22:16:00,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-20 22:16:00,280 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1049 [2018-01-20 22:16:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:16:00,283 INFO L225 Difference]: With dead ends: 1181 [2018-01-20 22:16:00,283 INFO L226 Difference]: Without dead ends: 770 [2018-01-20 22:16:00,285 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1069 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2018-01-20 22:16:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-01-20 22:16:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 427. [2018-01-20 22:16:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-01-20 22:16:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 494 transitions. [2018-01-20 22:16:00,332 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 494 transitions. Word has length 1049 [2018-01-20 22:16:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:16:00,333 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 494 transitions. [2018-01-20 22:16:00,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-20 22:16:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 494 transitions. [2018-01-20 22:16:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2018-01-20 22:16:00,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:16:00,342 INFO L322 BasicCegarLoop]: trace histogram [81, 78, 65, 65, 65, 65, 62, 62, 62, 62, 62, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:16:00,343 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:16:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash 666200866, now seen corresponding path program 6 times [2018-01-20 22:16:00,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:16:00,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:16:00,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:16:00,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:16:00,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:16:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:16:00,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:16:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 28786 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 27914 trivial. 0 not checked. [2018-01-20 22:16:01,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:16:01,913 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:16:01,920 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 22:16:01,979 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:16:01,985 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:16:01,994 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:16:02,008 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:16:02,112 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:16:02,206 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:16:02,731 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:16:03,888 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:16:05,789 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command Received shutdown request... [2018-01-20 22:16:09,592 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command Cannot interrupt operation gracefully because timeout expired. Forcing shutdown