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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:09:49,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:09:49,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:09:49,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:09:49,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:09:49,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:09:49,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:09:49,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:09:49,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:09:49,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:09:49,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:09:49,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:09:49,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:09:49,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:09:49,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:09:49,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:09:49,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:09:49,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:09:49,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:09:49,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:09:49,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:09:49,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:09:49,418 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:09:49,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:09:49,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:09:49,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:09:49,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:09:49,422 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:09:49,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:09:49,423 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:09:49,423 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:09:49,424 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-21 10:09:49,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:09:49,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:09:49,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:09:49,433 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:09:49,433 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:09:49,433 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:09:49,433 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:09:49,434 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:09:49,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:09:49,434 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:09:49,434 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:09:49,434 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:09:49,434 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:09:49,435 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:09:49,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:09:49,435 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:09:49,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:09:49,435 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:09:49,435 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:09:49,435 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:09:49,435 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:09:49,436 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:09:49,436 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:09:49,436 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:09:49,436 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:09:49,437 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:09:49,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:09:49,437 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:09:49,437 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:09:49,437 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:09:49,437 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:09:49,437 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:09:49,437 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:09:49,438 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:09:49,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:09:49,438 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:09:49,438 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:09:49,439 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:09:49,439 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:09:49,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:09:49,482 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:09:49,486 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:09:49,487 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:09:49,488 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:09:49,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i [2018-01-21 10:09:49,654 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:09:49,658 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:09:49,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:09:49,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:09:49,666 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:09:49,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3adf5c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49, skipping insertion in model container [2018-01-21 10:09:49,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,684 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:09:49,721 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:09:49,844 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:09:49,866 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:09:49,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49 WrapperNode [2018-01-21 10:09:49,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:09:49,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:09:49,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:09:49,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:09:49,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:09:49,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:09:49,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:09:49,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:09:49,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (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-21 10:09:49,955 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:09:49,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:09:49,956 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum [2018-01-21 10:09:49,956 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum2 [2018-01-21 10:09:49,956 INFO L136 BoogieDeclarations]: Found implementation of procedure dummy_abort [2018-01-21 10:09:49,956 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:09:49,956 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:09:49,956 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:09:49,957 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:09:49,957 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:09:49,957 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:09:49,957 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-21 10:09:49,957 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-21 10:09:49,957 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-21 10:09:49,958 INFO L128 BoogieDeclarations]: Found specification of procedure Sum [2018-01-21 10:09:49,958 INFO L128 BoogieDeclarations]: Found specification of procedure Sum2 [2018-01-21 10:09:49,958 INFO L128 BoogieDeclarations]: Found specification of procedure dummy_abort [2018-01-21 10:09:49,958 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:09:49,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:09:49,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:09:50,181 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:09:50,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:09:50 BoogieIcfgContainer [2018-01-21 10:09:50,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:09:50,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:09:50,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:09:50,185 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:09:50,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:09:49" (1/3) ... [2018-01-21 10:09:50,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f68a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:09:50, skipping insertion in model container [2018-01-21 10:09:50,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (2/3) ... [2018-01-21 10:09:50,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f68a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:09:50, skipping insertion in model container [2018-01-21 10:09:50,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:09:50" (3/3) ... [2018-01-21 10:09:50,188 INFO L105 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i [2018-01-21 10:09:50,195 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:09:50,201 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 10:09:50,250 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:09:50,250 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:09:50,250 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:09:50,250 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:09:50,250 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:09:50,251 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:09:50,251 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:09:50,251 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Sum2Err0EnsuresViolation======== [2018-01-21 10:09:50,252 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:09:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 10:09:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:09:50,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:50,279 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:50,280 INFO L371 AbstractCegarLoop]: === Iteration 1 === [Sum2Err0EnsuresViolation]=== [2018-01-21 10:09:50,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1865297126, now seen corresponding path program 1 times [2018-01-21 10:09:50,287 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:50,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:50,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,331 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:50,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:50,453 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-21 10:09:50,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:50,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:09:50,456 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:50,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:09:50,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:09:50,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:09:50,472 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 10:09:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:50,572 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 10:09:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:09:50,574 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-01-21 10:09:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:50,579 INFO L225 Difference]: With dead ends: 88 [2018-01-21 10:09:50,580 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:09:50,583 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-21 10:09:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:09:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:09:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:09:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:09:50,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-21 10:09:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:50,604 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:09:50,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:09:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:09:50,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:09:50,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 10:09:50,660 INFO L401 ceAbstractionStarter]: For program point Sum2FINAL(lines 658 666) no Hoare annotation was computed. [2018-01-21 10:09:50,660 INFO L401 ceAbstractionStarter]: For program point Sum2Err0EnsuresViolation(line 657) no Hoare annotation was computed. [2018-01-21 10:09:50,660 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-21 10:09:50,661 INFO L404 ceAbstractionStarter]: At program point L662''''(lines 662 664) the Hoare annotation is: true [2018-01-21 10:09:50,661 INFO L401 ceAbstractionStarter]: For program point L662(line 662) no Hoare annotation was computed. [2018-01-21 10:09:50,661 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-21 10:09:50,661 INFO L401 ceAbstractionStarter]: For program point L662'(line 662) no Hoare annotation was computed. [2018-01-21 10:09:50,661 INFO L401 ceAbstractionStarter]: For program point L662'''''(lines 662 664) no Hoare annotation was computed. [2018-01-21 10:09:50,661 INFO L401 ceAbstractionStarter]: For program point L662'''(lines 662 664) no Hoare annotation was computed. [2018-01-21 10:09:50,662 INFO L404 ceAbstractionStarter]: At program point Sum2ENTRY(lines 658 666) the Hoare annotation is: true [2018-01-21 10:09:50,662 INFO L401 ceAbstractionStarter]: For program point Sum2EXIT(lines 658 666) no Hoare annotation was computed. [2018-01-21 10:09:50,662 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 686) no Hoare annotation was computed. [2018-01-21 10:09:50,662 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 686) no Hoare annotation was computed. [2018-01-21 10:09:50,662 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 686) the Hoare annotation is: true [2018-01-21 10:09:50,662 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 686) no Hoare annotation was computed. [2018-01-21 10:09:50,663 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-21 10:09:50,663 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-21 10:09:50,663 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-21 10:09:50,663 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-21 10:09:50,663 INFO L404 ceAbstractionStarter]: At program point dummy_abortFINAL(lines 667 669) the Hoare annotation is: true [2018-01-21 10:09:50,663 INFO L401 ceAbstractionStarter]: For program point dummy_abortEXIT(lines 667 669) no Hoare annotation was computed. [2018-01-21 10:09:50,664 INFO L401 ceAbstractionStarter]: For program point dummy_abortErr0EnsuresViolation(lines 667 669) no Hoare annotation was computed. [2018-01-21 10:09:50,664 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 686) the Hoare annotation is: true [2018-01-21 10:09:50,664 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 686) no Hoare annotation was computed. [2018-01-21 10:09:50,664 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 686) the Hoare annotation is: true [2018-01-21 10:09:50,664 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 686) no Hoare annotation was computed. [2018-01-21 10:09:50,664 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 686) no Hoare annotation was computed. [2018-01-21 10:09:50,665 INFO L401 ceAbstractionStarter]: For program point L652'''(lines 652 654) no Hoare annotation was computed. [2018-01-21 10:09:50,665 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-21 10:09:50,665 INFO L401 ceAbstractionStarter]: For program point L652'''''(lines 652 654) no Hoare annotation was computed. [2018-01-21 10:09:50,665 INFO L401 ceAbstractionStarter]: For program point SumEXIT(lines 648 656) no Hoare annotation was computed. [2018-01-21 10:09:50,665 INFO L401 ceAbstractionStarter]: For program point L652'(line 652) no Hoare annotation was computed. [2018-01-21 10:09:50,665 INFO L404 ceAbstractionStarter]: At program point L652''''(lines 652 654) the Hoare annotation is: true [2018-01-21 10:09:50,665 INFO L401 ceAbstractionStarter]: For program point L653(line 653) no Hoare annotation was computed. [2018-01-21 10:09:50,666 INFO L404 ceAbstractionStarter]: At program point SumENTRY(lines 648 656) the Hoare annotation is: true [2018-01-21 10:09:50,666 INFO L401 ceAbstractionStarter]: For program point SumErr0EnsuresViolation(line 647) no Hoare annotation was computed. [2018-01-21 10:09:50,666 INFO L401 ceAbstractionStarter]: For program point L653'(line 653) no Hoare annotation was computed. [2018-01-21 10:09:50,666 INFO L401 ceAbstractionStarter]: For program point SumFINAL(lines 648 656) no Hoare annotation was computed. [2018-01-21 10:09:50,666 INFO L404 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: true [2018-01-21 10:09:50,666 INFO L401 ceAbstractionStarter]: For program point L680(line 680) no Hoare annotation was computed. [2018-01-21 10:09:50,667 INFO L404 ceAbstractionStarter]: At program point L683(line 683) the Hoare annotation is: true [2018-01-21 10:09:50,667 INFO L401 ceAbstractionStarter]: For program point L682(line 682) no Hoare annotation was computed. [2018-01-21 10:09:50,667 INFO L401 ceAbstractionStarter]: For program point L682''(lines 682 683) no Hoare annotation was computed. [2018-01-21 10:09:50,667 INFO L401 ceAbstractionStarter]: For program point L672'(line 672) no Hoare annotation was computed. [2018-01-21 10:09:50,667 INFO L401 ceAbstractionStarter]: For program point L682'(lines 682 683) no Hoare annotation was computed. [2018-01-21 10:09:50,667 INFO L404 ceAbstractionStarter]: At program point L680'(lines 680 681) the Hoare annotation is: true [2018-01-21 10:09:50,668 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 670 686) no Hoare annotation was computed. [2018-01-21 10:09:50,668 INFO L401 ceAbstractionStarter]: For program point L674(line 674) no Hoare annotation was computed. [2018-01-21 10:09:50,668 INFO L401 ceAbstractionStarter]: For program point L673(line 673) no Hoare annotation was computed. [2018-01-21 10:09:50,668 INFO L404 ceAbstractionStarter]: At program point L672(line 672) the Hoare annotation is: true [2018-01-21 10:09:50,668 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-21 10:09:50,668 INFO L401 ceAbstractionStarter]: For program point L678(line 678) no Hoare annotation was computed. [2018-01-21 10:09:50,669 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 670 686) no Hoare annotation was computed. [2018-01-21 10:09:50,669 INFO L401 ceAbstractionStarter]: For program point L673'(line 673) no Hoare annotation was computed. [2018-01-21 10:09:50,669 INFO L401 ceAbstractionStarter]: For program point L677(line 677) no Hoare annotation was computed. [2018-01-21 10:09:50,669 INFO L401 ceAbstractionStarter]: For program point L676(line 676) no Hoare annotation was computed. [2018-01-21 10:09:50,669 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-21 10:09:50,669 INFO L404 ceAbstractionStarter]: At program point L679(line 679) the Hoare annotation is: true [2018-01-21 10:09:50,670 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 670 686) no Hoare annotation was computed. [2018-01-21 10:09:50,670 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 670 686) the Hoare annotation is: true [2018-01-21 10:09:50,673 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:09:50,674 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:09:50,674 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:09:50,674 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:09:50,674 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:09:50,674 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:09:50,674 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:09:50,675 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:09:50,675 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:09:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 10:09:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:09:50,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:50,678 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:09:50,678 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:09:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash 128549, now seen corresponding path program 1 times [2018-01-21 10:09:50,678 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:50,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:50,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,680 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:09:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:09:50,706 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:09:50,709 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:09:50,713 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:09:50,713 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:09:50,714 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:09:50,714 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:09:50,714 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:09:50,714 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:09:50,714 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:09:50,714 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == dummy_abortErr0EnsuresViolation======== [2018-01-21 10:09:50,714 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:09:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 10:09:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 10:09:50,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:50,716 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:50,717 INFO L371 AbstractCegarLoop]: === Iteration 1 === [dummy_abortErr0EnsuresViolation]=== [2018-01-21 10:09:50,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1195103445, now seen corresponding path program 1 times [2018-01-21 10:09:50,717 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:50,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:50,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,718 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:50,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:50,759 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-21 10:09:50,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:50,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:09:50,759 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:50,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:09:50,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:09:50,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:09:50,761 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 10:09:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:50,769 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 10:09:50,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:09:50,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-21 10:09:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:50,770 INFO L225 Difference]: With dead ends: 88 [2018-01-21 10:09:50,770 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:09:50,771 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-21 10:09:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:09:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:09:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:09:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:09:50,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-21 10:09:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:50,772 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:09:50,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:09:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:09:50,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:09:50,775 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:09:50,775 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:09:50,775 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:09:50,775 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:09:50,775 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:09:50,775 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:09:50,776 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:09:50,776 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:09:50,776 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:09:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 10:09:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 10:09:50,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:50,780 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:50,780 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:09:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1502761729, now seen corresponding path program 1 times [2018-01-21 10:09:50,780 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:50,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:50,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,782 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:50,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:50,823 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-21 10:09:50,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:50,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:09:50,824 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:50,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:09:50,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:09:50,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:09:50,825 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 10:09:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:50,833 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 10:09:50,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:09:50,833 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 39 [2018-01-21 10:09:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:50,836 INFO L225 Difference]: With dead ends: 88 [2018-01-21 10:09:50,836 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 10:09:50,837 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-21 10:09:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 10:09:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 10:09:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 10:09:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-21 10:09:50,853 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-01-21 10:09:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:50,853 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-21 10:09:50,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:09:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-21 10:09:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 10:09:50,856 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:50,856 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:50,856 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:09:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash -809322687, now seen corresponding path program 1 times [2018-01-21 10:09:50,856 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:50,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:50,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,857 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:50,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:50,969 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-21 10:09:50,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:51,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:09:51,009 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:51,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:09:51,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:09:51,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:09:51,011 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 5 states. [2018-01-21 10:09:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:51,100 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-21 10:09:51,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:09:51,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-21 10:09:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:51,102 INFO L225 Difference]: With dead ends: 69 [2018-01-21 10:09:51,102 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 10:09:51,102 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:09:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 10:09:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-01-21 10:09:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 10:09:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-21 10:09:51,109 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 43 [2018-01-21 10:09:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:51,110 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-21 10:09:51,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:09:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-21 10:09:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 10:09:51,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:51,111 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:51,111 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:09:51,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2078335056, now seen corresponding path program 1 times [2018-01-21 10:09:51,111 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:51,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:51,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,112 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:51,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:51,221 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-21 10:09:51,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:51,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:09:51,221 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:51,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:09:51,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:09:51,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:09:51,222 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-21 10:09:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:51,360 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-21 10:09:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:09:51,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-21 10:09:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:51,363 INFO L225 Difference]: With dead ends: 62 [2018-01-21 10:09:51,363 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:09:51,364 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:09:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:09:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:09:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:09:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:09:51,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-21 10:09:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:51,365 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:09:51,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:09:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:09:51,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:09:51,367 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:09:51,367 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:09:51,367 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:09:51,367 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:09:51,367 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:09:51,367 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:09:51,367 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:09:51,368 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == SumErr0EnsuresViolation======== [2018-01-21 10:09:51,368 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:09:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 10:09:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:09:51,370 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:51,370 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] [2018-01-21 10:09:51,370 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SumErr0EnsuresViolation]=== [2018-01-21 10:09:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash 112235281, now seen corresponding path program 1 times [2018-01-21 10:09:51,371 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:51,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:51,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,372 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:51,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:51,396 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-21 10:09:51,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:51,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:09:51,397 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:51,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:09:51,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:09:51,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:09:51,398 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 10:09:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:51,404 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 10:09:51,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:09:51,405 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 10:09:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:51,406 INFO L225 Difference]: With dead ends: 88 [2018-01-21 10:09:51,406 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:09:51,406 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-21 10:09:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:09:51,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:09:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:09:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:09:51,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 10:09:51,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:51,408 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:09:51,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:09:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:09:51,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:09:51,410 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:09:51,410 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:09:51,410 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:09:51,411 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:09:51,411 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:09:51,411 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:09:51,411 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:09:51,411 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:09:51,411 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:09:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 10:09:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:09:51,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:51,414 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:51,414 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:51,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2005137936, now seen corresponding path program 1 times [2018-01-21 10:09:51,414 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:51,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:51,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,416 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:51,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:51,441 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-21 10:09:51,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:51,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:09:51,442 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:51,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:09:51,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:09:51,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:09:51,443 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 10:09:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:51,449 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 10:09:51,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:09:51,449 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-21 10:09:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:51,451 INFO L225 Difference]: With dead ends: 88 [2018-01-21 10:09:51,451 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 10:09:51,452 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-21 10:09:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 10:09:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 10:09:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 10:09:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-21 10:09:51,459 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 37 [2018-01-21 10:09:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:51,459 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-21 10:09:51,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:09:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-21 10:09:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-21 10:09:51,461 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:51,461 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:51,461 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -336037328, now seen corresponding path program 1 times [2018-01-21 10:09:51,462 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:51,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:51,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,463 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:51,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:51,543 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-21 10:09:51,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:51,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:09:51,543 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:51,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:09:51,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:09:51,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:09:51,544 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-21 10:09:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:51,568 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-21 10:09:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:09:51,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-21 10:09:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:51,570 INFO L225 Difference]: With dead ends: 65 [2018-01-21 10:09:51,570 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 10:09:51,570 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:09:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 10:09:51,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-01-21 10:09:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-21 10:09:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-21 10:09:51,575 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 41 [2018-01-21 10:09:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:51,575 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-21 10:09:51,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:09:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-21 10:09:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 10:09:51,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:51,576 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:51,576 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:51,577 INFO L82 PathProgramCache]: Analyzing trace with hash 609983231, now seen corresponding path program 1 times [2018-01-21 10:09:51,577 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:51,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:51,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,578 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:51,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:51,678 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-21 10:09:51,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:51,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:09:51,678 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:51,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:09:51,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:09:51,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:09:51,679 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2018-01-21 10:09:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:51,747 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-01-21 10:09:51,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:09:51,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-01-21 10:09:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:51,748 INFO L225 Difference]: With dead ends: 96 [2018-01-21 10:09:51,749 INFO L226 Difference]: Without dead ends: 69 [2018-01-21 10:09:51,749 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:09:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-21 10:09:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-01-21 10:09:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-21 10:09:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-21 10:09:51,757 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 44 [2018-01-21 10:09:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:51,757 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-21 10:09:51,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:09:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-21 10:09:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 10:09:51,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:51,759 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, 1] [2018-01-21 10:09:51,759 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1680046266, now seen corresponding path program 1 times [2018-01-21 10:09:51,760 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:51,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:51,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,761 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:51,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:09:52,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:52,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:09:52,088 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:52,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:09:52,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:09:52,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:09:52,089 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2018-01-21 10:09:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:52,307 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-21 10:09:52,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 10:09:52,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-21 10:09:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:52,308 INFO L225 Difference]: With dead ends: 76 [2018-01-21 10:09:52,309 INFO L226 Difference]: Without dead ends: 65 [2018-01-21 10:09:52,309 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-21 10:09:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-21 10:09:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-01-21 10:09:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 10:09:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-21 10:09:52,315 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 47 [2018-01-21 10:09:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:52,317 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-21 10:09:52,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:09:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-21 10:09:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 10:09:52,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:52,318 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:52,318 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1025820889, now seen corresponding path program 1 times [2018-01-21 10:09:52,318 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:52,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:52,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:52,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:52,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:52,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:09:52,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:52,562 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:09:52,563 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-21 10:09:52,565 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [27], [28], [29], [31], [35], [36], [39], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [66], [72], [78], [80], [82], [83], [84], [90], [91], [92], [93], [94], [95], [96], [97], [100], [101], [102] [2018-01-21 10:09:52,618 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:09:52,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:09:53,138 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:09:53,140 INFO L268 AbstractInterpreter]: Visited 48 different actions 60 times. Merged at 11 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-21 10:09:53,151 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:09:53,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:53,151 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:09:53,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:53,163 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:09:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:53,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 10:09:53,249 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 10:09:53,386 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 10:09:53,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-01-21 10:09:53,386 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:53,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:09:53,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:09:53,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-21 10:09:53,387 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-21 10:09:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:53,431 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2018-01-21 10:09:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:09:53,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-21 10:09:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:53,433 INFO L225 Difference]: With dead ends: 115 [2018-01-21 10:09:53,434 INFO L226 Difference]: Without dead ends: 63 [2018-01-21 10:09:53,434 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-21 10:09:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-21 10:09:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-21 10:09:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-21 10:09:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-21 10:09:53,444 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 50 [2018-01-21 10:09:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:53,444 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-21 10:09:53,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:09:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-21 10:09:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-21 10:09:53,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:53,445 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:53,445 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1453151358, now seen corresponding path program 1 times [2018-01-21 10:09:53,445 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:53,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:53,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:53,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:53,448 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:53,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 10:09:53,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:53,678 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:09:53,678 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-01-21 10:09:53,679 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [25], [27], [28], [29], [31], [35], [36], [39], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [66], [72], [78], [80], [82], [83], [84], [90], [91], [92], [93], [94], [95], [96], [97], [100], [101], [102] [2018-01-21 10:09:53,681 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:09:53,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:09:54,340 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:09:54,340 INFO L268 AbstractInterpreter]: Visited 49 different actions 69 times. Merged at 14 different actions 17 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 20 variables. [2018-01-21 10:09:54,342 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:09:54,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:54,343 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:09:54,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:54,354 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:09:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:54,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 10:09:54,444 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 10:09:54,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:54,539 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:09:54,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:54,543 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:09:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:54,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 10:09:54,593 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 10:09:54,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:09:54,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 14 [2018-01-21 10:09:54,636 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:09:54,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 10:09:54,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 10:09:54,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-21 10:09:54,637 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 11 states. [2018-01-21 10:09:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:54,799 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-01-21 10:09:54,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 10:09:54,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-01-21 10:09:54,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:54,800 INFO L225 Difference]: With dead ends: 118 [2018-01-21 10:09:54,800 INFO L226 Difference]: Without dead ends: 63 [2018-01-21 10:09:54,801 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 196 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-21 10:09:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-21 10:09:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-01-21 10:09:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-21 10:09:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-21 10:09:54,807 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 51 [2018-01-21 10:09:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:54,807 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-21 10:09:54,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 10:09:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-21 10:09:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-21 10:09:54,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:54,809 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:54,809 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:54,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1200306608, now seen corresponding path program 1 times [2018-01-21 10:09:54,809 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:54,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:54,810 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:54,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:54,810 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:54,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 10:09:55,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:55,090 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:09:55,090 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-01-21 10:09:55,090 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [25], [27], [28], [31], [35], [36], [39], [41], [42], [43], [45], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [69], [72], [78], [80], [82], [83], [84], [90], [91], [92], [93], [96], [97], [100], [101], [102] [2018-01-21 10:09:55,093 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:09:55,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:09:55,598 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:09:55,598 INFO L268 AbstractInterpreter]: Visited 50 different actions 81 times. Merged at 24 different actions 27 times. Never widened. Found 6 fixpoints after 5 different actions. Largest state had 20 variables. [2018-01-21 10:09:55,607 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:09:55,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:55,607 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:09:55,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:55,630 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:09:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:55,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 10:09:55,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 10:09:55,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:55,970 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:09:56,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:56,012 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:09:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:56,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 10:09:56,083 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 10:09:56,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:09:56,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6, 6, 6] total 17 [2018-01-21 10:09:56,123 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:09:56,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 10:09:56,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 10:09:56,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-01-21 10:09:56,123 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 13 states. [2018-01-21 10:09:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:56,523 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-01-21 10:09:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 10:09:56,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-01-21 10:09:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:56,524 INFO L225 Difference]: With dead ends: 121 [2018-01-21 10:09:56,524 INFO L226 Difference]: Without dead ends: 70 [2018-01-21 10:09:56,525 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 210 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-01-21 10:09:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-21 10:09:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-21 10:09:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-21 10:09:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-21 10:09:56,532 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 55 [2018-01-21 10:09:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:56,532 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-21 10:09:56,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 10:09:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-21 10:09:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-21 10:09:56,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:56,533 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:09:56,533 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2066944597, now seen corresponding path program 2 times [2018-01-21 10:09:56,534 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:56,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:56,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:56,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:56,535 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:56,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 10:09:56,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:56,643 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:09:56,643 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:09:56,644 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:09:56,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:56,644 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:09:56,657 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:09:56,657 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:09:56,678 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:09:56,695 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:09:56,697 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:09:56,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 10:09:56,736 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 10:09:56,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:56,837 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:09:56,840 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:09:56,840 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:09:56,859 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:09:56,885 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:09:56,899 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:09:56,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 10:09:56,911 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 10:09:56,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:09:56,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 17 [2018-01-21 10:09:56,951 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:09:56,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 10:09:56,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 10:09:56,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-01-21 10:09:56,952 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 12 states. [2018-01-21 10:09:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:56,973 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-01-21 10:09:56,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 10:09:56,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-01-21 10:09:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:56,974 INFO L225 Difference]: With dead ends: 122 [2018-01-21 10:09:56,974 INFO L226 Difference]: Without dead ends: 68 [2018-01-21 10:09:56,975 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2018-01-21 10:09:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-21 10:09:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-21 10:09:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-21 10:09:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-21 10:09:56,981 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 62 [2018-01-21 10:09:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:56,981 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-21 10:09:56,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 10:09:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-21 10:09:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-21 10:09:56,982 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:56,983 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:09:56,983 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:56,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1647895852, now seen corresponding path program 3 times [2018-01-21 10:09:56,983 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:56,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:56,984 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:09:56,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:56,984 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:56,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 10:09:57,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:57,184 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:09:57,184 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:09:57,184 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:09:57,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:57,184 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:09:57,190 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 10:09:57,190 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 10:09:57,209 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:09:57,220 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:09:57,228 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:09:57,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:57,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 10:09:57,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 10:09:57,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 10:09:57,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 10:09:57,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 10:09:57,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 10:09:57,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 10:09:57,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 10:09:57,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 10:09:57,384 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 39 treesize of output 30 [2018-01-21 10:09:57,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 10:09:57,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 10:09:57,447 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 48 treesize of output 37 [2018-01-21 10:09:57,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,455 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,455 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,458 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 10:09:57,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 10:09:57,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 10:09:57,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 10:09:57,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 10:09:57,675 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 66 treesize of output 51 [2018-01-21 10:09:57,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:57,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 10:09:57,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:57,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 10:09:58,004 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 10:09:58,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,006 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-21 10:09:58,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:121, output treesize:1 [2018-01-21 10:09:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 10:09:58,019 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 10:09:58,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:58,355 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:09:58,358 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 10:09:58,358 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 10:09:58,376 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:09:58,400 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:09:58,425 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:09:58,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:58,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 10:09:58,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 10:09:58,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 10:09:58,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 10:09:58,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 10:09:58,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 10:09:58,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 10:09:58,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 10:09:58,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 10:09:58,523 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 39 treesize of output 30 [2018-01-21 10:09:58,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 10:09:58,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 10:09:58,558 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 48 treesize of output 37 [2018-01-21 10:09:58,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 10:09:58,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 10:09:58,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 10:09:58,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 10:09:58,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 10:09:58,701 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 66 treesize of output 51 [2018-01-21 10:09:58,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,710 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,710 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:09:58,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 10:09:58,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:09:58,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 10:09:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 10:09:58,836 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 10:09:58,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:09:58,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 7, 16, 7] total 28 [2018-01-21 10:09:58,937 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:09:58,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-21 10:09:58,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-21 10:09:58,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-01-21 10:09:58,938 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 22 states. [2018-01-21 10:09:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:59,319 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-21 10:09:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-21 10:09:59,319 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-01-21 10:09:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:59,320 INFO L225 Difference]: With dead ends: 135 [2018-01-21 10:09:59,320 INFO L226 Difference]: Without dead ends: 78 [2018-01-21 10:09:59,321 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 217 SyntacticMatches, 16 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2018-01-21 10:09:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-21 10:09:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-01-21 10:09:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-21 10:09:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-21 10:09:59,330 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 63 [2018-01-21 10:09:59,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:59,330 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-21 10:09:59,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-21 10:09:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-21 10:09:59,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-21 10:09:59,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:59,331 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:09:59,331 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-21 10:09:59,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1961550311, now seen corresponding path program 4 times [2018-01-21 10:09:59,331 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:59,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:59,332 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:09:59,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:59,332 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:59,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:09:59,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:59,617 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:09:59,617 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:09:59,617 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:09:59,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:59,617 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:09:59,630 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 10:09:59,631 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 10:09:59,677 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:09:59,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:09:59,783 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:09:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:09:59,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:59,908 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:09:59,911 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 10:09:59,911 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 10:09:59,970 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:09:59,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:09:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:09:59,983 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:00,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:00,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 23 [2018-01-21 10:10:00,030 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:00,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-21 10:10:00,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-21 10:10:00,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2018-01-21 10:10:00,031 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 16 states. [2018-01-21 10:10:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:00,060 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-01-21 10:10:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:10:00,060 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2018-01-21 10:10:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:00,061 INFO L225 Difference]: With dead ends: 136 [2018-01-21 10:10:00,061 INFO L226 Difference]: Without dead ends: 76 [2018-01-21 10:10:00,062 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=349, Unknown=0, NotChecked=0, Total=552 [2018-01-21 10:10:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-21 10:10:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-21 10:10:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-21 10:10:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-21 10:10:00,069 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 70 [2018-01-21 10:10:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:00,070 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-21 10:10:00,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-21 10:10:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-21 10:10:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-21 10:10:00,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:00,070 INFO L322 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:00,071 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:00,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1168255472, now seen corresponding path program 5 times [2018-01-21 10:10:00,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:00,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:00,072 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:00,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:00,072 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:00,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:00,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:00,169 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:00,169 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:00,169 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:00,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:00,169 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:10:00,174 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 10:10:00,174 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:00,181 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:00,184 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:00,188 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:00,202 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:00,215 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:00,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:00,264 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:00,405 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:00,406 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:00,409 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 10:10:00,409 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:00,417 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:00,422 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:00,433 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:00,475 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:00,491 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:00,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:00,501 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:00,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:00,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 26 [2018-01-21 10:10:00,566 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:00,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 10:10:00,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 10:10:00,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-01-21 10:10:00,567 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 18 states. [2018-01-21 10:10:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:00,601 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-01-21 10:10:00,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 10:10:00,602 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-01-21 10:10:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:00,602 INFO L225 Difference]: With dead ends: 137 [2018-01-21 10:10:00,603 INFO L226 Difference]: Without dead ends: 77 [2018-01-21 10:10:00,603 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=446, Unknown=0, NotChecked=0, Total=702 [2018-01-21 10:10:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-21 10:10:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-21 10:10:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-21 10:10:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-21 10:10:00,610 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 71 [2018-01-21 10:10:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:00,610 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-21 10:10:00,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 10:10:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-21 10:10:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-21 10:10:00,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:00,611 INFO L322 BasicCegarLoop]: trace histogram [7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:00,611 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash 592013063, now seen corresponding path program 6 times [2018-01-21 10:10:00,611 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:00,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:00,612 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:00,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:00,612 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:00,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:00,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:00,734 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:00,734 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:00,734 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:00,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:00,734 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:10:00,739 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 10:10:00,739 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 10:10:00,753 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:00,766 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:00,772 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:00,801 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:00,814 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:00,815 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:00,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:00,861 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:01,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:01,030 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:01,033 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 10:10:01,034 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 10:10:01,052 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:01,072 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:01,098 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:01,227 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:01,508 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:01,527 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:01,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:01,538 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:01,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:01,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 29 [2018-01-21 10:10:01,579 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:01,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-21 10:10:01,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-21 10:10:01,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=518, Unknown=0, NotChecked=0, Total=812 [2018-01-21 10:10:01,580 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 20 states. [2018-01-21 10:10:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:01,606 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-21 10:10:01,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 10:10:01,606 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-01-21 10:10:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:01,607 INFO L225 Difference]: With dead ends: 138 [2018-01-21 10:10:01,607 INFO L226 Difference]: Without dead ends: 78 [2018-01-21 10:10:01,607 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=555, Unknown=0, NotChecked=0, Total=870 [2018-01-21 10:10:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-21 10:10:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-21 10:10:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-21 10:10:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-21 10:10:01,612 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 72 [2018-01-21 10:10:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:01,612 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-21 10:10:01,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-21 10:10:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-21 10:10:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-21 10:10:01,612 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:01,613 INFO L322 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:01,613 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash -674237200, now seen corresponding path program 7 times [2018-01-21 10:10:01,613 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:01,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:01,613 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:01,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:01,614 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:01,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:01,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:01,790 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:01,791 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:01,791 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:01,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:01,791 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:10:01,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:01,802 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:10:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:01,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:01,907 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:02,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:02,138 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:02,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:02,141 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:10:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:02,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:02,215 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:02,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:02,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 32 [2018-01-21 10:10:02,261 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:02,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-21 10:10:02,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-21 10:10:02,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=635, Unknown=0, NotChecked=0, Total=992 [2018-01-21 10:10:02,262 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 22 states. [2018-01-21 10:10:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:02,307 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-01-21 10:10:02,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 10:10:02,308 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-01-21 10:10:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:02,309 INFO L225 Difference]: With dead ends: 139 [2018-01-21 10:10:02,309 INFO L226 Difference]: Without dead ends: 79 [2018-01-21 10:10:02,310 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2018-01-21 10:10:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-21 10:10:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-21 10:10:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-21 10:10:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-21 10:10:02,315 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 73 [2018-01-21 10:10:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:02,315 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-21 10:10:02,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-21 10:10:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-21 10:10:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-21 10:10:02,316 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:02,316 INFO L322 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:02,317 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:02,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1273289689, now seen corresponding path program 8 times [2018-01-21 10:10:02,317 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:02,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:02,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:02,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:02,318 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:02,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:02,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:02,538 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:02,538 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:02,538 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:02,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:02,538 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:02,544 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:10:02,544 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:02,566 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:02,578 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:02,579 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:02,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:02,651 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:02,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:02,852 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:02,854 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:10:02,854 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:02,873 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:02,901 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:02,917 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:02,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:02,927 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:02,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:02,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 35 [2018-01-21 10:10:02,968 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:02,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-21 10:10:02,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-21 10:10:02,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=764, Unknown=0, NotChecked=0, Total=1190 [2018-01-21 10:10:02,969 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 24 states. [2018-01-21 10:10:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:03,000 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-21 10:10:03,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-21 10:10:03,000 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-01-21 10:10:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:03,001 INFO L225 Difference]: With dead ends: 140 [2018-01-21 10:10:03,001 INFO L226 Difference]: Without dead ends: 80 [2018-01-21 10:10:03,001 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=809, Unknown=0, NotChecked=0, Total=1260 [2018-01-21 10:10:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-21 10:10:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-21 10:10:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-21 10:10:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-01-21 10:10:03,006 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 74 [2018-01-21 10:10:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:03,006 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-01-21 10:10:03,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-21 10:10:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-01-21 10:10:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-21 10:10:03,007 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:03,007 INFO L322 BasicCegarLoop]: trace histogram [10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:03,007 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1630919632, now seen corresponding path program 9 times [2018-01-21 10:10:03,007 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:03,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:03,008 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:03,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:03,008 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:03,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:03,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:03,158 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:03,158 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:03,158 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:03,158 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:03,158 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:03,163 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 10:10:03,163 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 10:10:03,176 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:03,186 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:03,199 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:03,201 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:03,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:03,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 10:10:03,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 10:10:03,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-21 10:10:03,235 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 23 treesize of output 18 [2018-01-21 10:10:03,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,238 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 18 treesize of output 37 [2018-01-21 10:10:03,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-21 10:10:03,260 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 32 treesize of output 25 [2018-01-21 10:10:03,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-01-21 10:10:03,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-21 10:10:03,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2018-01-21 10:10:03,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:03,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2018-01-21 10:10:03,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:03,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:3 [2018-01-21 10:10:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 10:10:03,649 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:04,028 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 10:10:04,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,029 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-21 10:10:04,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2018-01-21 10:10:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 10:10:04,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:04,072 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:04,077 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 10:10:04,078 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 10:10:04,107 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:04,137 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:04,219 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:04,255 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:04,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:04,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 10:10:04,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 10:10:04,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 10:10:04,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 10:10:04,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 10:10:04,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 10:10:04,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 10:10:04,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 10:10:04,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 10:10:04,461 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 39 treesize of output 30 [2018-01-21 10:10:04,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 10:10:04,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 10:10:04,529 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 48 treesize of output 37 [2018-01-21 10:10:04,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 10:10:04,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 10:10:04,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 10:10:04,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 10:10:04,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 10:10:04,730 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 66 treesize of output 51 [2018-01-21 10:10:04,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:04,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 10:10:04,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:04,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 10:10:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 10:10:05,359 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 10:10:05,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:05,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 12, 17, 8] total 57 [2018-01-21 10:10:05,941 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:05,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-21 10:10:05,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-21 10:10:05,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2893, Unknown=0, NotChecked=0, Total=3192 [2018-01-21 10:10:05,943 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 28 states. [2018-01-21 10:10:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:06,624 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-01-21 10:10:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-21 10:10:06,624 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2018-01-21 10:10:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:06,625 INFO L225 Difference]: With dead ends: 154 [2018-01-21 10:10:06,625 INFO L226 Difference]: Without dead ends: 94 [2018-01-21 10:10:06,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 245 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=373, Invalid=3787, Unknown=0, NotChecked=0, Total=4160 [2018-01-21 10:10:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-21 10:10:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-01-21 10:10:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-21 10:10:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-01-21 10:10:06,634 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 75 [2018-01-21 10:10:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:06,634 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-01-21 10:10:06,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-21 10:10:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-01-21 10:10:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-21 10:10:06,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:06,635 INFO L322 BasicCegarLoop]: trace histogram [11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:06,635 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash 580128904, now seen corresponding path program 1 times [2018-01-21 10:10:06,636 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:06,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:06,636 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:06,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:06,636 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:06,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:06,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:06,776 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:06,776 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-01-21 10:10:06,776 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [25], [27], [28], [29], [31], [35], [36], [39], [41], [42], [43], [45], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [69], [72], [75], [80], [82], [83], [84], [90], [91], [92], [93], [96], [97], [98], [99], [100], [101], [102] [2018-01-21 10:10:06,777 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:10:06,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:10:07,277 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:10:07,278 INFO L268 AbstractInterpreter]: Visited 53 different actions 84 times. Merged at 24 different actions 27 times. Never widened. Found 7 fixpoints after 6 different actions. Largest state had 20 variables. [2018-01-21 10:10:07,280 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:10:07,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:07,280 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:07,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:07,290 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:10:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:07,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:07,555 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:07,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:07,897 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:07,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:07,902 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:10:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:07,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:07,969 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:08,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:08,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 41 [2018-01-21 10:10:08,059 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:08,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-21 10:10:08,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-21 10:10:08,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1058, Unknown=0, NotChecked=0, Total=1640 [2018-01-21 10:10:08,060 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 28 states. [2018-01-21 10:10:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:08,106 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2018-01-21 10:10:08,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 10:10:08,106 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-01-21 10:10:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:08,107 INFO L225 Difference]: With dead ends: 164 [2018-01-21 10:10:08,107 INFO L226 Difference]: Without dead ends: 93 [2018-01-21 10:10:08,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=611, Invalid=1111, Unknown=0, NotChecked=0, Total=1722 [2018-01-21 10:10:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-21 10:10:08,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-21 10:10:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-21 10:10:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-01-21 10:10:08,113 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 79 [2018-01-21 10:10:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:08,114 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-01-21 10:10:08,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-21 10:10:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-01-21 10:10:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-21 10:10:08,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:08,114 INFO L322 BasicCegarLoop]: trace histogram [12, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:08,114 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash -50939265, now seen corresponding path program 2 times [2018-01-21 10:10:08,115 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:08,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:08,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:08,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:08,116 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:08,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:08,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:08,407 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:08,408 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:08,408 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:08,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:08,408 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:08,418 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:10:08,418 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:08,435 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:08,449 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:08,457 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:08,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:08,748 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:09,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:09,185 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:09,188 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:10:09,188 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:09,207 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,237 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,255 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:09,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:09,265 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:09,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:09,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 16, 16] total 44 [2018-01-21 10:10:09,322 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:09,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-21 10:10:09,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-21 10:10:09,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=1223, Unknown=0, NotChecked=0, Total=1892 [2018-01-21 10:10:09,323 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 30 states. [2018-01-21 10:10:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:09,362 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-01-21 10:10:09,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-21 10:10:09,363 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2018-01-21 10:10:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:09,363 INFO L225 Difference]: With dead ends: 165 [2018-01-21 10:10:09,363 INFO L226 Difference]: Without dead ends: 94 [2018-01-21 10:10:09,364 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=700, Invalid=1280, Unknown=0, NotChecked=0, Total=1980 [2018-01-21 10:10:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-21 10:10:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-21 10:10:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-21 10:10:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-01-21 10:10:09,370 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 80 [2018-01-21 10:10:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:09,370 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-01-21 10:10:09,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-21 10:10:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-01-21 10:10:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-21 10:10:09,370 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:09,371 INFO L322 BasicCegarLoop]: trace histogram [13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:09,371 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1860783976, now seen corresponding path program 3 times [2018-01-21 10:10:09,371 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:09,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:09,371 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:09,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:09,372 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:09,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 10:10:09,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:09,568 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:09,568 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:09,568 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:09,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:09,568 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:09,575 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 10:10:09,576 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 10:10:09,590 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:09,600 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:09,614 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:09,616 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:09,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:09,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 10:10:09,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 10:10:09,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 10:10:09,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 10:10:09,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 10:10:09,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 10:10:09,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 10:10:09,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 10:10:09,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 10:10:09,730 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 39 treesize of output 30 [2018-01-21 10:10:09,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 10:10:09,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 10:10:09,789 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 48 treesize of output 37 [2018-01-21 10:10:09,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 10:10:09,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 10:10:09,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 10:10:09,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 10:10:09,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:09,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 10:10:09,977 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 66 treesize of output 51 [2018-01-21 10:10:09,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:09,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 10:10:09,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 10:10:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 10:10:10,289 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 10:10:10,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:10,539 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:10,542 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 10:10:10,542 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 10:10:10,562 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:10,585 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:10,646 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:10,679 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:10,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:10,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 10:10:10,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 10:10:10,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 10:10:10,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 10:10:10,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,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 16 treesize of output 31 [2018-01-21 10:10:10,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 10:10:10,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 10:10:10,710 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,710 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 10:10:10,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 10:10:10,729 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 39 treesize of output 30 [2018-01-21 10:10:10,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 10:10:10,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 10:10:10,760 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 48 treesize of output 37 [2018-01-21 10:10:10,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 10:10:10,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 10:10:10,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 10:10:10,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 10:10:10,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 10:10:10,855 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 66 treesize of output 51 [2018-01-21 10:10:10,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,867 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,870 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:10:10,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 10:10:10,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:10,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 10:10:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 10:10:11,230 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 10:10:11,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:11,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 8, 17, 8] total 48 [2018-01-21 10:10:11,553 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:11,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-21 10:10:11,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-21 10:10:11,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1969, Unknown=0, NotChecked=0, Total=2256 [2018-01-21 10:10:11,554 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 32 states. [2018-01-21 10:10:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:12,226 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-01-21 10:10:12,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-21 10:10:12,226 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-01-21 10:10:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:12,227 INFO L225 Difference]: With dead ends: 178 [2018-01-21 10:10:12,227 INFO L226 Difference]: Without dead ends: 104 [2018-01-21 10:10:12,228 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 277 SyntacticMatches, 17 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2018-01-21 10:10:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-21 10:10:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-01-21 10:10:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-21 10:10:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-21 10:10:12,237 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 81 [2018-01-21 10:10:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:12,238 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-21 10:10:12,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-21 10:10:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-21 10:10:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-21 10:10:12,239 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:12,239 INFO L322 BasicCegarLoop]: trace histogram [14, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:12,239 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash -777231677, now seen corresponding path program 4 times [2018-01-21 10:10:12,239 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:12,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:12,240 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:12,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:12,240 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:12,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-21 10:10:12,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:12,458 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:12,458 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:12,458 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:12,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:12,458 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:12,463 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 10:10:12,463 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 10:10:12,483 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:12,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 10:10:12,684 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:12,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-01-21 10:10:12,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-01-21 10:10:12,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-21 10:10:12,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-21 10:10:12,895 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:12,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-21 10:10:12,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:12,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 10:10:12,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 10:10:12,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-01-21 10:10:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 10:10:12,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:12,964 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:12,967 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 10:10:12,967 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 10:10:13,017 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:13,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 10:10:13,067 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:13,173 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 10:10:13,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:13,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:10:13,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:1 [2018-01-21 10:10:13,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-01-21 10:10:13,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-21 10:10:13,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:13,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-21 10:10:13,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:10:13,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-01-21 10:10:13,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 10:10:13,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 10:10:13,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 10:10:13,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-01-21 10:10:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 10:10:13,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:13,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13, 14, 14] total 39 [2018-01-21 10:10:13,330 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:13,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-21 10:10:13,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-21 10:10:13,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2018-01-21 10:10:13,331 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 30 states. [2018-01-21 10:10:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:21,900 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-01-21 10:10:21,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-21 10:10:21,900 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 88 [2018-01-21 10:10:21,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:21,901 INFO L225 Difference]: With dead ends: 180 [2018-01-21 10:10:21,901 INFO L226 Difference]: Without dead ends: 100 [2018-01-21 10:10:21,902 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 322 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-01-21 10:10:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-21 10:10:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-01-21 10:10:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-21 10:10:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-21 10:10:21,909 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 88 [2018-01-21 10:10:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:21,909 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-21 10:10:21,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-21 10:10:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-21 10:10:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-21 10:10:21,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:21,910 INFO L322 BasicCegarLoop]: trace histogram [15, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:21,910 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash -468179545, now seen corresponding path program 10 times [2018-01-21 10:10:21,910 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:21,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:21,911 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:21,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:21,911 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:21,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:22,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:22,162 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:22,162 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:22,162 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:22,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:22,162 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:22,167 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 10:10:22,168 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 10:10:22,254 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:22,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:22,380 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:22,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:22,751 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 32 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:22,754 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 10:10:22,754 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 10:10:22,855 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:22,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:22,867 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:22,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:22,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 19, 19] total 53 [2018-01-21 10:10:22,931 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:22,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-21 10:10:22,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-21 10:10:22,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=966, Invalid=1790, Unknown=0, NotChecked=0, Total=2756 [2018-01-21 10:10:22,932 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 36 states. [2018-01-21 10:10:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:22,985 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2018-01-21 10:10:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-21 10:10:22,986 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 92 [2018-01-21 10:10:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:22,986 INFO L225 Difference]: With dead ends: 170 [2018-01-21 10:10:22,986 INFO L226 Difference]: Without dead ends: 98 [2018-01-21 10:10:22,987 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 332 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1003, Invalid=1859, Unknown=0, NotChecked=0, Total=2862 [2018-01-21 10:10:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-21 10:10:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-21 10:10:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-21 10:10:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-01-21 10:10:22,993 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 92 [2018-01-21 10:10:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:22,993 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-01-21 10:10:22,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-21 10:10:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-01-21 10:10:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-21 10:10:22,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:22,994 INFO L322 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:22,994 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:22,994 INFO L82 PathProgramCache]: Analyzing trace with hash -804412144, now seen corresponding path program 11 times [2018-01-21 10:10:22,994 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:22,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:22,995 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:22,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:22,995 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:23,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:23,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:23,247 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:23,247 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:23,248 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:23,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:23,248 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:23,253 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 10:10:23,253 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:23,265 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,267 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,270 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,278 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,284 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,309 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,320 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,346 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,381 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,384 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:23,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:23,557 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:23,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:23,965 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 34 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:23,968 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 10:10:23,968 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:23,977 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,979 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,986 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:23,996 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:24,010 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:24,032 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:24,074 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:24,211 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:24,650 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:24,684 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:24,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:24,697 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:24,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:24,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20, 20, 20] total 56 [2018-01-21 10:10:24,764 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:24,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-21 10:10:24,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-21 10:10:24,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1077, Invalid=2003, Unknown=0, NotChecked=0, Total=3080 [2018-01-21 10:10:24,765 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 38 states. [2018-01-21 10:10:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:24,812 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-01-21 10:10:24,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-21 10:10:24,812 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 93 [2018-01-21 10:10:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:24,813 INFO L225 Difference]: With dead ends: 171 [2018-01-21 10:10:24,813 INFO L226 Difference]: Without dead ends: 99 [2018-01-21 10:10:24,814 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1116, Invalid=2076, Unknown=0, NotChecked=0, Total=3192 [2018-01-21 10:10:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-21 10:10:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-21 10:10:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-21 10:10:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-01-21 10:10:24,820 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 93 [2018-01-21 10:10:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:24,820 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-01-21 10:10:24,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-21 10:10:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-01-21 10:10:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-21 10:10:24,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:24,821 INFO L322 BasicCegarLoop]: trace histogram [17, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:24,821 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation]=== [2018-01-21 10:10:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1657279175, now seen corresponding path program 12 times [2018-01-21 10:10:24,822 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:24,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:24,822 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:24,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:24,822 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:24,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:25,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:25,205 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:25,205 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:25,205 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:25,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:25,205 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:25,210 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 10:10:25,210 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 10:10:25,223 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:25,230 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:25,237 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:25,254 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:25,274 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:25,330 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:25,444 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:25,636 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:26,096 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:26,495 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:26,496 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:26,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:26,632 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 10:10:27,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:27,098 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 36 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:27,101 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 10:10:27,101 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 10:10:27,121 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:27,143 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:27,172 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:27,315 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:27,736 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:28,487 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:30,551 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:42,584 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown