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-programs/copysome2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:27:09,508 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:27:09,509 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:27:09,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:27:09,520 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:27:09,521 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:27:09,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:27:09,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:27:09,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:27:09,525 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:27:09,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:27:09,525 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:27:09,526 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:27:09,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:27:09,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:27:09,528 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:27:09,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:27:09,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:27:09,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:27:09,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:27:09,534 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:27:09,534 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:27:09,534 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:27:09,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:27:09,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:27:09,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:27:09,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:27:09,543 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:27:09,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:27:09,543 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:27:09,544 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:27:09,544 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-30 01:27:09,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:27:09,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:27:09,556 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:27:09,556 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:27:09,556 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:27:09,556 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:27:09,556 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:27:09,556 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:27:09,556 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:27:09,556 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:27:09,557 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:27:09,557 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:27:09,558 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:27:09,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:27:09,561 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:27:09,561 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:27:09,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:27:09,595 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:27:09,597 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:27:09,598 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:27:09,598 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:27:09,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/copysome2_true-unreach-call.i [2018-01-30 01:27:09,661 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:27:09,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:27:09,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:27:09,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:27:09,666 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:27:09,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:27:09" (1/1) ... [2018-01-30 01:27:09,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260a68d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09, skipping insertion in model container [2018-01-30 01:27:09,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:27:09" (1/1) ... [2018-01-30 01:27:09,677 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:27:09,686 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:27:09,754 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:27:09,763 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:27:09,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09 WrapperNode [2018-01-30 01:27:09,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:27:09,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:27:09,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:27:09,766 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:27:09,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09" (1/1) ... [2018-01-30 01:27:09,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09" (1/1) ... [2018-01-30 01:27:09,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09" (1/1) ... [2018-01-30 01:27:09,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09" (1/1) ... [2018-01-30 01:27:09,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09" (1/1) ... [2018-01-30 01:27:09,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09" (1/1) ... [2018-01-30 01:27:09,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09" (1/1) ... [2018-01-30 01:27:09,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:27:09,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:27:09,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:27:09,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:27:09,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09" (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-30 01:27:09,825 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:27:09,825 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:27:09,825 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 01:27:09,825 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:27:09,825 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:27:09,825 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 01:27:09,825 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:27:09,825 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:27:09,825 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:27:09,826 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:27:10,164 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:27:10,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:27:10 BoogieIcfgContainer [2018-01-30 01:27:10,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:27:10,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:27:10,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:27:10,167 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:27:10,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:27:09" (1/3) ... [2018-01-30 01:27:10,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe3d63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:27:10, skipping insertion in model container [2018-01-30 01:27:10,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:27:09" (2/3) ... [2018-01-30 01:27:10,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe3d63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:27:10, skipping insertion in model container [2018-01-30 01:27:10,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:27:10" (3/3) ... [2018-01-30 01:27:10,169 INFO L107 eAbstractionObserver]: Analyzing ICFG copysome2_true-unreach-call.i [2018-01-30 01:27:10,174 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:27:10,178 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:27:10,203 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:27:10,203 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:27:10,203 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:27:10,203 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:27:10,203 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:27:10,203 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:27:10,203 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:27:10,203 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:27:10,204 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:27:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-30 01:27:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 01:27:10,217 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:10,217 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, 1, 1] [2018-01-30 01:27:10,217 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1355861330, now seen corresponding path program 1 times [2018-01-30 01:27:10,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:10,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:10,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:10,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:10,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:10,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:10,285 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-30 01:27:10,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:27:10,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 01:27:10,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 01:27:10,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 01:27:10,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 01:27:10,296 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-01-30 01:27:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:10,310 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-01-30 01:27:10,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 01:27:10,311 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-30 01:27:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:10,316 INFO L225 Difference]: With dead ends: 97 [2018-01-30 01:27:10,316 INFO L226 Difference]: Without dead ends: 56 [2018-01-30 01:27:10,318 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-30 01:27:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-30 01:27:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-30 01:27:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-30 01:27:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-01-30 01:27:10,340 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 24 [2018-01-30 01:27:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:10,340 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-01-30 01:27:10,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 01:27:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-01-30 01:27:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 01:27:10,341 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:10,341 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:10,341 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1747469621, now seen corresponding path program 1 times [2018-01-30 01:27:10,342 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:10,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:10,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:10,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:10,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:10,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:10,421 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-30 01:27:10,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:27:10,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:27:10,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:27:10,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:27:10,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:27:10,423 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 3 states. [2018-01-30 01:27:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:10,682 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-01-30 01:27:10,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:27:10,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-30 01:27:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:10,683 INFO L225 Difference]: With dead ends: 113 [2018-01-30 01:27:10,683 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 01:27:10,684 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-30 01:27:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 01:27:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2018-01-30 01:27:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 01:27:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-30 01:27:10,688 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 27 [2018-01-30 01:27:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:10,689 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-30 01:27:10,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:27:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-30 01:27:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 01:27:10,690 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:10,690 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:10,690 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 574674065, now seen corresponding path program 1 times [2018-01-30 01:27:10,690 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:10,690 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:10,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:10,691 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:10,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:10,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:27:10,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:27:10,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:27:10,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:27:10,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:27:10,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:27:10,823 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-30 01:27:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:10,977 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-30 01:27:10,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:27:10,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-01-30 01:27:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:10,978 INFO L225 Difference]: With dead ends: 113 [2018-01-30 01:27:10,978 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 01:27:10,979 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:27:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 01:27:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2018-01-30 01:27:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 01:27:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-01-30 01:27:10,984 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 54 [2018-01-30 01:27:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:10,984 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-01-30 01:27:10,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:27:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-01-30 01:27:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 01:27:10,985 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:10,985 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:10,985 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1404834879, now seen corresponding path program 1 times [2018-01-30 01:27:10,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:10,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:10,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:10,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:10,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:10,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:27:11,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:11,046 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-30 01:27:11,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:11,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:27:11,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:11,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:27:11,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:27:11,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:27:11,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:27:11,113 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 5 states. [2018-01-30 01:27:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:11,284 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2018-01-30 01:27:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:27:11,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-01-30 01:27:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:11,285 INFO L225 Difference]: With dead ends: 132 [2018-01-30 01:27:11,285 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 01:27:11,285 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 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-30 01:27:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 01:27:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2018-01-30 01:27:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 01:27:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-01-30 01:27:11,289 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 55 [2018-01-30 01:27:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:11,290 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-01-30 01:27:11,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:27:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-01-30 01:27:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 01:27:11,291 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:11,291 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:11,291 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1203091819, now seen corresponding path program 2 times [2018-01-30 01:27:11,291 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:11,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:11,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:11,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:11,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:11,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 01:27:11,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:11,397 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-30 01:27:11,401 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:27:11,408 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:11,426 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:11,439 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:11,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:27:11,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:11,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-01-30 01:27:11,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 01:27:11,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 01:27:11,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:27:11,655 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 8 states. [2018-01-30 01:27:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:11,907 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2018-01-30 01:27:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 01:27:11,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-01-30 01:27:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:11,912 INFO L225 Difference]: With dead ends: 153 [2018-01-30 01:27:11,913 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 01:27:11,914 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-30 01:27:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 01:27:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2018-01-30 01:27:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-30 01:27:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-30 01:27:11,920 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 69 [2018-01-30 01:27:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:11,920 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-30 01:27:11,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 01:27:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-30 01:27:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-30 01:27:11,922 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:11,922 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:11,922 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1568344191, now seen corresponding path program 1 times [2018-01-30 01:27:11,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:11,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:11,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:11,923 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:11,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:11,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 01:27:11,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:11,988 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:11,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:12,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:27:12,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:12,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-30 01:27:12,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 01:27:12,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 01:27:12,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-30 01:27:12,121 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 13 states. [2018-01-30 01:27:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:12,507 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-01-30 01:27:12,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 01:27:12,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2018-01-30 01:27:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:12,508 INFO L225 Difference]: With dead ends: 180 [2018-01-30 01:27:12,508 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 01:27:12,508 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-01-30 01:27:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 01:27:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-01-30 01:27:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 01:27:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-01-30 01:27:12,514 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 89 [2018-01-30 01:27:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:12,514 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-01-30 01:27:12,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 01:27:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-01-30 01:27:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-30 01:27:12,515 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:12,515 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:12,515 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:12,515 INFO L82 PathProgramCache]: Analyzing trace with hash 996297061, now seen corresponding path program 3 times [2018-01-30 01:27:12,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:12,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:12,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:12,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:12,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:12,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 01:27:12,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:12,589 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-30 01:27:12,597 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:27:12,604 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:12,617 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:12,632 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:12,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 01:27:12,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:12,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:27:12,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:27:12,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:27:12,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:27:12,676 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 5 states. [2018-01-30 01:27:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:12,759 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-01-30 01:27:12,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:27:12,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-01-30 01:27:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:12,760 INFO L225 Difference]: With dead ends: 139 [2018-01-30 01:27:12,760 INFO L226 Difference]: Without dead ends: 125 [2018-01-30 01:27:12,761 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 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-30 01:27:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-30 01:27:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 118. [2018-01-30 01:27:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-30 01:27:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-30 01:27:12,766 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 104 [2018-01-30 01:27:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:12,766 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-30 01:27:12,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:27:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-30 01:27:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 01:27:12,767 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:12,767 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:12,767 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:12,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1327782907, now seen corresponding path program 4 times [2018-01-30 01:27:12,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:12,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:12,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:12,768 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:12,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:12,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 01:27:12,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:12,847 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-30 01:27:12,852 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:27:12,867 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:12,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:12,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-30 01:27:12,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:12,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:12,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:27:12,987 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 15 [2018-01-30 01:27:12,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:13,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:13,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-30 01:27:13,027 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-30 01:27:13,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:13,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:13,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-01-30 01:27:13,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 01:27:13,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:13,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 20 [2018-01-30 01:27:13,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:27:13,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 01:27:13,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-01-30 01:27:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-30 01:27:13,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:13,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-01-30 01:27:13,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 01:27:13,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 01:27:13,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-01-30 01:27:13,176 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 18 states. [2018-01-30 01:27:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:13,699 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2018-01-30 01:27:13,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 01:27:13,700 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-01-30 01:27:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:13,702 INFO L225 Difference]: With dead ends: 226 [2018-01-30 01:27:13,702 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 01:27:13,702 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2018-01-30 01:27:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 01:27:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2018-01-30 01:27:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-30 01:27:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-01-30 01:27:13,711 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 111 [2018-01-30 01:27:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:13,711 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-01-30 01:27:13,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 01:27:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-01-30 01:27:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-30 01:27:13,712 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:13,712 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:13,712 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:13,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1339819037, now seen corresponding path program 2 times [2018-01-30 01:27:13,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:13,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:13,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:13,713 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:13,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:13,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 01:27:13,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:13,790 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-30 01:27:13,796 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:27:13,804 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:13,810 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:13,817 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:13,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-30 01:27:13,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:13,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2018-01-30 01:27:13,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 01:27:13,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 01:27:13,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:27:13,929 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 15 states. [2018-01-30 01:27:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:14,144 INFO L93 Difference]: Finished difference Result 254 states and 272 transitions. [2018-01-30 01:27:14,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 01:27:14,144 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2018-01-30 01:27:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:14,146 INFO L225 Difference]: With dead ends: 254 [2018-01-30 01:27:14,146 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 01:27:14,146 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2018-01-30 01:27:14,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 01:27:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2018-01-30 01:27:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-30 01:27:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2018-01-30 01:27:14,150 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 117 [2018-01-30 01:27:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:14,151 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2018-01-30 01:27:14,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 01:27:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2018-01-30 01:27:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 01:27:14,152 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:14,152 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:14,152 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:14,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1507124078, now seen corresponding path program 1 times [2018-01-30 01:27:14,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:14,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:14,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:14,153 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:14,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:14,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 01:27:14,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:14,269 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-30 01:27:14,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:14,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-01-30 01:27:14,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:14,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 15 [2018-01-30 01:27:14,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 01:27:14,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 01:27:14,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:27:14,607 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 15 states. [2018-01-30 01:27:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:14,887 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-01-30 01:27:14,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 01:27:14,888 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-01-30 01:27:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:14,888 INFO L225 Difference]: With dead ends: 247 [2018-01-30 01:27:14,888 INFO L226 Difference]: Without dead ends: 184 [2018-01-30 01:27:14,889 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2018-01-30 01:27:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-30 01:27:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2018-01-30 01:27:14,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-30 01:27:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 175 transitions. [2018-01-30 01:27:14,893 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 175 transitions. Word has length 142 [2018-01-30 01:27:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:14,893 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 175 transitions. [2018-01-30 01:27:14,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 01:27:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 175 transitions. [2018-01-30 01:27:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-01-30 01:27:14,894 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:14,894 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:14,894 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1262513604, now seen corresponding path program 2 times [2018-01-30 01:27:14,894 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:14,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:14,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:14,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:14,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:14,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 2 proven. 222 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-01-30 01:27:15,284 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:15,284 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-30 01:27:15,288 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:27:15,294 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:15,303 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:15,315 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:15,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-01-30 01:27:15,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:15,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-01-30 01:27:15,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 01:27:15,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 01:27:15,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:27:15,348 INFO L87 Difference]: Start difference. First operand 168 states and 175 transitions. Second operand 15 states. [2018-01-30 01:27:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:15,847 INFO L93 Difference]: Finished difference Result 264 states and 278 transitions. [2018-01-30 01:27:15,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 01:27:15,856 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 163 [2018-01-30 01:27:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:15,856 INFO L225 Difference]: With dead ends: 264 [2018-01-30 01:27:15,856 INFO L226 Difference]: Without dead ends: 193 [2018-01-30 01:27:15,857 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-01-30 01:27:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-30 01:27:15,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2018-01-30 01:27:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-30 01:27:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 189 transitions. [2018-01-30 01:27:15,860 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 189 transitions. Word has length 163 [2018-01-30 01:27:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:15,861 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 189 transitions. [2018-01-30 01:27:15,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 01:27:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 189 transitions. [2018-01-30 01:27:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-01-30 01:27:15,862 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:15,862 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:15,862 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1626880664, now seen corresponding path program 3 times [2018-01-30 01:27:15,862 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:15,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:15,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:15,863 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:15,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:15,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-30 01:27:15,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:15,947 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-30 01:27:15,951 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:27:15,957 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:15,974 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:15,983 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:15,986 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:15,986 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:15,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-01-30 01:27:16,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:16,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-30 01:27:16,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:27:16,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:27:16,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:27:16,025 INFO L87 Difference]: Start difference. First operand 182 states and 189 transitions. Second operand 9 states. [2018-01-30 01:27:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:16,161 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2018-01-30 01:27:16,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 01:27:16,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 177 [2018-01-30 01:27:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:16,162 INFO L225 Difference]: With dead ends: 216 [2018-01-30 01:27:16,162 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 01:27:16,163 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:27:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 01:27:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2018-01-30 01:27:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-30 01:27:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 198 transitions. [2018-01-30 01:27:16,166 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 198 transitions. Word has length 177 [2018-01-30 01:27:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:16,166 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 198 transitions. [2018-01-30 01:27:16,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:27:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 198 transitions. [2018-01-30 01:27:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 01:27:16,168 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:16,168 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:16,168 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2107933574, now seen corresponding path program 4 times [2018-01-30 01:27:16,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:16,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:16,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:16,168 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:16,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:16,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-30 01:27:16,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:16,277 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-30 01:27:16,281 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:27:16,303 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:16,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:16,323 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-30 01:27:16,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:27:16,348 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 15 [2018-01-30 01:27:16,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-30 01:27:16,414 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-30 01:27:16,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 01:27:16,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:16,549 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-30 01:27:16,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 01:27:16,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:16,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:16,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-01-30 01:27:16,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:27:16,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:16,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:16,615 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 21 treesize of output 28 [2018-01-30 01:27:16,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:16,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:15 [2018-01-30 01:27:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 1 proven. 81 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-01-30 01:27:16,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:16,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27] total 36 [2018-01-30 01:27:16,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 01:27:16,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 01:27:16,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 01:27:16,867 INFO L87 Difference]: Start difference. First operand 190 states and 198 transitions. Second operand 36 states. [2018-01-30 01:27:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:18,048 INFO L93 Difference]: Finished difference Result 319 states and 346 transitions. [2018-01-30 01:27:18,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-30 01:27:18,049 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 184 [2018-01-30 01:27:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:18,050 INFO L225 Difference]: With dead ends: 319 [2018-01-30 01:27:18,050 INFO L226 Difference]: Without dead ends: 298 [2018-01-30 01:27:18,051 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=513, Invalid=4043, Unknown=0, NotChecked=0, Total=4556 [2018-01-30 01:27:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-01-30 01:27:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 273. [2018-01-30 01:27:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-01-30 01:27:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 291 transitions. [2018-01-30 01:27:18,065 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 291 transitions. Word has length 184 [2018-01-30 01:27:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:18,065 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 291 transitions. [2018-01-30 01:27:18,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 01:27:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 291 transitions. [2018-01-30 01:27:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-01-30 01:27:18,067 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:18,067 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:27:18,067 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:18,068 INFO L82 PathProgramCache]: Analyzing trace with hash -924954944, now seen corresponding path program 1 times [2018-01-30 01:27:18,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:18,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:18,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:18,068 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:18,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:18,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2018-01-30 01:27:18,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:18,258 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-30 01:27:18,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:18,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-30 01:27:18,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:18,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17] total 23 [2018-01-30 01:27:18,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 01:27:18,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 01:27:18,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-01-30 01:27:18,408 INFO L87 Difference]: Start difference. First operand 273 states and 291 transitions. Second operand 23 states. [2018-01-30 01:27:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:18,759 INFO L93 Difference]: Finished difference Result 498 states and 540 transitions. [2018-01-30 01:27:18,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 01:27:18,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 197 [2018-01-30 01:27:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:18,761 INFO L225 Difference]: With dead ends: 498 [2018-01-30 01:27:18,761 INFO L226 Difference]: Without dead ends: 336 [2018-01-30 01:27:18,761 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=744, Invalid=2012, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 01:27:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-01-30 01:27:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2018-01-30 01:27:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-30 01:27:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 321 transitions. [2018-01-30 01:27:18,773 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 321 transitions. Word has length 197 [2018-01-30 01:27:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:18,773 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 321 transitions. [2018-01-30 01:27:18,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 01:27:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 321 transitions. [2018-01-30 01:27:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-01-30 01:27:18,774 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:18,774 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-01-30 01:27:18,774 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1154541749, now seen corresponding path program 5 times [2018-01-30 01:27:18,774 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:18,775 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:18,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:18,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:18,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:18,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2018-01-30 01:27:18,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:18,893 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-30 01:27:18,898 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:27:18,904 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:18,906 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:18,907 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:18,909 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:18,911 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:18,914 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:18,917 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:18,921 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:18,931 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:18,931 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:18,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-01-30 01:27:18,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:18,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-30 01:27:18,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:27:18,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:27:18,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:27:18,965 INFO L87 Difference]: Start difference. First operand 301 states and 321 transitions. Second operand 9 states. [2018-01-30 01:27:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:19,056 INFO L93 Difference]: Finished difference Result 397 states and 426 transitions. [2018-01-30 01:27:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 01:27:19,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 215 [2018-01-30 01:27:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:19,057 INFO L225 Difference]: With dead ends: 397 [2018-01-30 01:27:19,057 INFO L226 Difference]: Without dead ends: 324 [2018-01-30 01:27:19,058 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:27:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-01-30 01:27:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 301. [2018-01-30 01:27:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-30 01:27:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 321 transitions. [2018-01-30 01:27:19,066 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 321 transitions. Word has length 215 [2018-01-30 01:27:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:19,066 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 321 transitions. [2018-01-30 01:27:19,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:27:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 321 transitions. [2018-01-30 01:27:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-01-30 01:27:19,067 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:19,067 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:19,067 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash 152583934, now seen corresponding path program 2 times [2018-01-30 01:27:19,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:19,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:19,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:19,068 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:19,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:19,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-01-30 01:27:19,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:19,181 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-30 01:27:19,185 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:27:19,191 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:19,202 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:19,204 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:19,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 01:27:19,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:19,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 25 [2018-01-30 01:27:19,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 01:27:19,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 01:27:19,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-01-30 01:27:19,387 INFO L87 Difference]: Start difference. First operand 301 states and 321 transitions. Second operand 25 states. [2018-01-30 01:27:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:20,324 INFO L93 Difference]: Finished difference Result 439 states and 470 transitions. [2018-01-30 01:27:20,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 01:27:20,329 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 218 [2018-01-30 01:27:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:20,330 INFO L225 Difference]: With dead ends: 439 [2018-01-30 01:27:20,330 INFO L226 Difference]: Without dead ends: 263 [2018-01-30 01:27:20,331 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=718, Invalid=2362, Unknown=0, NotChecked=0, Total=3080 [2018-01-30 01:27:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-30 01:27:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2018-01-30 01:27:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-01-30 01:27:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 259 transitions. [2018-01-30 01:27:20,336 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 259 transitions. Word has length 218 [2018-01-30 01:27:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:20,336 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 259 transitions. [2018-01-30 01:27:20,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 01:27:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 259 transitions. [2018-01-30 01:27:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-01-30 01:27:20,337 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:20,337 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1] [2018-01-30 01:27:20,337 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1721181131, now seen corresponding path program 6 times [2018-01-30 01:27:20,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:20,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:20,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:20,338 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:20,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:20,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2018-01-30 01:27:20,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:20,734 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-30 01:27:20,739 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:27:20,746 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:20,748 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:20,750 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:20,752 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:20,755 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:20,758 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:20,761 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:20,764 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:20,767 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:20,768 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:20,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-01-30 01:27:20,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:20,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-30 01:27:20,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 01:27:20,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 01:27:20,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 01:27:20,806 INFO L87 Difference]: Start difference. First operand 249 states and 259 transitions. Second operand 11 states. [2018-01-30 01:27:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:21,095 INFO L93 Difference]: Finished difference Result 350 states and 370 transitions. [2018-01-30 01:27:21,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 01:27:21,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2018-01-30 01:27:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:21,096 INFO L225 Difference]: With dead ends: 350 [2018-01-30 01:27:21,096 INFO L226 Difference]: Without dead ends: 277 [2018-01-30 01:27:21,097 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-01-30 01:27:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-01-30 01:27:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 250. [2018-01-30 01:27:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-30 01:27:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 260 transitions. [2018-01-30 01:27:21,102 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 260 transitions. Word has length 236 [2018-01-30 01:27:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:21,102 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 260 transitions. [2018-01-30 01:27:21,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 01:27:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 260 transitions. [2018-01-30 01:27:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-01-30 01:27:21,104 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:21,104 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2018-01-30 01:27:21,104 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash -639663455, now seen corresponding path program 7 times [2018-01-30 01:27:21,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:21,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:21,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:21,105 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:21,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:21,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 4 proven. 80 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2018-01-30 01:27:21,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:21,315 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-30 01:27:21,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:21,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 522 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 01:27:21,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:21,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 26 [2018-01-30 01:27:21,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 01:27:21,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 01:27:21,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2018-01-30 01:27:21,478 INFO L87 Difference]: Start difference. First operand 250 states and 260 transitions. Second operand 26 states. [2018-01-30 01:27:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:21,845 INFO L93 Difference]: Finished difference Result 432 states and 458 transitions. [2018-01-30 01:27:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-30 01:27:21,846 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 243 [2018-01-30 01:27:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:21,846 INFO L225 Difference]: With dead ends: 432 [2018-01-30 01:27:21,847 INFO L226 Difference]: Without dead ends: 321 [2018-01-30 01:27:21,847 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=688, Invalid=2174, Unknown=0, NotChecked=0, Total=2862 [2018-01-30 01:27:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-30 01:27:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 271. [2018-01-30 01:27:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-30 01:27:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 282 transitions. [2018-01-30 01:27:21,855 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 282 transitions. Word has length 243 [2018-01-30 01:27:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:21,855 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 282 transitions. [2018-01-30 01:27:21,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 01:27:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2018-01-30 01:27:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-01-30 01:27:21,856 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:21,856 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:21,856 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash 783792053, now seen corresponding path program 3 times [2018-01-30 01:27:21,856 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:21,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:21,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:21,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:21,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:21,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 4 proven. 82 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2018-01-30 01:27:22,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:22,005 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-30 01:27:22,012 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:27:22,023 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:22,026 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:22,030 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:22,034 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:22,038 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:22,039 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:22,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-01-30 01:27:22,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:22,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-01-30 01:27:22,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 01:27:22,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 01:27:22,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:27:22,086 INFO L87 Difference]: Start difference. First operand 271 states and 282 transitions. Second operand 10 states. [2018-01-30 01:27:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:22,220 INFO L93 Difference]: Finished difference Result 375 states and 396 transitions. [2018-01-30 01:27:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 01:27:22,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 263 [2018-01-30 01:27:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:22,236 INFO L225 Difference]: With dead ends: 375 [2018-01-30 01:27:22,236 INFO L226 Difference]: Without dead ends: 302 [2018-01-30 01:27:22,237 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-01-30 01:27:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-01-30 01:27:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 271. [2018-01-30 01:27:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-30 01:27:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 282 transitions. [2018-01-30 01:27:22,242 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 282 transitions. Word has length 263 [2018-01-30 01:27:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:22,242 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 282 transitions. [2018-01-30 01:27:22,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 01:27:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2018-01-30 01:27:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-01-30 01:27:22,246 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:22,246 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1] [2018-01-30 01:27:22,246 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:22,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2084258399, now seen corresponding path program 8 times [2018-01-30 01:27:22,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:22,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:22,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:22,247 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:22,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:22,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 4 proven. 80 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2018-01-30 01:27:22,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:22,504 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-30 01:27:22,508 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:27:22,515 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:22,530 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:22,532 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:22,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-30 01:27:22,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:22,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 28 [2018-01-30 01:27:22,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 01:27:22,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 01:27:22,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-01-30 01:27:22,840 INFO L87 Difference]: Start difference. First operand 271 states and 282 transitions. Second operand 28 states. [2018-01-30 01:27:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:23,313 INFO L93 Difference]: Finished difference Result 427 states and 452 transitions. [2018-01-30 01:27:23,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 01:27:23,315 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 264 [2018-01-30 01:27:23,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:23,316 INFO L225 Difference]: With dead ends: 427 [2018-01-30 01:27:23,316 INFO L226 Difference]: Without dead ends: 309 [2018-01-30 01:27:23,317 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=803, Invalid=2503, Unknown=0, NotChecked=0, Total=3306 [2018-01-30 01:27:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-30 01:27:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 293. [2018-01-30 01:27:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-30 01:27:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 305 transitions. [2018-01-30 01:27:23,322 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 305 transitions. Word has length 264 [2018-01-30 01:27:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:23,322 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 305 transitions. [2018-01-30 01:27:23,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 01:27:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 305 transitions. [2018-01-30 01:27:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-01-30 01:27:23,323 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:23,323 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2018-01-30 01:27:23,323 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:23,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1507635249, now seen corresponding path program 9 times [2018-01-30 01:27:23,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:23,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:23,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:23,324 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:23,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:23,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2018-01-30 01:27:24,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:24,633 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-30 01:27:24,637 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:27:24,645 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:24,658 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:24,661 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:24,664 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:24,667 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:24,671 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:24,675 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:24,676 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:24,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 179 proven. 117 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-01-30 01:27:24,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:24,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 19 [2018-01-30 01:27:24,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 01:27:24,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 01:27:24,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-01-30 01:27:24,772 INFO L87 Difference]: Start difference. First operand 293 states and 305 transitions. Second operand 19 states. [2018-01-30 01:27:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:25,200 INFO L93 Difference]: Finished difference Result 337 states and 353 transitions. [2018-01-30 01:27:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 01:27:25,202 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2018-01-30 01:27:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:25,203 INFO L225 Difference]: With dead ends: 337 [2018-01-30 01:27:25,203 INFO L226 Difference]: Without dead ends: 306 [2018-01-30 01:27:25,204 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=338, Invalid=994, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 01:27:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-30 01:27:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2018-01-30 01:27:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-30 01:27:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 314 transitions. [2018-01-30 01:27:25,216 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 314 transitions. Word has length 285 [2018-01-30 01:27:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:25,216 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 314 transitions. [2018-01-30 01:27:25,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 01:27:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 314 transitions. [2018-01-30 01:27:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-01-30 01:27:25,217 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:25,217 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 7, 6, 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, 1, 1, 1, 1] [2018-01-30 01:27:25,217 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:25,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1344032525, now seen corresponding path program 10 times [2018-01-30 01:27:25,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:25,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:25,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:25,218 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:25,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:25,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 4 proven. 161 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2018-01-30 01:27:25,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:25,766 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-30 01:27:25,770 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:27:25,796 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:25,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:26,573 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-30 01:27:26,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:27:26,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:26,603 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-30 01:27:26,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 01:27:26,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:26,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:26,644 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-30 01:27:26,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 01:27:26,696 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 29 [2018-01-30 01:27:26,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-01-30 01:27:26,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 01:27:26,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 01:27:26,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:26,900 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-30 01:27:26,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 01:27:26,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:26,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:26,986 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-30 01:27:26,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:26,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 01:27:27,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,083 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 41 [2018-01-30 01:27:27,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:27,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:27,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2018-01-30 01:27:27,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,236 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 52 [2018-01-30 01:27:27,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:27,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:27,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 45 [2018-01-30 01:27:27,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:27,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:27,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:29 [2018-01-30 01:27:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 3 proven. 294 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2018-01-30 01:27:27,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:27,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 45] total 60 [2018-01-30 01:27:27,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-30 01:27:27,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-30 01:27:27,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=3199, Unknown=0, NotChecked=0, Total=3540 [2018-01-30 01:27:27,694 INFO L87 Difference]: Start difference. First operand 301 states and 314 transitions. Second operand 60 states. [2018-01-30 01:27:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:29,639 INFO L93 Difference]: Finished difference Result 502 states and 542 transitions. [2018-01-30 01:27:29,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-01-30 01:27:29,641 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 292 [2018-01-30 01:27:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:29,642 INFO L225 Difference]: With dead ends: 502 [2018-01-30 01:27:29,642 INFO L226 Difference]: Without dead ends: 471 [2018-01-30 01:27:29,644 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4137 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1122, Invalid=11534, Unknown=0, NotChecked=0, Total=12656 [2018-01-30 01:27:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-01-30 01:27:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 442. [2018-01-30 01:27:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-01-30 01:27:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 473 transitions. [2018-01-30 01:27:29,663 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 473 transitions. Word has length 292 [2018-01-30 01:27:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:29,664 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 473 transitions. [2018-01-30 01:27:29,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-30 01:27:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 473 transitions. [2018-01-30 01:27:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-01-30 01:27:29,665 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:29,665 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:29,665 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2043326169, now seen corresponding path program 4 times [2018-01-30 01:27:29,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:29,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:29,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:29,666 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:29,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:29,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 93 proven. 30 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-01-30 01:27:29,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:29,828 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-30 01:27:29,833 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:27:29,862 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:29,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 116 proven. 149 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2018-01-30 01:27:30,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:30,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 25 [2018-01-30 01:27:30,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 01:27:30,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 01:27:30,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-01-30 01:27:30,236 INFO L87 Difference]: Start difference. First operand 442 states and 473 transitions. Second operand 25 states. [2018-01-30 01:27:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:30,565 INFO L93 Difference]: Finished difference Result 565 states and 609 transitions. [2018-01-30 01:27:30,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 01:27:30,565 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 305 [2018-01-30 01:27:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:30,566 INFO L225 Difference]: With dead ends: 565 [2018-01-30 01:27:30,567 INFO L226 Difference]: Without dead ends: 442 [2018-01-30 01:27:30,567 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 01:27:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-01-30 01:27:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2018-01-30 01:27:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-01-30 01:27:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 472 transitions. [2018-01-30 01:27:30,576 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 472 transitions. Word has length 305 [2018-01-30 01:27:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:30,576 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 472 transitions. [2018-01-30 01:27:30,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 01:27:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 472 transitions. [2018-01-30 01:27:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-01-30 01:27:30,577 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:30,578 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2018-01-30 01:27:30,578 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash -226528238, now seen corresponding path program 11 times [2018-01-30 01:27:30,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:30,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:30,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:30,578 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:30,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:30,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 6 proven. 792 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-01-30 01:27:30,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:30,965 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-30 01:27:30,970 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:27:30,977 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:30,979 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:30,980 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:30,982 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:30,984 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:30,990 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:30,993 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:30,997 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:31,001 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:31,006 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:31,012 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:31,025 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:31,026 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:31,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-01-30 01:27:31,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:31,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 33 [2018-01-30 01:27:31,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 01:27:31,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 01:27:31,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 01:27:31,185 INFO L87 Difference]: Start difference. First operand 442 states and 472 transitions. Second operand 33 states. [2018-01-30 01:27:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:31,815 INFO L93 Difference]: Finished difference Result 768 states and 834 transitions. [2018-01-30 01:27:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-30 01:27:31,824 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 309 [2018-01-30 01:27:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:31,825 INFO L225 Difference]: With dead ends: 768 [2018-01-30 01:27:31,825 INFO L226 Difference]: Without dead ends: 493 [2018-01-30 01:27:31,827 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1114, Invalid=3856, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 01:27:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-01-30 01:27:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 472. [2018-01-30 01:27:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-01-30 01:27:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 504 transitions. [2018-01-30 01:27:31,836 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 504 transitions. Word has length 309 [2018-01-30 01:27:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:31,836 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 504 transitions. [2018-01-30 01:27:31,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 01:27:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 504 transitions. [2018-01-30 01:27:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 01:27:31,838 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:31,838 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2018-01-30 01:27:31,838 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:31,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1861679832, now seen corresponding path program 12 times [2018-01-30 01:27:31,838 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:31,838 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:31,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:31,839 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:31,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:31,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 1257 trivial. 0 not checked. [2018-01-30 01:27:32,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:32,055 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-30 01:27:32,073 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:27:32,081 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,088 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,095 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,097 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,100 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,103 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,106 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,109 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,113 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,117 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,121 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,126 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,134 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:32,135 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:32,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2018-01-30 01:27:32,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:32,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 27 [2018-01-30 01:27:32,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 01:27:32,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 01:27:32,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-01-30 01:27:32,325 INFO L87 Difference]: Start difference. First operand 472 states and 504 transitions. Second operand 27 states. [2018-01-30 01:27:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:32,873 INFO L93 Difference]: Finished difference Result 663 states and 718 transitions. [2018-01-30 01:27:32,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 01:27:32,875 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 330 [2018-01-30 01:27:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:32,876 INFO L225 Difference]: With dead ends: 663 [2018-01-30 01:27:32,876 INFO L226 Difference]: Without dead ends: 537 [2018-01-30 01:27:32,877 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=2451, Unknown=0, NotChecked=0, Total=3192 [2018-01-30 01:27:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-01-30 01:27:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 488. [2018-01-30 01:27:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-01-30 01:27:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 522 transitions. [2018-01-30 01:27:32,890 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 522 transitions. Word has length 330 [2018-01-30 01:27:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:32,890 INFO L432 AbstractCegarLoop]: Abstraction has 488 states and 522 transitions. [2018-01-30 01:27:32,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 01:27:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 522 transitions. [2018-01-30 01:27:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-01-30 01:27:32,891 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:32,891 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:32,891 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash -884610393, now seen corresponding path program 5 times [2018-01-30 01:27:32,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:32,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:32,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:32,892 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:32,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:32,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 119 proven. 54 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2018-01-30 01:27:33,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:33,096 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-30 01:27:33,101 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:27:33,111 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,112 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,114 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,116 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,118 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,121 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,130 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,133 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,138 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,142 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,148 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,154 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,175 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:33,176 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:33,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 115 proven. 54 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2018-01-30 01:27:33,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:33,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-30 01:27:33,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 01:27:33,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 01:27:33,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-01-30 01:27:33,329 INFO L87 Difference]: Start difference. First operand 488 states and 522 transitions. Second operand 21 states. [2018-01-30 01:27:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:33,446 INFO L93 Difference]: Finished difference Result 627 states and 676 transitions. [2018-01-30 01:27:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 01:27:33,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 340 [2018-01-30 01:27:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:33,448 INFO L225 Difference]: With dead ends: 627 [2018-01-30 01:27:33,448 INFO L226 Difference]: Without dead ends: 488 [2018-01-30 01:27:33,449 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2018-01-30 01:27:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-01-30 01:27:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2018-01-30 01:27:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-01-30 01:27:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 521 transitions. [2018-01-30 01:27:33,467 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 521 transitions. Word has length 340 [2018-01-30 01:27:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:33,467 INFO L432 AbstractCegarLoop]: Abstraction has 488 states and 521 transitions. [2018-01-30 01:27:33,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 01:27:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 521 transitions. [2018-01-30 01:27:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-01-30 01:27:33,468 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:33,469 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 8, 7, 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, 1, 1, 1, 1] [2018-01-30 01:27:33,469 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:33,469 INFO L82 PathProgramCache]: Analyzing trace with hash 228425440, now seen corresponding path program 13 times [2018-01-30 01:27:33,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:33,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:33,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:33,469 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:33,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:33,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1489 backedges. 6 proven. 161 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2018-01-30 01:27:33,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:33,747 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-30 01:27:33,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:33,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1489 backedges. 0 proven. 948 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2018-01-30 01:27:34,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:34,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 34 [2018-01-30 01:27:34,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 01:27:34,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 01:27:34,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 01:27:34,039 INFO L87 Difference]: Start difference. First operand 488 states and 521 transitions. Second operand 34 states. [2018-01-30 01:27:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:34,512 INFO L93 Difference]: Finished difference Result 875 states and 948 transitions. [2018-01-30 01:27:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-01-30 01:27:34,514 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 344 [2018-01-30 01:27:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:34,515 INFO L225 Difference]: With dead ends: 875 [2018-01-30 01:27:34,516 INFO L226 Difference]: Without dead ends: 568 [2018-01-30 01:27:34,517 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1186, Invalid=3926, Unknown=0, NotChecked=0, Total=5112 [2018-01-30 01:27:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-01-30 01:27:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 502. [2018-01-30 01:27:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-01-30 01:27:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 535 transitions. [2018-01-30 01:27:34,525 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 535 transitions. Word has length 344 [2018-01-30 01:27:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:34,525 INFO L432 AbstractCegarLoop]: Abstraction has 502 states and 535 transitions. [2018-01-30 01:27:34,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 01:27:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 535 transitions. [2018-01-30 01:27:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-01-30 01:27:34,527 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:34,527 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:34,527 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2139553969, now seen corresponding path program 6 times [2018-01-30 01:27:34,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:34,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:34,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:34,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:34,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:34,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 4 proven. 177 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2018-01-30 01:27:34,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:34,842 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-30 01:27:34,847 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:27:34,855 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,866 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,881 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,893 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,900 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,903 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,905 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,909 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,912 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,917 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,923 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:34,924 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:34,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 1558 trivial. 0 not checked. [2018-01-30 01:27:35,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:35,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-01-30 01:27:35,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 01:27:35,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 01:27:35,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:27:35,002 INFO L87 Difference]: Start difference. First operand 502 states and 535 transitions. Second operand 12 states. [2018-01-30 01:27:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:35,170 INFO L93 Difference]: Finished difference Result 789 states and 852 transitions. [2018-01-30 01:27:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 01:27:35,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 361 [2018-01-30 01:27:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:35,172 INFO L225 Difference]: With dead ends: 789 [2018-01-30 01:27:35,172 INFO L226 Difference]: Without dead ends: 573 [2018-01-30 01:27:35,173 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-01-30 01:27:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-01-30 01:27:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 516. [2018-01-30 01:27:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-01-30 01:27:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 551 transitions. [2018-01-30 01:27:35,182 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 551 transitions. Word has length 361 [2018-01-30 01:27:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:35,182 INFO L432 AbstractCegarLoop]: Abstraction has 516 states and 551 transitions. [2018-01-30 01:27:35,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 01:27:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 551 transitions. [2018-01-30 01:27:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-01-30 01:27:35,184 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:35,184 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 10, 9, 8, 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, 1, 1, 1, 1] [2018-01-30 01:27:35,184 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:35,184 INFO L82 PathProgramCache]: Analyzing trace with hash -269451286, now seen corresponding path program 14 times [2018-01-30 01:27:35,184 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:35,184 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:35,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:35,185 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:35,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:35,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 6 proven. 1118 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2018-01-30 01:27:35,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:35,775 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-30 01:27:35,780 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:27:35,788 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:35,807 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:35,822 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:35,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 0 proven. 1118 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2018-01-30 01:27:35,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:35,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-01-30 01:27:35,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 01:27:35,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 01:27:35,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-01-30 01:27:35,893 INFO L87 Difference]: Start difference. First operand 516 states and 551 transitions. Second operand 29 states. [2018-01-30 01:27:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:36,408 INFO L93 Difference]: Finished difference Result 862 states and 932 transitions. [2018-01-30 01:27:36,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 01:27:36,408 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 365 [2018-01-30 01:27:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:36,409 INFO L225 Difference]: With dead ends: 862 [2018-01-30 01:27:36,409 INFO L226 Difference]: Without dead ends: 541 [2018-01-30 01:27:36,410 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 01:27:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-01-30 01:27:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 530. [2018-01-30 01:27:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-01-30 01:27:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 565 transitions. [2018-01-30 01:27:36,420 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 565 transitions. Word has length 365 [2018-01-30 01:27:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:36,421 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 565 transitions. [2018-01-30 01:27:36,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 01:27:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 565 transitions. [2018-01-30 01:27:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-01-30 01:27:36,422 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:36,422 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 10, 10, 10, 10, 10, 10, 9, 8, 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, 1, 1, 1, 1] [2018-01-30 01:27:36,422 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1866626026, now seen corresponding path program 15 times [2018-01-30 01:27:36,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:36,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:36,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:36,423 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:36,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:36,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 6 proven. 212 refuted. 0 times theorem prover too weak. 1676 trivial. 0 not checked. [2018-01-30 01:27:36,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:36,812 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:36,818 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:27:36,827 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:36,830 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:36,833 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:36,837 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:36,842 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:36,846 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:36,850 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:36,855 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:36,862 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:36,862 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:36,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-01-30 01:27:36,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:36,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-01-30 01:27:36,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 01:27:36,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 01:27:36,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-30 01:27:36,923 INFO L87 Difference]: Start difference. First operand 530 states and 565 transitions. Second operand 19 states. [2018-01-30 01:27:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:37,134 INFO L93 Difference]: Finished difference Result 754 states and 813 transitions. [2018-01-30 01:27:37,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 01:27:37,135 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 379 [2018-01-30 01:27:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:37,136 INFO L225 Difference]: With dead ends: 754 [2018-01-30 01:27:37,136 INFO L226 Difference]: Without dead ends: 631 [2018-01-30 01:27:37,136 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 01:27:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-01-30 01:27:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 530. [2018-01-30 01:27:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-01-30 01:27:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 565 transitions. [2018-01-30 01:27:37,146 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 565 transitions. Word has length 379 [2018-01-30 01:27:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:37,146 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 565 transitions. [2018-01-30 01:27:37,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 01:27:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 565 transitions. [2018-01-30 01:27:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-01-30 01:27:37,147 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:37,147 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:37,148 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:37,148 INFO L82 PathProgramCache]: Analyzing trace with hash -453193409, now seen corresponding path program 7 times [2018-01-30 01:27:37,148 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:37,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:37,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:37,148 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:37,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:37,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1983 backedges. 4 proven. 241 refuted. 0 times theorem prover too weak. 1738 trivial. 0 not checked. [2018-01-30 01:27:37,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:37,408 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:37,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:37,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1983 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2018-01-30 01:27:37,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:37,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 31] total 43 [2018-01-30 01:27:37,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 01:27:37,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 01:27:37,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 01:27:37,835 INFO L87 Difference]: Start difference. First operand 530 states and 565 transitions. Second operand 43 states. [2018-01-30 01:27:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:38,806 INFO L93 Difference]: Finished difference Result 954 states and 1032 transitions. [2018-01-30 01:27:38,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-30 01:27:38,807 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 382 [2018-01-30 01:27:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:38,808 INFO L225 Difference]: With dead ends: 954 [2018-01-30 01:27:38,808 INFO L226 Difference]: Without dead ends: 633 [2018-01-30 01:27:38,810 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2806 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2589, Invalid=7917, Unknown=0, NotChecked=0, Total=10506 [2018-01-30 01:27:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-01-30 01:27:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 558. [2018-01-30 01:27:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-01-30 01:27:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 595 transitions. [2018-01-30 01:27:38,819 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 595 transitions. Word has length 382 [2018-01-30 01:27:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:38,820 INFO L432 AbstractCegarLoop]: Abstraction has 558 states and 595 transitions. [2018-01-30 01:27:38,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 01:27:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 595 transitions. [2018-01-30 01:27:38,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-01-30 01:27:38,821 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:38,821 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 10, 10, 10, 10, 10, 10, 10, 9, 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, 1, 1, 1, 1] [2018-01-30 01:27:38,821 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1511307236, now seen corresponding path program 16 times [2018-01-30 01:27:38,821 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:38,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:38,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:38,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:38,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:38,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 6 proven. 335 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-01-30 01:27:39,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:39,326 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:39,331 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:27:39,359 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:39,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:39,430 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-30 01:27:39,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:27:39,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,488 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-30 01:27:39,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 01:27:39,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,555 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-30 01:27:39,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 01:27:39,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,614 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 41 [2018-01-30 01:27:39,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 01:27:39,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:39,687 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 52 [2018-01-30 01:27:39,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 01:27:39,813 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 43 [2018-01-30 01:27:39,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:39,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:43 [2018-01-30 01:27:40,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 01:27:40,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 01:27:40,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,133 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-30 01:27:40,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2018-01-30 01:27:40,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,269 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-30 01:27:40,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-01-30 01:27:40,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,422 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 41 [2018-01-30 01:27:40,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2018-01-30 01:27:40,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,591 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 52 [2018-01-30 01:27:40,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:81 [2018-01-30 01:27:40,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:27:40,763 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 63 [2018-01-30 01:27:40,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:88 [2018-01-30 01:27:40,957 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 50 [2018-01-30 01:27:40,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 43 [2018-01-30 01:27:40,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:27:40,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:43 [2018-01-30 01:27:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 5 proven. 639 refuted. 0 times theorem prover too weak. 1506 trivial. 0 not checked. [2018-01-30 01:27:41,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:41,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 63] total 84 [2018-01-30 01:27:41,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-01-30 01:27:41,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-01-30 01:27:41,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=6388, Unknown=0, NotChecked=0, Total=6972 [2018-01-30 01:27:41,918 INFO L87 Difference]: Start difference. First operand 558 states and 595 transitions. Second operand 84 states. [2018-01-30 01:27:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:46,527 INFO L93 Difference]: Finished difference Result 840 states and 915 transitions. [2018-01-30 01:27:46,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-01-30 01:27:46,528 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 400 [2018-01-30 01:27:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:46,529 INFO L225 Difference]: With dead ends: 840 [2018-01-30 01:27:46,529 INFO L226 Difference]: Without dead ends: 788 [2018-01-30 01:27:46,530 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8191 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1931, Invalid=22249, Unknown=0, NotChecked=0, Total=24180 [2018-01-30 01:27:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-01-30 01:27:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 752. [2018-01-30 01:27:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-01-30 01:27:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 814 transitions. [2018-01-30 01:27:46,568 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 814 transitions. Word has length 400 [2018-01-30 01:27:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:46,568 INFO L432 AbstractCegarLoop]: Abstraction has 752 states and 814 transitions. [2018-01-30 01:27:46,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-01-30 01:27:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 814 transitions. [2018-01-30 01:27:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-01-30 01:27:46,570 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:46,570 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:46,570 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:46,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2059711141, now seen corresponding path program 8 times [2018-01-30 01:27:46,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:46,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:46,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:46,571 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:46,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:46,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 4 proven. 312 refuted. 0 times theorem prover too weak. 2008 trivial. 0 not checked. [2018-01-30 01:27:47,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:47,462 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:47,467 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:27:47,483 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:47,505 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:47,508 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:47,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2018-01-30 01:27:47,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:47,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 33] total 47 [2018-01-30 01:27:47,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 01:27:47,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 01:27:47,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1698, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 01:27:47,833 INFO L87 Difference]: Start difference. First operand 752 states and 814 transitions. Second operand 47 states. [2018-01-30 01:27:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:48,823 INFO L93 Difference]: Finished difference Result 1399 states and 1532 transitions. [2018-01-30 01:27:48,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-30 01:27:48,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 410 [2018-01-30 01:27:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:48,828 INFO L225 Difference]: With dead ends: 1399 [2018-01-30 01:27:48,828 INFO L226 Difference]: Without dead ends: 870 [2018-01-30 01:27:48,830 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3441 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3064, Invalid=9592, Unknown=0, NotChecked=0, Total=12656 [2018-01-30 01:27:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-01-30 01:27:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 787. [2018-01-30 01:27:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-01-30 01:27:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 852 transitions. [2018-01-30 01:27:48,849 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 852 transitions. Word has length 410 [2018-01-30 01:27:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:48,849 INFO L432 AbstractCegarLoop]: Abstraction has 787 states and 852 transitions. [2018-01-30 01:27:48,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 01:27:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 852 transitions. [2018-01-30 01:27:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-01-30 01:27:48,851 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:48,851 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 12, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1] [2018-01-30 01:27:48,851 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash 402006167, now seen corresponding path program 17 times [2018-01-30 01:27:48,852 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:48,852 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:48,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:48,853 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:48,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:48,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 8 proven. 407 refuted. 0 times theorem prover too weak. 2054 trivial. 0 not checked. [2018-01-30 01:27:49,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:49,546 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:49,551 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:27:49,560 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,562 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,563 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,564 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,566 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,568 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,570 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,573 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,577 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,581 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,586 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,591 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,597 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,604 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,613 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,623 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,667 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:49,669 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:49,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 0 proven. 1712 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2018-01-30 01:27:50,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:50,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 35] total 46 [2018-01-30 01:27:50,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-30 01:27:50,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-30 01:27:50,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1670, Unknown=0, NotChecked=0, Total=2070 [2018-01-30 01:27:50,021 INFO L87 Difference]: Start difference. First operand 787 states and 852 transitions. Second operand 46 states. [2018-01-30 01:27:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:50,838 INFO L93 Difference]: Finished difference Result 1401 states and 1540 transitions. [2018-01-30 01:27:50,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-01-30 01:27:50,838 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 431 [2018-01-30 01:27:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:50,840 INFO L225 Difference]: With dead ends: 1401 [2018-01-30 01:27:50,840 INFO L226 Difference]: Without dead ends: 851 [2018-01-30 01:27:50,841 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2180, Invalid=7720, Unknown=0, NotChecked=0, Total=9900 [2018-01-30 01:27:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-01-30 01:27:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 825. [2018-01-30 01:27:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-01-30 01:27:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 893 transitions. [2018-01-30 01:27:50,856 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 893 transitions. Word has length 431 [2018-01-30 01:27:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:50,856 INFO L432 AbstractCegarLoop]: Abstraction has 825 states and 893 transitions. [2018-01-30 01:27:50,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-30 01:27:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 893 transitions. [2018-01-30 01:27:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-01-30 01:27:50,858 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:50,858 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 13, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1] [2018-01-30 01:27:50,858 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:50,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1260574309, now seen corresponding path program 18 times [2018-01-30 01:27:50,859 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:50,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:50,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:50,859 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:50,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:50,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 8 proven. 1938 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2018-01-30 01:27:51,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:51,684 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:51,688 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:27:51,697 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,698 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,701 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,703 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,706 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,709 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,713 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,716 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,720 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,724 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,729 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,734 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,740 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,746 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,753 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,761 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,769 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,780 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:27:51,781 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:51,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 1938 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2018-01-30 01:27:51,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:51,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-01-30 01:27:51,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 01:27:51,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 01:27:51,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 01:27:51,879 INFO L87 Difference]: Start difference. First operand 825 states and 893 transitions. Second operand 37 states. [2018-01-30 01:27:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:52,551 INFO L93 Difference]: Finished difference Result 1424 states and 1560 transitions. [2018-01-30 01:27:52,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 01:27:52,552 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 452 [2018-01-30 01:27:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:52,555 INFO L225 Difference]: With dead ends: 1424 [2018-01-30 01:27:52,555 INFO L226 Difference]: Without dead ends: 850 [2018-01-30 01:27:52,556 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 01:27:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-01-30 01:27:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 839. [2018-01-30 01:27:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-01-30 01:27:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 907 transitions. [2018-01-30 01:27:52,573 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 907 transitions. Word has length 452 [2018-01-30 01:27:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:52,573 INFO L432 AbstractCegarLoop]: Abstraction has 839 states and 907 transitions. [2018-01-30 01:27:52,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 01:27:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 907 transitions. [2018-01-30 01:27:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-01-30 01:27:52,575 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:52,575 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1] [2018-01-30 01:27:52,575 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash 678443193, now seen corresponding path program 19 times [2018-01-30 01:27:52,575 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:52,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:52,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:52,576 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:52,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:52,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 8 proven. 2178 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2018-01-30 01:27:53,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:53,478 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:53,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:53,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2018-01-30 01:27:53,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:53,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-01-30 01:27:53,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 01:27:53,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 01:27:53,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 01:27:53,619 INFO L87 Difference]: Start difference. First operand 839 states and 907 transitions. Second operand 39 states. [2018-01-30 01:27:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:54,175 INFO L93 Difference]: Finished difference Result 1438 states and 1574 transitions. [2018-01-30 01:27:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-30 01:27:54,175 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 466 [2018-01-30 01:27:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:54,177 INFO L225 Difference]: With dead ends: 1438 [2018-01-30 01:27:54,177 INFO L226 Difference]: Without dead ends: 864 [2018-01-30 01:27:54,178 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-01-30 01:27:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-01-30 01:27:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 853. [2018-01-30 01:27:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-01-30 01:27:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 921 transitions. [2018-01-30 01:27:54,225 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 921 transitions. Word has length 466 [2018-01-30 01:27:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:54,226 INFO L432 AbstractCegarLoop]: Abstraction has 853 states and 921 transitions. [2018-01-30 01:27:54,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 01:27:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 921 transitions. [2018-01-30 01:27:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-01-30 01:27:54,228 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:54,228 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 13, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1] [2018-01-30 01:27:54,228 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:54,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1247217651, now seen corresponding path program 20 times [2018-01-30 01:27:54,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:54,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:54,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:54,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:27:54,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:54,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 8 proven. 270 refuted. 0 times theorem prover too weak. 2990 trivial. 0 not checked. [2018-01-30 01:27:54,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:54,685 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:54,689 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:27:54,699 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:54,724 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:27:54,728 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:54,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 0 proven. 2432 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2018-01-30 01:27:56,069 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:56,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 41] total 50 [2018-01-30 01:27:56,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-30 01:27:56,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-30 01:27:56,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1956, Unknown=0, NotChecked=0, Total=2450 [2018-01-30 01:27:56,070 INFO L87 Difference]: Start difference. First operand 853 states and 921 transitions. Second operand 50 states. [2018-01-30 01:27:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:56,933 INFO L93 Difference]: Finished difference Result 1594 states and 1748 transitions. [2018-01-30 01:27:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-01-30 01:27:56,940 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 480 [2018-01-30 01:27:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:56,942 INFO L225 Difference]: With dead ends: 1594 [2018-01-30 01:27:56,942 INFO L226 Difference]: Without dead ends: 1020 [2018-01-30 01:27:56,943 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2610, Invalid=8520, Unknown=0, NotChecked=0, Total=11130 [2018-01-30 01:27:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-01-30 01:27:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 867. [2018-01-30 01:27:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2018-01-30 01:27:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 935 transitions. [2018-01-30 01:27:56,958 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 935 transitions. Word has length 480 [2018-01-30 01:27:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:56,959 INFO L432 AbstractCegarLoop]: Abstraction has 867 states and 935 transitions. [2018-01-30 01:27:56,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-01-30 01:27:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 935 transitions. [2018-01-30 01:27:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-01-30 01:27:56,961 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:56,961 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:56,961 INFO L371 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2103018423, now seen corresponding path program 9 times [2018-01-30 01:27:56,961 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:56,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:56,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:56,962 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:56,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:56,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 259 proven. 85 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-01-30 01:27:57,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:57,479 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:57,505 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:27:57,522 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:57,531 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:57,534 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:57,537 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:57,541 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:57,544 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:57,549 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:57,554 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:57,559 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:27:57,560 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:57,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2018-01-30 01:27:57,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:57,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2018-01-30 01:27:57,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 01:27:57,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 01:27:57,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-01-30 01:27:57,813 INFO L87 Difference]: Start difference. First operand 867 states and 935 transitions. Second operand 30 states. [2018-01-30 01:27:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:27:58,465 INFO L93 Difference]: Finished difference Result 1217 states and 1323 transitions. [2018-01-30 01:27:58,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 01:27:58,465 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 494 [2018-01-30 01:27:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:27:58,467 INFO L225 Difference]: With dead ends: 1217 [2018-01-30 01:27:58,467 INFO L226 Difference]: Without dead ends: 797 [2018-01-30 01:27:58,468 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1363, Invalid=3467, Unknown=0, NotChecked=0, Total=4830 [2018-01-30 01:27:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-01-30 01:27:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 725. [2018-01-30 01:27:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-01-30 01:27:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 773 transitions. [2018-01-30 01:27:58,481 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 773 transitions. Word has length 494 [2018-01-30 01:27:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:27:58,481 INFO L432 AbstractCegarLoop]: Abstraction has 725 states and 773 transitions. [2018-01-30 01:27:58,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 01:27:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 773 transitions. [2018-01-30 01:27:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-01-30 01:27:58,483 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:27:58,483 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1] [2018-01-30 01:27:58,484 INFO L371 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:27:58,484 INFO L82 PathProgramCache]: Analyzing trace with hash -5528088, now seen corresponding path program 10 times [2018-01-30 01:27:58,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:27:58,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:27:58,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:58,484 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:27:58,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:27:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:27:58,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:27:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3883 backedges. 6 proven. 529 refuted. 0 times theorem prover too weak. 3348 trivial. 0 not checked. [2018-01-30 01:27:59,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:27:59,092 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:27:59,113 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:27:59,152 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:27:59,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:27:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3883 backedges. 263 proven. 593 refuted. 0 times theorem prover too weak. 3027 trivial. 0 not checked. [2018-01-30 01:27:59,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:27:59,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2018-01-30 01:27:59,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 01:27:59,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 01:27:59,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1799, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 01:27:59,521 INFO L87 Difference]: Start difference. First operand 725 states and 773 transitions. Second operand 47 states. [2018-01-30 01:28:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:28:00,974 INFO L93 Difference]: Finished difference Result 1279 states and 1393 transitions. [2018-01-30 01:28:00,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-01-30 01:28:00,974 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 518 [2018-01-30 01:28:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:28:00,976 INFO L225 Difference]: With dead ends: 1279 [2018-01-30 01:28:00,976 INFO L226 Difference]: Without dead ends: 1015 [2018-01-30 01:28:00,977 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2950, Invalid=13306, Unknown=0, NotChecked=0, Total=16256 [2018-01-30 01:28:00,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-01-30 01:28:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 846. [2018-01-30 01:28:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2018-01-30 01:28:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 905 transitions. [2018-01-30 01:28:00,996 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 905 transitions. Word has length 518 [2018-01-30 01:28:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:28:00,996 INFO L432 AbstractCegarLoop]: Abstraction has 846 states and 905 transitions. [2018-01-30 01:28:00,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 01:28:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 905 transitions. [2018-01-30 01:28:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-01-30 01:28:00,998 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:28:00,998 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 16, 15, 15, 15, 15, 14, 14, 13, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:28:00,998 INFO L371 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:28:00,998 INFO L82 PathProgramCache]: Analyzing trace with hash -232293098, now seen corresponding path program 1 times [2018-01-30 01:28:00,998 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:28:00,998 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:28:00,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:00,999 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:28:00,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:28:01,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:28:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3971 backedges. 6 proven. 2700 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-01-30 01:28:02,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:28:02,070 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:28:02,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:28:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:28:02,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:28:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3971 backedges. 0 proven. 2700 refuted. 0 times theorem prover too weak. 1271 trivial. 0 not checked. [2018-01-30 01:28:02,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:28:02,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-01-30 01:28:02,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 01:28:02,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 01:28:02,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 01:28:02,229 INFO L87 Difference]: Start difference. First operand 846 states and 905 transitions. Second operand 43 states. [2018-01-30 01:28:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:28:02,969 INFO L93 Difference]: Finished difference Result 1424 states and 1542 transitions. [2018-01-30 01:28:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-30 01:28:02,969 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 525 [2018-01-30 01:28:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:28:02,971 INFO L225 Difference]: With dead ends: 1424 [2018-01-30 01:28:02,971 INFO L226 Difference]: Without dead ends: 871 [2018-01-30 01:28:02,972 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-01-30 01:28:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-01-30 01:28:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 860. [2018-01-30 01:28:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-01-30 01:28:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 919 transitions. [2018-01-30 01:28:02,988 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 919 transitions. Word has length 525 [2018-01-30 01:28:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:28:02,989 INFO L432 AbstractCegarLoop]: Abstraction has 860 states and 919 transitions. [2018-01-30 01:28:02,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 01:28:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 919 transitions. [2018-01-30 01:28:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-01-30 01:28:02,991 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:28:02,991 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 16, 15, 15, 15, 15, 14, 14, 13, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:28:02,991 INFO L371 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:28:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1880483518, now seen corresponding path program 2 times [2018-01-30 01:28:02,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:28:02,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:28:02,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:02,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:28:02,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:28:03,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:28:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4253 backedges. 6 proven. 2982 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-01-30 01:28:04,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:28:04,148 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:28:04,152 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:28:04,163 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:04,189 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:04,194 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:28:04,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:28:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4253 backedges. 0 proven. 2982 refuted. 0 times theorem prover too weak. 1271 trivial. 0 not checked. [2018-01-30 01:28:04,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:28:04,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-01-30 01:28:04,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-30 01:28:04,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-30 01:28:04,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 01:28:04,322 INFO L87 Difference]: Start difference. First operand 860 states and 919 transitions. Second operand 45 states. [2018-01-30 01:28:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:28:05,309 INFO L93 Difference]: Finished difference Result 1438 states and 1556 transitions. [2018-01-30 01:28:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-30 01:28:05,310 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 539 [2018-01-30 01:28:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:28:05,311 INFO L225 Difference]: With dead ends: 1438 [2018-01-30 01:28:05,311 INFO L226 Difference]: Without dead ends: 885 [2018-01-30 01:28:05,312 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-01-30 01:28:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-01-30 01:28:05,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 874. [2018-01-30 01:28:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-01-30 01:28:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 933 transitions. [2018-01-30 01:28:05,331 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 933 transitions. Word has length 539 [2018-01-30 01:28:05,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:28:05,331 INFO L432 AbstractCegarLoop]: Abstraction has 874 states and 933 transitions. [2018-01-30 01:28:05,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-30 01:28:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 933 transitions. [2018-01-30 01:28:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-01-30 01:28:05,333 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:28:05,333 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 16, 15, 15, 15, 15, 14, 14, 13, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:28:05,333 INFO L371 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:28:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash 413268078, now seen corresponding path program 3 times [2018-01-30 01:28:05,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:28:05,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:28:05,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:05,334 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:28:05,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:28:05,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:28:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4549 backedges. 6 proven. 352 refuted. 0 times theorem prover too weak. 4191 trivial. 0 not checked. [2018-01-30 01:28:05,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:28:05,900 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:28:05,905 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:28:05,916 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:05,919 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:05,922 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:05,926 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:05,930 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:05,934 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:05,938 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:05,943 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:05,944 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:28:05,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:28:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4549 backedges. 99 proven. 352 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2018-01-30 01:28:06,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:28:06,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 19 [2018-01-30 01:28:06,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 01:28:06,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 01:28:06,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-01-30 01:28:06,111 INFO L87 Difference]: Start difference. First operand 874 states and 933 transitions. Second operand 19 states. [2018-01-30 01:28:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:28:06,418 INFO L93 Difference]: Finished difference Result 1652 states and 1817 transitions. [2018-01-30 01:28:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 01:28:06,418 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 553 [2018-01-30 01:28:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:28:06,420 INFO L225 Difference]: With dead ends: 1652 [2018-01-30 01:28:06,420 INFO L226 Difference]: Without dead ends: 1584 [2018-01-30 01:28:06,421 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 01:28:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2018-01-30 01:28:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 862. [2018-01-30 01:28:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-01-30 01:28:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 921 transitions. [2018-01-30 01:28:06,443 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 921 transitions. Word has length 553 [2018-01-30 01:28:06,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:28:06,443 INFO L432 AbstractCegarLoop]: Abstraction has 862 states and 921 transitions. [2018-01-30 01:28:06,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 01:28:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 921 transitions. [2018-01-30 01:28:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-01-30 01:28:06,445 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:28:06,445 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 17, 16, 16, 16, 16, 15, 15, 13, 12, 12, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1] [2018-01-30 01:28:06,445 INFO L371 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:28:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1535455872, now seen corresponding path program 11 times [2018-01-30 01:28:06,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:28:06,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:28:06,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:06,446 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:28:06,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:28:06,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:28:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4666 backedges. 6 proven. 486 refuted. 0 times theorem prover too weak. 4174 trivial. 0 not checked. [2018-01-30 01:28:07,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:28:07,231 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:28:07,236 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:28:07,246 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,248 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,249 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,250 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,252 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,254 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,256 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,258 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,261 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,264 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,268 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,273 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,278 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,285 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,292 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,301 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,310 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,320 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,333 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,347 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,363 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,382 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,456 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:28:07,458 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:28:07,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:28:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4666 backedges. 453 proven. 168 refuted. 0 times theorem prover too weak. 4045 trivial. 0 not checked. [2018-01-30 01:28:07,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:28:07,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2018-01-30 01:28:07,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 01:28:07,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 01:28:07,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1439, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 01:28:07,781 INFO L87 Difference]: Start difference. First operand 862 states and 921 transitions. Second operand 43 states. [2018-01-30 01:28:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:28:08,499 INFO L93 Difference]: Finished difference Result 1257 states and 1368 transitions. [2018-01-30 01:28:08,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 01:28:08,500 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 560 [2018-01-30 01:28:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:28:08,501 INFO L225 Difference]: With dead ends: 1257 [2018-01-30 01:28:08,501 INFO L226 Difference]: Without dead ends: 849 [2018-01-30 01:28:08,502 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1742, Invalid=5568, Unknown=0, NotChecked=0, Total=7310 [2018-01-30 01:28:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-01-30 01:28:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 843. [2018-01-30 01:28:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-01-30 01:28:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 881 transitions. [2018-01-30 01:28:08,522 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 881 transitions. Word has length 560 [2018-01-30 01:28:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:28:08,522 INFO L432 AbstractCegarLoop]: Abstraction has 843 states and 881 transitions. [2018-01-30 01:28:08,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 01:28:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 881 transitions. [2018-01-30 01:28:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-01-30 01:28:08,524 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:28:08,524 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 16, 15, 15, 15, 15, 15, 15, 14, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1] [2018-01-30 01:28:08,524 INFO L371 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:28:08,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1584311455, now seen corresponding path program 21 times [2018-01-30 01:28:08,524 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:28:08,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:28:08,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:08,525 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:28:08,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:28:08,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:28:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4695 backedges. 8 proven. 3278 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2018-01-30 01:28:09,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:28:09,753 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:28:09,758 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:28:09,770 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,772 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,776 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,780 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,785 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,789 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,793 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,799 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,805 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,812 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,821 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,831 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,842 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,856 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:28:09,857 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:28:09,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:28:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4695 backedges. 100 proven. 572 refuted. 0 times theorem prover too weak. 4023 trivial. 0 not checked. [2018-01-30 01:28:10,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:28:10,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 32] total 63 [2018-01-30 01:28:10,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-01-30 01:28:10,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-01-30 01:28:10,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=3174, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 01:28:10,193 INFO L87 Difference]: Start difference. First operand 843 states and 881 transitions. Second operand 63 states. [2018-01-30 01:28:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:28:11,720 INFO L93 Difference]: Finished difference Result 1416 states and 1496 transitions. [2018-01-30 01:28:11,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-01-30 01:28:11,720 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 571 [2018-01-30 01:28:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:28:11,722 INFO L225 Difference]: With dead ends: 1416 [2018-01-30 01:28:11,722 INFO L226 Difference]: Without dead ends: 894 [2018-01-30 01:28:11,724 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3760 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3968, Invalid=14392, Unknown=0, NotChecked=0, Total=18360 [2018-01-30 01:28:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-01-30 01:28:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 857. [2018-01-30 01:28:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-01-30 01:28:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 895 transitions. [2018-01-30 01:28:11,744 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 895 transitions. Word has length 571 [2018-01-30 01:28:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:28:11,744 INFO L432 AbstractCegarLoop]: Abstraction has 857 states and 895 transitions. [2018-01-30 01:28:11,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-01-30 01:28:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 895 transitions. [2018-01-30 01:28:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-01-30 01:28:11,746 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:28:11,746 INFO L350 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 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, 1, 1, 1, 1] [2018-01-30 01:28:11,747 INFO L371 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:28:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1313631395, now seen corresponding path program 22 times [2018-01-30 01:28:11,747 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:28:11,747 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:28:11,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:11,747 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:28:11,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:28:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:28:11,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:28:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5098 backedges. 8 proven. 665 refuted. 0 times theorem prover too weak. 4425 trivial. 0 not checked. [2018-01-30 01:28:12,598 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:28:12,598 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:28:12,603 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:28:12,657 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:28:12,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:28:13,446 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-30 01:28:13,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:28:13,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,549 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-30 01:28:13,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 01:28:13,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,668 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-30 01:28:13,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 01:28:13,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,809 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 41 [2018-01-30 01:28:13,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 01:28:13,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:13,958 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 52 [2018-01-30 01:28:13,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:13,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 01:28:14,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,132 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 63 [2018-01-30 01:28:14,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:14,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:14,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 01:28:14,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,324 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 74 [2018-01-30 01:28:14,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:14,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:14,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 01:28:14,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-01-30 01:28:14,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:14,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:14,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2018-01-30 01:28:14,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:14,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 96 [2018-01-30 01:28:14,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:14,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:14,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-01-30 01:28:15,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:15,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:15,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:15,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:15,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:15,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:15,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:15,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:15,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:15,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 107 [2018-01-30 01:28:15,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:15,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:15,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2018-01-30 01:28:15,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2018-01-30 01:28:15,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:15,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:15,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:78 [2018-01-30 01:28:16,225 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-30 01:28:16,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:16,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:16,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:88 [2018-01-30 01:28:16,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:16,532 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-30 01:28:16,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:16,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:16,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:95 [2018-01-30 01:28:16,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:16,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:16,863 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-30 01:28:16,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:16,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:16,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:102 [2018-01-30 01:28:17,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:17,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:17,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:17,211 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 41 [2018-01-30 01:28:17,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:28:17,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:28:17,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:109 Received shutdown request... [2018-01-30 01:28:17,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:17,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:17,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:17,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:28:17,605 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 52 [2018-01-30 01:28:17,606 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 01:28:17,606 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:28:17,608 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:28:17,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:28:17 BoogieIcfgContainer [2018-01-30 01:28:17,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:28:17,609 INFO L168 Benchmark]: Toolchain (without parser) took 67947.46 ms. Allocated memory was 148.4 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 114.6 MB in the beginning and 1.1 GB in the end (delta: -958.0 MB). Peak memory consumption was 528.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:28:17,610 INFO L168 Benchmark]: CDTParser took 0.09 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-30 01:28:17,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 103.09 ms. Allocated memory is still 148.4 MB. Free memory was 114.4 MB in the beginning and 106.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:28:17,610 INFO L168 Benchmark]: Boogie Preprocessor took 17.64 ms. Allocated memory is still 148.4 MB. Free memory was 106.2 MB in the beginning and 104.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:28:17,610 INFO L168 Benchmark]: RCFGBuilder took 380.90 ms. Allocated memory is still 148.4 MB. Free memory was 104.6 MB in the beginning and 89.4 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:28:17,611 INFO L168 Benchmark]: TraceAbstraction took 67443.63 ms. Allocated memory was 148.4 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 89.2 MB in the beginning and 1.1 GB in the end (delta: -983.4 MB). Peak memory consumption was 502.9 MB. Max. memory is 5.3 GB. [2018-01-30 01:28:17,611 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.09 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 103.09 ms. Allocated memory is still 148.4 MB. Free memory was 114.4 MB in the beginning and 106.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.64 ms. Allocated memory is still 148.4 MB. Free memory was 106.2 MB in the beginning and 104.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 380.90 ms. Allocated memory is still 148.4 MB. Free memory was 104.6 MB in the beginning and 89.4 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67443.63 ms. Allocated memory was 148.4 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 89.2 MB in the beginning and 1.1 GB in the end (delta: -983.4 MB). Peak memory consumption was 502.9 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 593 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 1 error locations. TIMEOUT Result, 67.4s OverallTime, 45 OverallIterations, 24 TraceHistogramMax, 28.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2167 SDtfs, 8654 SDslu, 31739 SDs, 0 SdLazy, 29330 SolverSat, 1635 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14843 GetRequests, 12507 SyntacticMatches, 0 SemanticMatches, 2336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48147 ImplicationChecksByTransitivity, 31.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=874occurred in iteration=41, 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.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 2162 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 25981 NumberOfCodeBlocks, 24444 NumberOfCodeBlocksAsserted, 260 NumberOfCheckSat, 25896 ConstructedInterpolants, 0 QuantifiedInterpolants, 23354592 SizeOfPredicates, 813 NumberOfNonLiveVariables, 15612 ConjunctsInSsa, 1046 ConjunctsInUnsatCore, 85 InterpolantComputations, 3 PerfectInterpolantSequences, 90931/136386 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/copysome2_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-28-17-617.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/copysome2_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-28-17-617.csv Completed graceful shutdown