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/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy1_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-29 23:21:13,456 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:21:13,457 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:21:13,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:21:13,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:21:13,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:21:13,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:21:13,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:21:13,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:21:13,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:21:13,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:21:13,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:21:13,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:21:13,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:21:13,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:21:13,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:21:13,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:21:13,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:21:13,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:21:13,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:21:13,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:21:13,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:21:13,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:21:13,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:21:13,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:21:13,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:21:13,491 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:21:13,492 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:21:13,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:21:13,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:21:13,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:21:13,493 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:21:13,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:21:13,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:21:13,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:21:13,504 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:21:13,504 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:21:13,504 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:21:13,504 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:21:13,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:21:13,505 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:21:13,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:21:13,505 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:21:13,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:21:13,505 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-29 23:21:13,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:21:13,505 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-29 23:21:13,505 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:21:13,505 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-29 23:21:13,506 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-29 23:21:13,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:21:13,506 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:21:13,506 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:21:13,506 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:21:13,506 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:21:13,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:21:13,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:21:13,507 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:21:13,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:21:13,507 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:21:13,507 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:21:13,507 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:21:13,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:21:13,507 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:21:13,508 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:21:13,508 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:21:13,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:21:13,541 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:21:13,544 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:21:13,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:21:13,545 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:21:13,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_true-unreach-call_ground.i [2018-01-29 23:21:13,615 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:21:13,616 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:21:13,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:21:13,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:21:13,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:21:13,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:13" (1/1) ... [2018-01-29 23:21:13,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f3f5068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13, skipping insertion in model container [2018-01-29 23:21:13,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:13" (1/1) ... [2018-01-29 23:21:13,634 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:21:13,645 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:21:13,723 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:21:13,731 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:21:13,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13 WrapperNode [2018-01-29 23:21:13,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:21:13,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:21:13,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:21:13,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:21:13,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13" (1/1) ... [2018-01-29 23:21:13,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13" (1/1) ... [2018-01-29 23:21:13,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13" (1/1) ... [2018-01-29 23:21:13,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13" (1/1) ... [2018-01-29 23:21:13,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13" (1/1) ... [2018-01-29 23:21:13,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13" (1/1) ... [2018-01-29 23:21:13,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13" (1/1) ... [2018-01-29 23:21:13,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:21:13,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:21:13,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:21:13,752 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:21:13,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13" (1/1) ... No working directory specified, using /home/daniel/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-29 23:21:13,806 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:21:13,806 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:21:13,806 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-29 23:21:13,807 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:21:13,807 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-29 23:21:13,807 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-29 23:21:13,807 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:21:13,807 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:21:13,807 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:21:13,807 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:21:14,062 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:21:14,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:14 BoogieIcfgContainer [2018-01-29 23:21:14,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:21:14,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:21:14,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:21:14,065 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:21:14,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:21:13" (1/3) ... [2018-01-29 23:21:14,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a2c786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:14, skipping insertion in model container [2018-01-29 23:21:14,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:13" (2/3) ... [2018-01-29 23:21:14,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a2c786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:14, skipping insertion in model container [2018-01-29 23:21:14,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:14" (3/3) ... [2018-01-29 23:21:14,067 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_copy1_true-unreach-call_ground.i [2018-01-29 23:21:14,072 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:21:14,078 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-29 23:21:14,102 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:21:14,102 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:21:14,102 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:21:14,102 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:21:14,102 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:21:14,102 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:21:14,103 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:21:14,103 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:21:14,103 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:21:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-29 23:21:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 23:21:14,116 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:14,116 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:14,116 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:14,119 INFO L82 PathProgramCache]: Analyzing trace with hash -107226079, now seen corresponding path program 1 times [2018-01-29 23:21:14,120 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:14,120 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:14,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:14,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:14,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:14,198 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-29 23:21:14,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:21:14,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:21:14,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:21:14,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:21:14,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:21:14,211 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-29 23:21:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:14,225 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-29 23:21:14,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:21:14,227 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-29 23:21:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:14,233 INFO L225 Difference]: With dead ends: 70 [2018-01-29 23:21:14,233 INFO L226 Difference]: Without dead ends: 38 [2018-01-29 23:21:14,235 INFO L553 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-29 23:21:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-29 23:21:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-29 23:21:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-29 23:21:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-29 23:21:14,256 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-01-29 23:21:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:14,256 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-29 23:21:14,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:21:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-29 23:21:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-29 23:21:14,257 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:14,257 INFO L350 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] [2018-01-29 23:21:14,257 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:14,257 INFO L82 PathProgramCache]: Analyzing trace with hash -853737866, now seen corresponding path program 1 times [2018-01-29 23:21:14,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:14,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:14,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:14,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:14,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:14,305 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-29 23:21:14,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:21:14,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:21:14,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:21:14,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:21:14,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:21:14,307 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-29 23:21:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:14,364 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-01-29 23:21:14,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:21:14,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-29 23:21:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:14,365 INFO L225 Difference]: With dead ends: 67 [2018-01-29 23:21:14,365 INFO L226 Difference]: Without dead ends: 45 [2018-01-29 23:21:14,366 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:21:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-29 23:21:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-01-29 23:21:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-29 23:21:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-29 23:21:14,369 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 22 [2018-01-29 23:21:14,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:14,369 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-29 23:21:14,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:21:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-29 23:21:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-29 23:21:14,370 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:14,370 INFO L350 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] [2018-01-29 23:21:14,370 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:14,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2078614369, now seen corresponding path program 1 times [2018-01-29 23:21:14,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:14,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:14,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:14,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:14,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:14,446 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-29 23:21:14,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:21:14,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:21:14,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:21:14,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:21:14,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:21:14,447 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2018-01-29 23:21:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:14,472 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-01-29 23:21:14,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:21:14,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-29 23:21:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:14,476 INFO L225 Difference]: With dead ends: 59 [2018-01-29 23:21:14,476 INFO L226 Difference]: Without dead ends: 45 [2018-01-29 23:21:14,476 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:21:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-29 23:21:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-29 23:21:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-29 23:21:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-29 23:21:14,479 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 30 [2018-01-29 23:21:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:14,480 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-29 23:21:14,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:21:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-29 23:21:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 23:21:14,480 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:14,480 INFO L350 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] [2018-01-29 23:21:14,480 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:14,481 INFO L82 PathProgramCache]: Analyzing trace with hash 537552711, now seen corresponding path program 1 times [2018-01-29 23:21:14,481 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:14,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:14,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:14,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:14,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:21:14,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:14,564 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:14,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:14,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:21:14,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:14,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:21:14,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:21:14,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:21:14,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:21:14,644 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2018-01-29 23:21:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:14,807 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-29 23:21:14,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:21:14,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-29 23:21:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:14,808 INFO L225 Difference]: With dead ends: 79 [2018-01-29 23:21:14,808 INFO L226 Difference]: Without dead ends: 55 [2018-01-29 23:21:14,809 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:21:14,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-29 23:21:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-01-29 23:21:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-29 23:21:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-29 23:21:14,812 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 36 [2018-01-29 23:21:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:14,812 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-29 23:21:14,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:21:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-29 23:21:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 23:21:14,813 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:14,813 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:14,813 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash 42977712, now seen corresponding path program 2 times [2018-01-29 23:21:14,813 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:14,813 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:14,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:14,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:14,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:21:14,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:14,889 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:14,906 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:21:14,912 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:14,925 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:14,930 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:14,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:21:14,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:14,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-29 23:21:14,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:21:14,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:21:14,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:21:14,987 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 10 states. [2018-01-29 23:21:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:15,245 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-01-29 23:21:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:21:15,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-01-29 23:21:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:15,248 INFO L225 Difference]: With dead ends: 96 [2018-01-29 23:21:15,248 INFO L226 Difference]: Without dead ends: 72 [2018-01-29 23:21:15,249 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:21:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-29 23:21:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-01-29 23:21:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-29 23:21:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-29 23:21:15,252 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 44 [2018-01-29 23:21:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:15,252 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-29 23:21:15,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:21:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-29 23:21:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-29 23:21:15,253 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:15,253 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:15,253 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash 252967489, now seen corresponding path program 3 times [2018-01-29 23:21:15,253 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:15,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:15,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:15,254 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:15,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:15,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 23:21:15,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:15,496 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-29 23:21:15,504 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:21:15,512 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:15,516 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:15,518 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:15,519 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:15,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 23:21:15,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:15,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-29 23:21:15,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:21:15,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:21:15,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:21:15,542 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 7 states. [2018-01-29 23:21:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:15,618 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-29 23:21:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:21:15,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-01-29 23:21:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:15,623 INFO L225 Difference]: With dead ends: 87 [2018-01-29 23:21:15,623 INFO L226 Difference]: Without dead ends: 73 [2018-01-29 23:21:15,623 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:21:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-29 23:21:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-01-29 23:21:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-29 23:21:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-29 23:21:15,627 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 58 [2018-01-29 23:21:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:15,627 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-29 23:21:15,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:21:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-29 23:21:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-29 23:21:15,628 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:15,628 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:15,628 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1521173353, now seen corresponding path program 4 times [2018-01-29 23:21:15,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:15,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:15,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:15,629 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:15,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:15,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-29 23:21:15,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:15,706 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:15,711 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:21:15,743 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:15,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:15,778 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-29 23:21:15,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:15,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:21:15,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:21:15,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:15,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:21:15,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:15,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:21:15,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:21:15,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:15,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:15,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:21:15,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:15,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:21:15,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-01-29 23:21:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 23:21:16,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:16,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-01-29 23:21:16,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:21:16,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:21:16,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:21:16,149 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 20 states. [2018-01-29 23:21:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:16,754 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-01-29 23:21:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 23:21:16,754 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-01-29 23:21:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:16,755 INFO L225 Difference]: With dead ends: 129 [2018-01-29 23:21:16,755 INFO L226 Difference]: Without dead ends: 93 [2018-01-29 23:21:16,755 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:21:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-29 23:21:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-01-29 23:21:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 23:21:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-01-29 23:21:16,760 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 64 [2018-01-29 23:21:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:16,760 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-01-29 23:21:16,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:21:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-01-29 23:21:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 23:21:16,761 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:16,761 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-01-29 23:21:16,763 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1866705901, now seen corresponding path program 1 times [2018-01-29 23:21:16,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:16,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:16,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:16,764 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:16,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:16,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-29 23:21:16,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:16,856 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:21:16,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:16,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-29 23:21:16,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:16,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-29 23:21:16,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:21:16,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:21:16,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:21:16,913 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 11 states. [2018-01-29 23:21:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:17,020 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-01-29 23:21:17,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:21:17,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-01-29 23:21:17,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:17,023 INFO L225 Difference]: With dead ends: 141 [2018-01-29 23:21:17,024 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 23:21:17,024 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:21:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 23:21:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2018-01-29 23:21:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-29 23:21:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-29 23:21:17,029 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 82 [2018-01-29 23:21:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:17,029 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-29 23:21:17,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:21:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-29 23:21:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-29 23:21:17,030 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:17,030 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2018-01-29 23:21:17,030 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1002445124, now seen corresponding path program 2 times [2018-01-29 23:21:17,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:17,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:17,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:17,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:17,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:17,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-29 23:21:17,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:17,215 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:17,223 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:21:17,228 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:17,244 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:17,256 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:17,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-29 23:21:17,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:17,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-01-29 23:21:17,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:21:17,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:21:17,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:21:17,304 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 13 states. [2018-01-29 23:21:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:17,429 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-01-29 23:21:17,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:21:17,433 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2018-01-29 23:21:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:17,434 INFO L225 Difference]: With dead ends: 149 [2018-01-29 23:21:17,434 INFO L226 Difference]: Without dead ends: 106 [2018-01-29 23:21:17,434 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:21:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-29 23:21:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2018-01-29 23:21:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-29 23:21:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-01-29 23:21:17,438 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 90 [2018-01-29 23:21:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:17,439 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-01-29 23:21:17,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:21:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-01-29 23:21:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-29 23:21:17,440 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:17,440 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 4, 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] [2018-01-29 23:21:17,440 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1388396443, now seen corresponding path program 3 times [2018-01-29 23:21:17,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:17,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:17,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:17,441 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:17,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:17,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-01-29 23:21:17,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:17,572 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:21:17,579 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:21:17,584 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:17,592 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:17,597 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:17,599 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:17,599 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:17,601 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-01-29 23:21:17,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:17,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-29 23:21:17,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:21:17,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:21:17,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:21:17,625 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 9 states. [2018-01-29 23:21:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:17,694 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-01-29 23:21:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:21:17,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-01-29 23:21:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:17,695 INFO L225 Difference]: With dead ends: 131 [2018-01-29 23:21:17,695 INFO L226 Difference]: Without dead ends: 110 [2018-01-29 23:21:17,696 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:21:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-29 23:21:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-01-29 23:21:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-29 23:21:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-01-29 23:21:17,702 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 98 [2018-01-29 23:21:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:17,703 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-01-29 23:21:17,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:21:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-01-29 23:21:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-29 23:21:17,703 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:17,704 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:17,704 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1569034573, now seen corresponding path program 4 times [2018-01-29 23:21:17,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:17,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:17,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:17,704 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:17,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:17,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 132 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-29 23:21:17,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:17,844 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:17,853 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:21:17,869 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:17,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:17,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-29 23:21:17,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:17,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:21:17,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:21:17,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:17,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:21:17,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:17,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:21:17,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:21:18,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:18,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:18,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:21:18,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:18,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:21:18,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-01-29 23:21:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-29 23:21:18,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:18,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2018-01-29 23:21:18,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 23:21:18,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 23:21:18,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:21:18,415 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 33 states. [2018-01-29 23:21:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:19,246 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2018-01-29 23:21:19,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-29 23:21:19,247 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-01-29 23:21:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:19,247 INFO L225 Difference]: With dead ends: 184 [2018-01-29 23:21:19,247 INFO L226 Difference]: Without dead ends: 135 [2018-01-29 23:21:19,249 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=373, Invalid=3167, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 23:21:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-29 23:21:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2018-01-29 23:21:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-29 23:21:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-01-29 23:21:19,253 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 104 [2018-01-29 23:21:19,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:19,253 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-01-29 23:21:19,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 23:21:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-01-29 23:21:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-29 23:21:19,254 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:19,254 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 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] [2018-01-29 23:21:19,254 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1914767369, now seen corresponding path program 5 times [2018-01-29 23:21:19,255 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:19,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:19,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:19,255 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:19,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:19,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 4 proven. 182 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-29 23:21:19,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:19,384 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:21:19,389 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:21:19,394 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:19,407 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:19,417 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:19,427 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:19,440 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:19,461 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:19,474 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:19,488 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:19,499 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:19,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-01-29 23:21:19,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:19,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-01-29 23:21:19,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:21:19,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:21:19,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:21:19,794 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 26 states. [2018-01-29 23:21:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:20,101 INFO L93 Difference]: Finished difference Result 206 states and 213 transitions. [2018-01-29 23:21:20,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 23:21:20,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 122 [2018-01-29 23:21:20,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:20,102 INFO L225 Difference]: With dead ends: 206 [2018-01-29 23:21:20,102 INFO L226 Difference]: Without dead ends: 147 [2018-01-29 23:21:20,103 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=440, Invalid=1816, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 23:21:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-29 23:21:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2018-01-29 23:21:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-29 23:21:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2018-01-29 23:21:20,107 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 122 [2018-01-29 23:21:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:20,107 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2018-01-29 23:21:20,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:21:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2018-01-29 23:21:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-01-29 23:21:20,108 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:20,108 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 3, 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] [2018-01-29 23:21:20,108 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:20,109 INFO L82 PathProgramCache]: Analyzing trace with hash 32565512, now seen corresponding path program 6 times [2018-01-29 23:21:20,109 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:20,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:20,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:20,109 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:20,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:20,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-01-29 23:21:20,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:20,377 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:20,382 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:21:20,387 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:20,393 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:20,404 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:20,420 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:20,423 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:20,425 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:20,427 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:20,429 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:20,432 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:20,432 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:20,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-29 23:21:20,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:20,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 30 [2018-01-29 23:21:20,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 23:21:20,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 23:21:20,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-01-29 23:21:20,610 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 30 states. [2018-01-29 23:21:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:20,927 INFO L93 Difference]: Finished difference Result 226 states and 233 transitions. [2018-01-29 23:21:20,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-29 23:21:20,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 136 [2018-01-29 23:21:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:20,940 INFO L225 Difference]: With dead ends: 226 [2018-01-29 23:21:20,940 INFO L226 Difference]: Without dead ends: 161 [2018-01-29 23:21:20,941 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=580, Invalid=2500, Unknown=0, NotChecked=0, Total=3080 [2018-01-29 23:21:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-29 23:21:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2018-01-29 23:21:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-29 23:21:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 156 transitions. [2018-01-29 23:21:20,946 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 156 transitions. Word has length 136 [2018-01-29 23:21:20,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:20,946 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 156 transitions. [2018-01-29 23:21:20,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 23:21:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2018-01-29 23:21:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-01-29 23:21:20,948 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:20,948 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 3, 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] [2018-01-29 23:21:20,948 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:20,948 INFO L82 PathProgramCache]: Analyzing trace with hash -355451495, now seen corresponding path program 7 times [2018-01-29 23:21:20,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:20,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:20,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:20,949 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:20,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:20,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 4 proven. 306 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-29 23:21:21,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:21,195 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:21:21,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:21,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-01-29 23:21:21,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:21,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-01-29 23:21:21,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:21:21,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:21:21,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:21:21,286 INFO L87 Difference]: Start difference. First operand 153 states and 156 transitions. Second operand 21 states. [2018-01-29 23:21:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:21,490 INFO L93 Difference]: Finished difference Result 237 states and 243 transitions. [2018-01-29 23:21:21,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 23:21:21,500 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 150 [2018-01-29 23:21:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:21,500 INFO L225 Difference]: With dead ends: 237 [2018-01-29 23:21:21,500 INFO L226 Difference]: Without dead ends: 166 [2018-01-29 23:21:21,501 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 23:21:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-29 23:21:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2018-01-29 23:21:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-29 23:21:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 164 transitions. [2018-01-29 23:21:21,504 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 164 transitions. Word has length 150 [2018-01-29 23:21:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:21,506 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 164 transitions. [2018-01-29 23:21:21,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:21:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 164 transitions. [2018-01-29 23:21:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-01-29 23:21:21,507 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:21,507 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 3, 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] [2018-01-29 23:21:21,507 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:21,508 INFO L82 PathProgramCache]: Analyzing trace with hash -545092670, now seen corresponding path program 8 times [2018-01-29 23:21:21,508 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:21,508 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:21,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:21,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:21,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:21,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 4 proven. 380 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-29 23:21:21,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:21,709 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:21,714 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:21:21,719 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:21,734 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:21,735 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:21,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-01-29 23:21:21,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:21,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-01-29 23:21:21,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 23:21:21,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 23:21:21,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:21:21,777 INFO L87 Difference]: Start difference. First operand 161 states and 164 transitions. Second operand 23 states. [2018-01-29 23:21:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:22,047 INFO L93 Difference]: Finished difference Result 245 states and 251 transitions. [2018-01-29 23:21:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 23:21:22,049 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 158 [2018-01-29 23:21:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:22,050 INFO L225 Difference]: With dead ends: 245 [2018-01-29 23:21:22,050 INFO L226 Difference]: Without dead ends: 174 [2018-01-29 23:21:22,050 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 23:21:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-29 23:21:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2018-01-29 23:21:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-29 23:21:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 172 transitions. [2018-01-29 23:21:22,054 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 172 transitions. Word has length 158 [2018-01-29 23:21:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:22,055 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 172 transitions. [2018-01-29 23:21:22,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 23:21:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2018-01-29 23:21:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-01-29 23:21:22,056 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:22,056 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 7, 6, 6, 6, 6, 6, 3, 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] [2018-01-29 23:21:22,056 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1694719765, now seen corresponding path program 9 times [2018-01-29 23:21:22,056 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:22,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:22,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:22,057 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:22,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:22,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 4 proven. 462 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-29 23:21:22,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:22,576 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:21:22,582 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:21:22,588 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:22,590 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:22,593 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:22,595 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:22,597 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:22,599 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:22,602 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:22,602 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:22,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 82 proven. 102 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-01-29 23:21:22,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:22,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 41 [2018-01-29 23:21:22,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 23:21:22,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 23:21:22,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1368, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:21:22,790 INFO L87 Difference]: Start difference. First operand 169 states and 172 transitions. Second operand 41 states. [2018-01-29 23:21:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:23,586 INFO L93 Difference]: Finished difference Result 262 states and 269 transitions. [2018-01-29 23:21:23,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-01-29 23:21:23,586 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 166 [2018-01-29 23:21:23,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:23,587 INFO L225 Difference]: With dead ends: 262 [2018-01-29 23:21:23,587 INFO L226 Difference]: Without dead ends: 191 [2018-01-29 23:21:23,588 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1282, Invalid=5858, Unknown=0, NotChecked=0, Total=7140 [2018-01-29 23:21:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-29 23:21:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2018-01-29 23:21:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-29 23:21:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 186 transitions. [2018-01-29 23:21:23,598 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 186 transitions. Word has length 166 [2018-01-29 23:21:23,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:23,599 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 186 transitions. [2018-01-29 23:21:23,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 23:21:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 186 transitions. [2018-01-29 23:21:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-01-29 23:21:23,599 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:23,600 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 8, 7, 7, 7, 7, 7, 3, 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] [2018-01-29 23:21:23,600 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:23,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1270813052, now seen corresponding path program 10 times [2018-01-29 23:21:23,600 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:23,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:23,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:23,600 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:23,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:23,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 4 proven. 552 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-01-29 23:21:23,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:23,856 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:23,861 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:21:23,875 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:23,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:23,919 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-29 23:21:23,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:23,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:21:23,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:21:23,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:23,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:21:23,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:23,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:21:23,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:21:24,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:24,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:24,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:24,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-01-29 23:21:24,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:24,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:21:24,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-29 23:21:24,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:24,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:24,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:24,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:24,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:24,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:24,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-01-29 23:21:24,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:24,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 23:21:24,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:42 [2018-01-29 23:21:25,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:25,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:25,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:25,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:25,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:25,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:25,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 37 treesize of output 60 [2018-01-29 23:21:25,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:25,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 23:21:25,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:49 [2018-01-29 23:21:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 19 proven. 135 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2018-01-29 23:21:28,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:28,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-01-29 23:21:28,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-29 23:21:28,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-29 23:21:28,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=2373, Unknown=15, NotChecked=0, Total=2652 [2018-01-29 23:21:28,304 INFO L87 Difference]: Start difference. First operand 183 states and 186 transitions. Second operand 52 states. [2018-01-29 23:21:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:32,314 INFO L93 Difference]: Finished difference Result 287 states and 295 transitions. [2018-01-29 23:21:32,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-01-29 23:21:32,314 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 180 [2018-01-29 23:21:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:32,315 INFO L225 Difference]: With dead ends: 287 [2018-01-29 23:21:32,315 INFO L226 Difference]: Without dead ends: 210 [2018-01-29 23:21:32,317 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1102, Invalid=8765, Unknown=33, NotChecked=0, Total=9900 [2018-01-29 23:21:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-29 23:21:32,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 201. [2018-01-29 23:21:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-29 23:21:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2018-01-29 23:21:32,321 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 180 [2018-01-29 23:21:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:32,322 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 204 transitions. [2018-01-29 23:21:32,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-29 23:21:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2018-01-29 23:21:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-01-29 23:21:32,322 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:32,322 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:32,322 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:32,322 INFO L82 PathProgramCache]: Analyzing trace with hash 562154470, now seen corresponding path program 11 times [2018-01-29 23:21:32,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:32,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:32,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:32,323 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:32,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:32,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 6 proven. 650 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-01-29 23:21:32,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:32,655 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:21:32,660 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:21:32,670 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,671 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,672 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,675 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,676 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,677 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,679 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,681 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,683 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,685 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,689 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,693 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,698 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,706 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:32,707 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:32,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-01-29 23:21:32,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:32,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-01-29 23:21:32,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 23:21:32,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 23:21:32,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:21:32,745 INFO L87 Difference]: Start difference. First operand 201 states and 204 transitions. Second operand 29 states. [2018-01-29 23:21:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:33,014 INFO L93 Difference]: Finished difference Result 301 states and 307 transitions. [2018-01-29 23:21:33,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-29 23:21:33,014 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 198 [2018-01-29 23:21:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:33,015 INFO L225 Difference]: With dead ends: 301 [2018-01-29 23:21:33,015 INFO L226 Difference]: Without dead ends: 214 [2018-01-29 23:21:33,015 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 23:21:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-01-29 23:21:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2018-01-29 23:21:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-29 23:21:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 212 transitions. [2018-01-29 23:21:33,020 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 212 transitions. Word has length 198 [2018-01-29 23:21:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:33,020 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 212 transitions. [2018-01-29 23:21:33,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 23:21:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 212 transitions. [2018-01-29 23:21:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-01-29 23:21:33,021 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:33,021 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:33,021 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:33,021 INFO L82 PathProgramCache]: Analyzing trace with hash 69846031, now seen corresponding path program 12 times [2018-01-29 23:21:33,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:33,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:33,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:33,022 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:33,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:33,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 6 proven. 140 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2018-01-29 23:21:33,442 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:33,442 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:33,447 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:21:33,454 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,465 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,471 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,473 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,475 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,476 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,479 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,481 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,483 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,485 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,488 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,490 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,493 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,496 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,500 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:21:33,500 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:33,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-01-29 23:21:33,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:33,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-01-29 23:21:33,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:21:33,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:21:33,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:21:33,534 INFO L87 Difference]: Start difference. First operand 209 states and 212 transitions. Second operand 17 states. [2018-01-29 23:21:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:33,695 INFO L93 Difference]: Finished difference Result 259 states and 264 transitions. [2018-01-29 23:21:33,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:21:33,695 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 206 [2018-01-29 23:21:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:33,696 INFO L225 Difference]: With dead ends: 259 [2018-01-29 23:21:33,696 INFO L226 Difference]: Without dead ends: 218 [2018-01-29 23:21:33,696 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:21:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-29 23:21:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2018-01-29 23:21:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-29 23:21:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 218 transitions. [2018-01-29 23:21:33,701 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 218 transitions. Word has length 206 [2018-01-29 23:21:33,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:33,701 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 218 transitions. [2018-01-29 23:21:33,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:21:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 218 transitions. [2018-01-29 23:21:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-01-29 23:21:33,702 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:33,702 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 9, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:33,702 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1941422839, now seen corresponding path program 13 times [2018-01-29 23:21:33,702 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:33,702 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:33,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:33,703 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:33,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:33,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 6 proven. 756 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-01-29 23:21:34,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:34,217 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:21:34,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:34,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-01-29 23:21:34,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:34,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-01-29 23:21:34,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:21:34,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:21:34,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:21:34,297 INFO L87 Difference]: Start difference. First operand 215 states and 218 transitions. Second operand 31 states. [2018-01-29 23:21:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:34,776 INFO L93 Difference]: Finished difference Result 321 states and 327 transitions. [2018-01-29 23:21:34,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-29 23:21:34,776 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 212 [2018-01-29 23:21:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:34,777 INFO L225 Difference]: With dead ends: 321 [2018-01-29 23:21:34,777 INFO L226 Difference]: Without dead ends: 228 [2018-01-29 23:21:34,777 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 23:21:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-29 23:21:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 223. [2018-01-29 23:21:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-29 23:21:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 226 transitions. [2018-01-29 23:21:34,782 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 226 transitions. Word has length 212 [2018-01-29 23:21:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:34,782 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 226 transitions. [2018-01-29 23:21:34,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:21:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 226 transitions. [2018-01-29 23:21:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-29 23:21:34,783 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:34,783 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 9, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:34,783 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:34,783 INFO L82 PathProgramCache]: Analyzing trace with hash 422690656, now seen corresponding path program 14 times [2018-01-29 23:21:34,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:34,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:34,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:34,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:21:34,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:34,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 6 proven. 870 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-01-29 23:21:35,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:35,984 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:35,989 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:21:35,995 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:36,007 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:21:36,009 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:36,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-01-29 23:21:36,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:36,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-01-29 23:21:36,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 23:21:36,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 23:21:36,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:21:36,050 INFO L87 Difference]: Start difference. First operand 223 states and 226 transitions. Second operand 33 states. [2018-01-29 23:21:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:36,416 INFO L93 Difference]: Finished difference Result 329 states and 335 transitions. [2018-01-29 23:21:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-29 23:21:36,424 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 220 [2018-01-29 23:21:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:36,424 INFO L225 Difference]: With dead ends: 329 [2018-01-29 23:21:36,424 INFO L226 Difference]: Without dead ends: 236 [2018-01-29 23:21:36,425 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-01-29 23:21:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-29 23:21:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2018-01-29 23:21:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-29 23:21:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 234 transitions. [2018-01-29 23:21:36,430 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 234 transitions. Word has length 220 [2018-01-29 23:21:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:36,431 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 234 transitions. [2018-01-29 23:21:36,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 23:21:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 234 transitions. [2018-01-29 23:21:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-29 23:21:36,431 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:36,431 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 9, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:36,431 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:36,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1661027017, now seen corresponding path program 15 times [2018-01-29 23:21:36,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:36,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:36,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:36,432 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:36,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:36,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 6 proven. 184 refuted. 0 times theorem prover too weak. 1031 trivial. 0 not checked. [2018-01-29 23:21:37,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:37,241 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:21:37,245 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:21:37,253 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:37,262 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:37,272 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:37,282 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:37,292 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:37,294 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:37,296 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:37,299 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:37,303 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:21:37,304 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:37,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2018-01-29 23:21:37,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:37,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-01-29 23:21:37,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:21:37,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:21:37,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:21:37,347 INFO L87 Difference]: Start difference. First operand 231 states and 234 transitions. Second operand 19 states. [2018-01-29 23:21:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:21:37,802 INFO L93 Difference]: Finished difference Result 281 states and 286 transitions. [2018-01-29 23:21:37,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 23:21:37,802 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 228 [2018-01-29 23:21:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:21:37,803 INFO L225 Difference]: With dead ends: 281 [2018-01-29 23:21:37,803 INFO L226 Difference]: Without dead ends: 240 [2018-01-29 23:21:37,803 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:21:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-29 23:21:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-01-29 23:21:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-29 23:21:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 240 transitions. [2018-01-29 23:21:37,808 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 240 transitions. Word has length 228 [2018-01-29 23:21:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:21:37,808 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 240 transitions. [2018-01-29 23:21:37,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:21:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 240 transitions. [2018-01-29 23:21:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-01-29 23:21:37,809 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:21:37,809 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 10, 9, 9, 9, 9, 9, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:21:37,809 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:21:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash -708850127, now seen corresponding path program 16 times [2018-01-29 23:21:37,809 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:21:37,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:21:37,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:37,810 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:21:37,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:21:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:21:37,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:21:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 6 proven. 234 refuted. 0 times theorem prover too weak. 1031 trivial. 0 not checked. [2018-01-29 23:21:38,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:21:38,459 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:21:38,464 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:21:38,485 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:21:38,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:21:38,606 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-29 23:21:38,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:38,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:21:38,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:21:38,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:21:38,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:38,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:21:38,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:21:38,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-01-29 23:21:38,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:38,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:21:38,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-29 23:21:38,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:38,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-01-29 23:21:38,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:38,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:21:38,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:42 [2018-01-29 23:21:39,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:39,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2018-01-29 23:21:39,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:39,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 23:21:39,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:54 [2018-01-29 23:21:45,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:21:45,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 83 [2018-01-29 23:21:45,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:21:45,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-29 23:21:45,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:62, output treesize:61 [2018-01-29 23:21:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 38 proven. 230 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-01-29 23:21:49,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:21:49,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 34] total 53 [2018-01-29 23:21:49,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-29 23:21:49,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-29 23:21:49,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2462, Unknown=13, NotChecked=0, Total=2756 [2018-01-29 23:21:49,840 INFO L87 Difference]: Start difference. First operand 237 states and 240 transitions. Second operand 53 states. [2018-01-29 23:22:02,409 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 45 [2018-01-29 23:22:05,232 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-29 23:22:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:06,949 INFO L93 Difference]: Finished difference Result 301 states and 308 transitions. [2018-01-29 23:22:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-29 23:22:06,953 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 234 [2018-01-29 23:22:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:06,954 INFO L225 Difference]: With dead ends: 301 [2018-01-29 23:22:06,954 INFO L226 Difference]: Without dead ends: 260 [2018-01-29 23:22:06,955 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3006 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=983, Invalid=9086, Unknown=31, NotChecked=0, Total=10100 [2018-01-29 23:22:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-01-29 23:22:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2018-01-29 23:22:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-29 23:22:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 256 transitions. [2018-01-29 23:22:06,962 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 256 transitions. Word has length 234 [2018-01-29 23:22:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:06,963 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 256 transitions. [2018-01-29 23:22:06,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-29 23:22:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 256 transitions. [2018-01-29 23:22:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-01-29 23:22:06,963 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:06,963 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 10, 10, 10, 10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:06,963 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1850832026, now seen corresponding path program 17 times [2018-01-29 23:22:06,964 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:06,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:06,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:06,964 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:06,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:06,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 8 proven. 992 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-01-29 23:22:07,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:07,732 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:07,736 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:22:07,748 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,760 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,770 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,783 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,793 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,803 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,817 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,824 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,837 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,850 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,864 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,877 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,885 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,895 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,905 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,915 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,931 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:07,938 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:07,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-01-29 23:22:07,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:07,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-01-29 23:22:07,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 23:22:07,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 23:22:07,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:22:07,984 INFO L87 Difference]: Start difference. First operand 253 states and 256 transitions. Second operand 35 states. [2018-01-29 23:22:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:08,367 INFO L93 Difference]: Finished difference Result 381 states and 387 transitions. [2018-01-29 23:22:08,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-29 23:22:08,376 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 250 [2018-01-29 23:22:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:08,377 INFO L225 Difference]: With dead ends: 381 [2018-01-29 23:22:08,377 INFO L226 Difference]: Without dead ends: 266 [2018-01-29 23:22:08,378 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-01-29 23:22:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-29 23:22:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 261. [2018-01-29 23:22:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-01-29 23:22:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 264 transitions. [2018-01-29 23:22:08,384 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 264 transitions. Word has length 250 [2018-01-29 23:22:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:08,384 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 264 transitions. [2018-01-29 23:22:08,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 23:22:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 264 transitions. [2018-01-29 23:22:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-01-29 23:22:08,385 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:08,385 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 11, 10, 10, 10, 10, 10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:08,385 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:08,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1781278141, now seen corresponding path program 18 times [2018-01-29 23:22:08,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:08,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:08,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:08,386 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:08,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:08,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 8 proven. 1122 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-01-29 23:22:08,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:08,839 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:22:08,844 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:22:08,852 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,853 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,855 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,856 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,858 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,860 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,862 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,864 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,867 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,869 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,872 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,874 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,877 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,881 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,885 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,889 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,894 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,900 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:08,900 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:08,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2018-01-29 23:22:09,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:09,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 23] total 58 [2018-01-29 23:22:09,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-29 23:22:09,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-29 23:22:09,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2804, Unknown=0, NotChecked=0, Total=3306 [2018-01-29 23:22:09,246 INFO L87 Difference]: Start difference. First operand 261 states and 264 transitions. Second operand 58 states. [2018-01-29 23:22:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:10,760 INFO L93 Difference]: Finished difference Result 398 states and 405 transitions. [2018-01-29 23:22:10,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-01-29 23:22:10,761 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 258 [2018-01-29 23:22:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:10,762 INFO L225 Difference]: With dead ends: 398 [2018-01-29 23:22:10,762 INFO L226 Difference]: Without dead ends: 283 [2018-01-29 23:22:10,763 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2220, Invalid=10212, Unknown=0, NotChecked=0, Total=12432 [2018-01-29 23:22:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-29 23:22:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2018-01-29 23:22:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-01-29 23:22:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2018-01-29 23:22:10,769 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 258 [2018-01-29 23:22:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:10,770 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2018-01-29 23:22:10,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-01-29 23:22:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2018-01-29 23:22:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-01-29 23:22:10,770 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:10,771 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 12, 11, 11, 11, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:10,771 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:10,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1357738284, now seen corresponding path program 19 times [2018-01-29 23:22:10,771 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:10,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:10,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:10,771 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:10,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:10,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 8 proven. 1260 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2018-01-29 23:22:11,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:11,294 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:11,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:11,322 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2018-01-29 23:22:11,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:11,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-01-29 23:22:11,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 23:22:11,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 23:22:11,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 23:22:11,374 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand 39 states. [2018-01-29 23:22:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:13,037 INFO L93 Difference]: Finished difference Result 409 states and 415 transitions. [2018-01-29 23:22:13,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-29 23:22:13,037 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 272 [2018-01-29 23:22:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:13,038 INFO L225 Difference]: With dead ends: 409 [2018-01-29 23:22:13,038 INFO L226 Difference]: Without dead ends: 288 [2018-01-29 23:22:13,039 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-01-29 23:22:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-29 23:22:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 283. [2018-01-29 23:22:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 23:22:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 286 transitions. [2018-01-29 23:22:13,046 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 286 transitions. Word has length 272 [2018-01-29 23:22:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:13,046 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 286 transitions. [2018-01-29 23:22:13,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 23:22:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 286 transitions. [2018-01-29 23:22:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-01-29 23:22:13,047 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:13,047 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 12, 11, 11, 11, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:13,047 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash -179740739, now seen corresponding path program 20 times [2018-01-29 23:22:13,047 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:13,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:13,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:13,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:13,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:13,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1838 backedges. 8 proven. 1406 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2018-01-29 23:22:13,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:13,603 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:22:13,608 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:22:13,614 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:13,628 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:13,631 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:13,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1838 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2018-01-29 23:22:13,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:13,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-01-29 23:22:13,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 23:22:13,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 23:22:13,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:22:13,683 INFO L87 Difference]: Start difference. First operand 283 states and 286 transitions. Second operand 41 states. [2018-01-29 23:22:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:14,157 INFO L93 Difference]: Finished difference Result 417 states and 423 transitions. [2018-01-29 23:22:14,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-01-29 23:22:14,157 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 280 [2018-01-29 23:22:14,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:14,158 INFO L225 Difference]: With dead ends: 417 [2018-01-29 23:22:14,158 INFO L226 Difference]: Without dead ends: 296 [2018-01-29 23:22:14,159 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-01-29 23:22:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-01-29 23:22:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2018-01-29 23:22:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-29 23:22:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2018-01-29 23:22:14,166 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 280 [2018-01-29 23:22:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:14,166 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2018-01-29 23:22:14,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 23:22:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2018-01-29 23:22:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-01-29 23:22:14,167 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:14,167 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 12, 11, 11, 11, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:14,167 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash 838416294, now seen corresponding path program 21 times [2018-01-29 23:22:14,167 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:14,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:14,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:14,168 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:14,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:14,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1992 backedges. 8 proven. 1560 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2018-01-29 23:22:14,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:14,817 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:14,822 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:22:14,829 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,831 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,833 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,836 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,839 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,842 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,845 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,849 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,853 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,859 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,865 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,872 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:14,873 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:14,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1992 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-01-29 23:22:15,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:15,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 25] total 66 [2018-01-29 23:22:15,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-01-29 23:22:15,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-01-29 23:22:15,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=3640, Unknown=0, NotChecked=0, Total=4290 [2018-01-29 23:22:15,257 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand 66 states. [2018-01-29 23:22:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:16,534 INFO L93 Difference]: Finished difference Result 434 states and 441 transitions. [2018-01-29 23:22:16,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-01-29 23:22:16,546 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 288 [2018-01-29 23:22:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:16,548 INFO L225 Difference]: With dead ends: 434 [2018-01-29 23:22:16,548 INFO L226 Difference]: Without dead ends: 313 [2018-01-29 23:22:16,549 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3278 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2920, Invalid=13336, Unknown=0, NotChecked=0, Total=16256 [2018-01-29 23:22:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-29 23:22:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 305. [2018-01-29 23:22:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-01-29 23:22:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 308 transitions. [2018-01-29 23:22:16,557 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 308 transitions. Word has length 288 [2018-01-29 23:22:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:16,558 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 308 transitions. [2018-01-29 23:22:16,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-01-29 23:22:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 308 transitions. [2018-01-29 23:22:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-01-29 23:22:16,558 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:16,559 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 13, 12, 12, 12, 12, 12, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:16,559 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash 580884535, now seen corresponding path program 22 times [2018-01-29 23:22:16,559 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:16,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:16,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:16,559 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:16,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:16,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2222 backedges. 8 proven. 420 refuted. 0 times theorem prover too weak. 1794 trivial. 0 not checked. [2018-01-29 23:22:17,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:17,367 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-29 23:22:17,372 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:22:17,403 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:17,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:17,512 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-29 23:22:17,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:17,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:17,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:22:17,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:22:17,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:17,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:17,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:22:17,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-01-29 23:22:17,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:17,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:22:17,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-29 23:22:17,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-01-29 23:22:17,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:17,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:22:17,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:42 [2018-01-29 23:22:17,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:17,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2018-01-29 23:22:17,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:17,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 23:22:17,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:54 [2018-01-29 23:22:18,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 103 [2018-01-29 23:22:18,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:18,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 23:22:18,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:66 [2018-01-29 23:22:18,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:18,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 134 [2018-01-29 23:22:18,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:18,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-29 23:22:18,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:79, output treesize:78 Received shutdown request... [2018-01-29 23:22:26,383 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 23:22:26,383 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:22:26,385 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:22:26,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:22:26 BoogieIcfgContainer [2018-01-29 23:22:26,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:22:26,386 INFO L168 Benchmark]: Toolchain (without parser) took 72770.92 ms. Allocated memory was 148.4 MB in the beginning and 640.7 MB in the end (delta: 492.3 MB). Free memory was 114.6 MB in the beginning and 159.4 MB in the end (delta: -44.8 MB). Peak memory consumption was 447.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:22:26,387 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 148.4 MB. Free memory is still 119.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:22:26,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 118.34 ms. Allocated memory is still 148.4 MB. Free memory was 114.4 MB in the beginning and 106.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:22:26,387 INFO L168 Benchmark]: Boogie Preprocessor took 16.39 ms. Allocated memory is still 148.4 MB. Free memory was 106.3 MB in the beginning and 105.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-01-29 23:22:26,387 INFO L168 Benchmark]: RCFGBuilder took 310.91 ms. Allocated memory is still 148.4 MB. Free memory was 104.8 MB in the beginning and 92.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:22:26,387 INFO L168 Benchmark]: TraceAbstraction took 72322.35 ms. Allocated memory was 148.4 MB in the beginning and 640.7 MB in the end (delta: 492.3 MB). Free memory was 91.9 MB in the beginning and 159.4 MB in the end (delta: -67.5 MB). Peak memory consumption was 424.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:22:26,388 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 148.4 MB. Free memory is still 119.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 118.34 ms. Allocated memory is still 148.4 MB. Free memory was 114.4 MB in the beginning and 106.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 16.39 ms. Allocated memory is still 148.4 MB. Free memory was 106.3 MB in the beginning and 105.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 310.91 ms. Allocated memory is still 148.4 MB. Free memory was 104.8 MB in the beginning and 92.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 72322.35 ms. Allocated memory was 148.4 MB in the beginning and 640.7 MB in the end (delta: 492.3 MB). Free memory was 91.9 MB in the beginning and 159.4 MB in the end (delta: -67.5 MB). Peak memory consumption was 424.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 22, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. TIMEOUT Result, 72.2s OverallTime, 29 OverallIterations, 22 TraceHistogramMax, 32.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1043 SDtfs, 1917 SDslu, 16646 SDs, 0 SdLazy, 8124 SolverSat, 605 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5301 GetRequests, 3986 SyntacticMatches, 2 SemanticMatches, 1313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19999 ImplicationChecksByTransitivity, 43.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 157 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 8340 NumberOfCodeBlocks, 8017 NumberOfCodeBlocksAsserted, 163 NumberOfCheckSat, 8287 ConstructedInterpolants, 116 QuantifiedInterpolants, 4084054 SizeOfPredicates, 457 NumberOfNonLiveVariables, 5473 ConjunctsInSsa, 566 ConjunctsInUnsatCore, 53 InterpolantComputations, 3 PerfectInterpolantSequences, 16303/36378 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_copy1_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-22-26-392.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_copy1_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-22-26-392.csv Completed graceful shutdown