java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_partition_original_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:19:24,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:19:24,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:19:24,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:19:24,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:19:24,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:19:24,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:19:24,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:19:24,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:19:24,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:19:24,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:19:24,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:19:24,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:19:24,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:19:24,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:19:24,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:19:24,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:19:24,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:19:24,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:19:24,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:19:24,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:19:24,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:19:24,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:19:24,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:19:24,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:19:24,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:19:24,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:19:24,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:19:24,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:19:24,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:19:24,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:19:24,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:19:24,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:19:24,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:19:24,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:19:24,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:19:24,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:19:24,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:19:24,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:19:24,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:19:24,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:19:24,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 10:19:24,627 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:19:24,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:19:24,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:19:24,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:19:24,629 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:19:24,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:19:24,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:19:24,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:19:24,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:19:24,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:19:24,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:19:24,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:19:24,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:19:24,631 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:19:24,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:19:24,632 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:19:24,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:19:24,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:19:24,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:19:24,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:19:24,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:19:24,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:19:24,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:19:24,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:19:24,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:19:24,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:19:24,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:19:24,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:19:24,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:19:24,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:19:24,709 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:19:24,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:19:24,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:19:24,717 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:19:24,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_original_ground.i [2019-09-07 10:19:24,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3258f74a/ad848a492deb496e84670fd73a6dacb7/FLAGed0f08843 [2019-09-07 10:19:25,242 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:19:25,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_original_ground.i [2019-09-07 10:19:25,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3258f74a/ad848a492deb496e84670fd73a6dacb7/FLAGed0f08843 [2019-09-07 10:19:25,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3258f74a/ad848a492deb496e84670fd73a6dacb7 [2019-09-07 10:19:25,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:19:25,640 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:19:25,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:19:25,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:19:25,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:19:25,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:19:25" (1/1) ... [2019-09-07 10:19:25,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60889099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:25, skipping insertion in model container [2019-09-07 10:19:25,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:19:25" (1/1) ... [2019-09-07 10:19:25,657 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:19:25,678 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:19:25,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:19:25,922 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:19:25,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:19:26,052 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:19:26,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26 WrapperNode [2019-09-07 10:19:26,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:19:26,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:19:26,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:19:26,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:19:26,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26" (1/1) ... [2019-09-07 10:19:26,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26" (1/1) ... [2019-09-07 10:19:26,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26" (1/1) ... [2019-09-07 10:19:26,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26" (1/1) ... [2019-09-07 10:19:26,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26" (1/1) ... [2019-09-07 10:19:26,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26" (1/1) ... [2019-09-07 10:19:26,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26" (1/1) ... [2019-09-07 10:19:26,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:19:26,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:19:26,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:19:26,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:19:26,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-07 10:19:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:19:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:19:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:19:26,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:19:26,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:19:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:19:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:19:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:19:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:19:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:19:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:19:26,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:19:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:19:26,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:19:26,488 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:19:26,489 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-07 10:19:26,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:19:26 BoogieIcfgContainer [2019-09-07 10:19:26,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:19:26,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:19:26,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:19:26,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:19:26,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:19:25" (1/3) ... [2019-09-07 10:19:26,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcdb75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:19:26, skipping insertion in model container [2019-09-07 10:19:26,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:19:26" (2/3) ... [2019-09-07 10:19:26,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcdb75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:19:26, skipping insertion in model container [2019-09-07 10:19:26,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:19:26" (3/3) ... [2019-09-07 10:19:26,503 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_partition_original_ground.i [2019-09-07 10:19:26,515 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:19:26,522 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:19:26,539 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:19:26,568 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:19:26,568 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:19:26,568 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:19:26,568 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:19:26,569 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:19:26,569 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:19:26,569 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:19:26,569 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:19:26,569 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:19:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-07 10:19:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 10:19:26,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:26,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:26,593 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1902154591, now seen corresponding path program 1 times [2019-09-07 10:19:26,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:26,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:26,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:26,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:19:26,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:19:26,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:19:26,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:19:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:19:26,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:19:26,756 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-09-07 10:19:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:26,794 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2019-09-07 10:19:26,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:19:26,796 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-07 10:19:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:26,809 INFO L225 Difference]: With dead ends: 56 [2019-09-07 10:19:26,809 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 10:19:26,815 INFO L628 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 [2019-09-07 10:19:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 10:19:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-07 10:19:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 10:19:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-09-07 10:19:26,875 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 14 [2019-09-07 10:19:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:26,876 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-09-07 10:19:26,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:19:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-09-07 10:19:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 10:19:26,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:26,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:26,879 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:26,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1137378726, now seen corresponding path program 1 times [2019-09-07 10:19:26,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:26,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:26,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:26,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:26,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:19:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:19:26,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:19:26,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:19:26,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:19:26,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:19:26,968 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-09-07 10:19:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:26,999 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-09-07 10:19:27,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:19:27,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-07 10:19:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:27,001 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:19:27,001 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 10:19:27,003 INFO L628 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 [2019-09-07 10:19:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 10:19:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-07 10:19:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:19:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-07 10:19:27,010 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 14 [2019-09-07 10:19:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:27,011 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-07 10:19:27,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:19:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-07 10:19:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 10:19:27,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:27,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:27,013 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -62722692, now seen corresponding path program 1 times [2019-09-07 10:19:27,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:27,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:27,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:19:27,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:19:27,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:19:27,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:19:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:19:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:19:27,079 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-09-07 10:19:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:27,131 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2019-09-07 10:19:27,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:19:27,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 10:19:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:27,133 INFO L225 Difference]: With dead ends: 47 [2019-09-07 10:19:27,134 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 10:19:27,134 INFO L628 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 [2019-09-07 10:19:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 10:19:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-07 10:19:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 10:19:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-09-07 10:19:27,142 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2019-09-07 10:19:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:27,142 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-09-07 10:19:27,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:19:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-09-07 10:19:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:19:27,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:27,144 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:27,144 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:27,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1291417548, now seen corresponding path program 1 times [2019-09-07 10:19:27,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:27,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:27,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:19:27,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:27,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:27,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:27,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:19:27,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:19:27,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:27,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:19:27,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:19:27,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:19:27,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:19:27,353 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2019-09-07 10:19:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:27,389 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-09-07 10:19:27,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:19:27,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-07 10:19:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:27,393 INFO L225 Difference]: With dead ends: 52 [2019-09-07 10:19:27,393 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 10:19:27,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:19:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 10:19:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-07 10:19:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 10:19:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-07 10:19:27,406 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 19 [2019-09-07 10:19:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:27,406 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-07 10:19:27,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:19:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-07 10:19:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 10:19:27,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:27,408 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:27,410 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:27,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:27,410 INFO L82 PathProgramCache]: Analyzing trace with hash -256890390, now seen corresponding path program 2 times [2019-09-07 10:19:27,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:27,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:27,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:19:27,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:27,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:27,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:19:27,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:19:27,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:27,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:19:27,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:19:27,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:27,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 10:19:27,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:19:27,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:19:27,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:19:27,586 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 7 states. [2019-09-07 10:19:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:27,702 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-09-07 10:19:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:19:27,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-09-07 10:19:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:27,704 INFO L225 Difference]: With dead ends: 59 [2019-09-07 10:19:27,705 INFO L226 Difference]: Without dead ends: 39 [2019-09-07 10:19:27,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:19:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-07 10:19:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-09-07 10:19:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-07 10:19:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-09-07 10:19:27,713 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 21 [2019-09-07 10:19:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:27,713 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-09-07 10:19:27,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:19:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-09-07 10:19:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 10:19:27,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:27,715 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:27,715 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1329681088, now seen corresponding path program 3 times [2019-09-07 10:19:27,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:27,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:27,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:27,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:19:27,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:27,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:27,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:19:27,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:19:27,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:27,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:19:27,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:19:27,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:27,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:19:27,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:19:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:19:27,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:19:27,893 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 6 states. [2019-09-07 10:19:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:27,945 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-09-07 10:19:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:19:27,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-09-07 10:19:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:27,947 INFO L225 Difference]: With dead ends: 57 [2019-09-07 10:19:27,947 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 10:19:27,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:19:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 10:19:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-09-07 10:19:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 10:19:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-09-07 10:19:27,954 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2019-09-07 10:19:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:27,954 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-09-07 10:19:27,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:19:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2019-09-07 10:19:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 10:19:27,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:27,956 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:27,956 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1506439560, now seen corresponding path program 4 times [2019-09-07 10:19:27,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:27,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 10:19:28,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:28,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:28,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:19:28,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:19:28,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:28,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:19:28,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 10:19:28,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:28,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:19:28,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:19:28,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:19:28,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:19:28,117 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 7 states. [2019-09-07 10:19:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:28,151 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-09-07 10:19:28,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:19:28,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-09-07 10:19:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:28,153 INFO L225 Difference]: With dead ends: 68 [2019-09-07 10:19:28,153 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 10:19:28,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:19:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 10:19:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-07 10:19:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 10:19:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-09-07 10:19:28,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 29 [2019-09-07 10:19:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:28,160 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-09-07 10:19:28,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:19:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-09-07 10:19:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 10:19:28,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:28,161 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:28,161 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:28,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash -921201114, now seen corresponding path program 5 times [2019-09-07 10:19:28,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:28,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:28,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:19:28,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:28,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:28,258 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:19:28,300 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 10:19:28,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:28,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:19:28,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:19:28,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:28,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:19:28,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:19:28,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:19:28,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:19:28,327 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 7 states. [2019-09-07 10:19:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:28,383 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2019-09-07 10:19:28,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:19:28,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-07 10:19:28,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:28,385 INFO L225 Difference]: With dead ends: 62 [2019-09-07 10:19:28,385 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 10:19:28,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:19:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 10:19:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-07 10:19:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 10:19:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-09-07 10:19:28,392 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 31 [2019-09-07 10:19:28,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:28,393 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-09-07 10:19:28,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:19:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-09-07 10:19:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 10:19:28,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:28,394 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:28,395 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1403971870, now seen corresponding path program 6 times [2019-09-07 10:19:28,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:28,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:28,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:19:28,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:28,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:19:28,502 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:28,541 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 10:19:28,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:28,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:19:28,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:19:28,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:28,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:19:28,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:19:28,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:19:28,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:19:28,568 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 8 states. [2019-09-07 10:19:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:28,607 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2019-09-07 10:19:28,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:19:28,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-09-07 10:19:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:28,611 INFO L225 Difference]: With dead ends: 76 [2019-09-07 10:19:28,611 INFO L226 Difference]: Without dead ends: 47 [2019-09-07 10:19:28,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:19:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-07 10:19:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-07 10:19:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 10:19:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-09-07 10:19:28,622 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 34 [2019-09-07 10:19:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:28,623 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-09-07 10:19:28,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:19:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-09-07 10:19:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 10:19:28,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:28,624 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:28,624 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:28,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:28,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1094198532, now seen corresponding path program 7 times [2019-09-07 10:19:28,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:28,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:28,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:19:28,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:28,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:28,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:28,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:19:28,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:19:28,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:28,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 10:19:28,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:19:28,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:19:28,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:19:28,947 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 13 states. [2019-09-07 10:19:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:29,100 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2019-09-07 10:19:29,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:19:29,100 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-09-07 10:19:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:29,101 INFO L225 Difference]: With dead ends: 83 [2019-09-07 10:19:29,102 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 10:19:29,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:19:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 10:19:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-09-07 10:19:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 10:19:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-09-07 10:19:29,108 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 36 [2019-09-07 10:19:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:29,109 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-09-07 10:19:29,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:19:29,109 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2019-09-07 10:19:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 10:19:29,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:29,111 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:29,111 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:29,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2105988510, now seen corresponding path program 8 times [2019-09-07 10:19:29,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:29,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:29,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:19:29,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:29,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:19:29,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:29,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:19:29,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:29,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:19:29,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 10:19:29,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:29,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 10:19:29,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:19:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:19:29,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:19:29,384 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 15 states. [2019-09-07 10:19:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:29,557 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-09-07 10:19:29,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:19:29,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-09-07 10:19:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:29,559 INFO L225 Difference]: With dead ends: 91 [2019-09-07 10:19:29,559 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 10:19:29,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:19:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 10:19:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-09-07 10:19:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 10:19:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-09-07 10:19:29,575 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 41 [2019-09-07 10:19:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:29,576 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-09-07 10:19:29,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:19:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-09-07 10:19:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 10:19:29,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:29,581 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:29,582 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash -687893304, now seen corresponding path program 9 times [2019-09-07 10:19:29,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:29,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:29,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:19:29,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:29,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:29,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:19:29,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 10:19:29,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:29,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:19:29,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:19:29,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:29,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:19:29,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:19:29,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:19:29,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:19:29,858 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 10 states. [2019-09-07 10:19:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:29,912 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-09-07 10:19:29,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:19:29,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-09-07 10:19:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:29,914 INFO L225 Difference]: With dead ends: 77 [2019-09-07 10:19:29,914 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 10:19:29,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:19:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 10:19:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-07 10:19:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-07 10:19:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-09-07 10:19:29,920 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 46 [2019-09-07 10:19:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:29,921 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-09-07 10:19:29,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:19:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-09-07 10:19:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 10:19:29,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:29,922 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:29,922 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:29,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:29,923 INFO L82 PathProgramCache]: Analyzing trace with hash -188089088, now seen corresponding path program 10 times [2019-09-07 10:19:29,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:29,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:29,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 10:19:30,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:30,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:19:30,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:19:30,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:30,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:19:30,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:19:30,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:30,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:19:30,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:19:30,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:19:30,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:19:30,112 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2019-09-07 10:19:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:30,184 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2019-09-07 10:19:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:19:30,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-09-07 10:19:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:30,185 INFO L225 Difference]: With dead ends: 100 [2019-09-07 10:19:30,185 INFO L226 Difference]: Without dead ends: 62 [2019-09-07 10:19:30,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:19:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-07 10:19:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-07 10:19:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 10:19:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-09-07 10:19:30,191 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 49 [2019-09-07 10:19:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:30,192 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-09-07 10:19:30,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:19:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-09-07 10:19:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:19:30,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:30,195 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:30,195 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash 75802270, now seen corresponding path program 11 times [2019-09-07 10:19:30,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:30,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:30,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:30,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:30,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 10:19:30,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:30,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:19:30,359 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:30,881 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-07 10:19:30,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:30,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:19:30,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 10:19:31,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:31,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 10:19:31,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:19:31,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:19:31,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:19:31,029 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 19 states. [2019-09-07 10:19:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:31,235 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2019-09-07 10:19:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:19:31,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-09-07 10:19:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:31,236 INFO L225 Difference]: With dead ends: 107 [2019-09-07 10:19:31,236 INFO L226 Difference]: Without dead ends: 69 [2019-09-07 10:19:31,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=486, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:19:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-07 10:19:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-09-07 10:19:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 10:19:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-09-07 10:19:31,252 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 51 [2019-09-07 10:19:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:31,252 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-09-07 10:19:31,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:19:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-09-07 10:19:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 10:19:31,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:31,256 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:31,256 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:31,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1248148620, now seen corresponding path program 12 times [2019-09-07 10:19:31,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:31,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:31,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:31,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:31,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 10:19:31,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:31,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:19:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:31,622 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 10:19:31,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:31,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:19:31,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:19:31,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:31,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 10:19:31,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:19:31,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:19:31,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:19:31,789 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 21 states. [2019-09-07 10:19:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:32,009 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2019-09-07 10:19:32,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:19:32,010 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-09-07 10:19:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:32,011 INFO L225 Difference]: With dead ends: 115 [2019-09-07 10:19:32,012 INFO L226 Difference]: Without dead ends: 74 [2019-09-07 10:19:32,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=600, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:19:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-07 10:19:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-09-07 10:19:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 10:19:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-09-07 10:19:32,018 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 56 [2019-09-07 10:19:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:32,018 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-09-07 10:19:32,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:19:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-09-07 10:19:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 10:19:32,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:32,019 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:32,020 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:32,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:32,020 INFO L82 PathProgramCache]: Analyzing trace with hash -437663014, now seen corresponding path program 13 times [2019-09-07 10:19:32,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:32,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:32,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:32,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:32,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 10:19:32,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:32,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:32,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:32,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:19:32,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-07 10:19:32,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:32,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-07 10:19:32,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:19:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:19:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:19:32,379 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 23 states. [2019-09-07 10:19:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:32,615 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2019-09-07 10:19:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:19:32,617 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2019-09-07 10:19:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:32,618 INFO L225 Difference]: With dead ends: 123 [2019-09-07 10:19:32,618 INFO L226 Difference]: Without dead ends: 79 [2019-09-07 10:19:32,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:19:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-07 10:19:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-09-07 10:19:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 10:19:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2019-09-07 10:19:32,624 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 61 [2019-09-07 10:19:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:32,624 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2019-09-07 10:19:32,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:19:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2019-09-07 10:19:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 10:19:32,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:32,625 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:32,625 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:32,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:32,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1723423824, now seen corresponding path program 14 times [2019-09-07 10:19:32,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:32,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:32,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:32,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:32,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 10:19:32,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:32,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:19:32,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:32,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:19:32,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:32,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:19:32,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-07 10:19:33,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:33,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 10:19:33,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:19:33,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:19:33,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:19:33,073 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 25 states. [2019-09-07 10:19:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:33,336 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-09-07 10:19:33,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:19:33,340 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66 [2019-09-07 10:19:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:33,340 INFO L225 Difference]: With dead ends: 131 [2019-09-07 10:19:33,341 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 10:19:33,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=468, Invalid=864, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:19:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 10:19:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-09-07 10:19:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 10:19:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2019-09-07 10:19:33,346 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 66 [2019-09-07 10:19:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:33,347 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2019-09-07 10:19:33,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:19:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2019-09-07 10:19:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 10:19:33,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:33,348 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:33,348 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash 676878102, now seen corresponding path program 15 times [2019-09-07 10:19:33,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:33,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:33,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:33,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:33,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:19:33,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:33,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:19:33,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:34,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 10:19:34,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:34,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:19:34,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:19:34,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:34,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:19:34,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:19:34,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:19:34,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:19:34,784 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 15 states. [2019-09-07 10:19:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:34,885 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2019-09-07 10:19:34,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:19:34,886 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2019-09-07 10:19:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:34,887 INFO L225 Difference]: With dead ends: 102 [2019-09-07 10:19:34,887 INFO L226 Difference]: Without dead ends: 86 [2019-09-07 10:19:34,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:19:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-07 10:19:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-09-07 10:19:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 10:19:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2019-09-07 10:19:34,893 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 71 [2019-09-07 10:19:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:34,893 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2019-09-07 10:19:34,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:19:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2019-09-07 10:19:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 10:19:34,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:34,895 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:34,895 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1556443122, now seen corresponding path program 16 times [2019-09-07 10:19:34,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:34,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:34,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:34,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:34,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:19:35,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:35,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:35,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:19:35,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:19:35,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:35,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:19:35,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:19:35,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:35,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:19:35,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:19:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:19:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:19:35,254 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand 16 states. [2019-09-07 10:19:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:35,306 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-09-07 10:19:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:19:35,307 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-09-07 10:19:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:35,308 INFO L225 Difference]: With dead ends: 140 [2019-09-07 10:19:35,308 INFO L226 Difference]: Without dead ends: 87 [2019-09-07 10:19:35,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:19:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-07 10:19:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-09-07 10:19:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 10:19:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2019-09-07 10:19:35,313 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 74 [2019-09-07 10:19:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:35,314 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2019-09-07 10:19:35,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:19:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2019-09-07 10:19:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 10:19:35,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:35,315 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:35,315 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash 776746004, now seen corresponding path program 17 times [2019-09-07 10:19:35,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:35,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:35,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 10:19:35,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:35,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:35,498 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:19:41,975 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 10:19:41,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:41,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:19:41,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 10:19:42,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:42,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:19:42,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:19:42,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:19:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:19:42,017 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand 16 states. [2019-09-07 10:19:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:42,129 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2019-09-07 10:19:42,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:19:42,130 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2019-09-07 10:19:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:42,131 INFO L225 Difference]: With dead ends: 107 [2019-09-07 10:19:42,131 INFO L226 Difference]: Without dead ends: 91 [2019-09-07 10:19:42,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:19:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-07 10:19:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-09-07 10:19:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 10:19:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2019-09-07 10:19:42,136 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 76 [2019-09-07 10:19:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:42,136 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2019-09-07 10:19:42,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:19:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2019-09-07 10:19:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 10:19:42,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:42,137 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:42,138 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:42,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:42,138 INFO L82 PathProgramCache]: Analyzing trace with hash 308775476, now seen corresponding path program 18 times [2019-09-07 10:19:42,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:42,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:42,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 10:19:42,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:42,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:19:42,351 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:46,286 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-07 10:19:46,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:46,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:19:46,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 10:19:46,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:46,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:19:46,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:19:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:19:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:19:46,337 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand 17 states. [2019-09-07 10:19:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:46,393 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2019-09-07 10:19:46,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:19:46,393 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2019-09-07 10:19:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:46,394 INFO L225 Difference]: With dead ends: 148 [2019-09-07 10:19:46,394 INFO L226 Difference]: Without dead ends: 92 [2019-09-07 10:19:46,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:19:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-07 10:19:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-07 10:19:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 10:19:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2019-09-07 10:19:46,399 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 79 [2019-09-07 10:19:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:46,399 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2019-09-07 10:19:46,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:19:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2019-09-07 10:19:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 10:19:46,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:46,401 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:46,401 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash -192935086, now seen corresponding path program 19 times [2019-09-07 10:19:46,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:46,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:46,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:46,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:46,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 10:19:46,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:46,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:46,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:46,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:19:46,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 10:19:46,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:46,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 10:19:46,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:19:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:19:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:19:46,918 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand 31 states. [2019-09-07 10:19:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:47,273 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-09-07 10:19:47,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:19:47,277 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2019-09-07 10:19:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:47,278 INFO L225 Difference]: With dead ends: 155 [2019-09-07 10:19:47,278 INFO L226 Difference]: Without dead ends: 99 [2019-09-07 10:19:47,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=720, Invalid=1350, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:19:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-07 10:19:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-09-07 10:19:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 10:19:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2019-09-07 10:19:47,284 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 81 [2019-09-07 10:19:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:47,285 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2019-09-07 10:19:47,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:19:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2019-09-07 10:19:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 10:19:47,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:47,286 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:47,286 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash 510526424, now seen corresponding path program 20 times [2019-09-07 10:19:47,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:47,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:47,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:19:47,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 10:19:47,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:47,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:47,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:19:47,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:19:47,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:47,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:19:47,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:19:47,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:47,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 10:19:47,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:19:47,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:19:47,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:19:47,804 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 33 states. [2019-09-07 10:19:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:48,202 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-09-07 10:19:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:19:48,203 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 86 [2019-09-07 10:19:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:48,204 INFO L225 Difference]: With dead ends: 163 [2019-09-07 10:19:48,204 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 10:19:48,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=816, Invalid=1536, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:19:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 10:19:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-09-07 10:19:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 10:19:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2019-09-07 10:19:48,211 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 86 [2019-09-07 10:19:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:48,211 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2019-09-07 10:19:48,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:19:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2019-09-07 10:19:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 10:19:48,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:48,213 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:48,213 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1443932046, now seen corresponding path program 21 times [2019-09-07 10:19:48,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:48,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:48,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:48,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:48,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 10:19:48,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:48,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:48,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:19:53,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-07 10:19:53,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:53,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:19:53,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 10:19:53,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:53,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 10:19:53,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:19:53,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:19:53,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:19:53,720 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 19 states. [2019-09-07 10:19:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:53,832 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2019-09-07 10:19:53,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:19:53,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2019-09-07 10:19:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:53,839 INFO L225 Difference]: With dead ends: 122 [2019-09-07 10:19:53,840 INFO L226 Difference]: Without dead ends: 106 [2019-09-07 10:19:53,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:19:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-07 10:19:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-09-07 10:19:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 10:19:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2019-09-07 10:19:53,845 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 91 [2019-09-07 10:19:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:53,845 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2019-09-07 10:19:53,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:19:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2019-09-07 10:19:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-07 10:19:53,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:53,847 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:53,847 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash -660493190, now seen corresponding path program 22 times [2019-09-07 10:19:53,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:53,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:53,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:53,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:53,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-07 10:19:54,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:54,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:54,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:19:54,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:19:54,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:54,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:19:54,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-07 10:19:54,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:54,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:19:54,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:19:54,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:19:54,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:19:54,514 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand 20 states. [2019-09-07 10:19:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:54,575 INFO L93 Difference]: Finished difference Result 172 states and 212 transitions. [2019-09-07 10:19:54,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:19:54,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2019-09-07 10:19:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:54,576 INFO L225 Difference]: With dead ends: 172 [2019-09-07 10:19:54,578 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 10:19:54,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:19:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 10:19:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-07 10:19:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-07 10:19:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2019-09-07 10:19:54,583 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 94 [2019-09-07 10:19:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:54,583 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2019-09-07 10:19:54,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:19:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2019-09-07 10:19:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 10:19:54,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:54,584 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:54,584 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:54,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1936657308, now seen corresponding path program 23 times [2019-09-07 10:19:54,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:54,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:54,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:54,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:54,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 10:19:54,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:54,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:19:54,840 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:20:29,243 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-07 10:20:29,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:20:29,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:20:29,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-07 10:20:29,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2019-09-07 10:20:29,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:20:29,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:20:29,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:20:29,734 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand 37 states. [2019-09-07 10:20:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:30,198 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-09-07 10:20:30,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:20:30,198 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2019-09-07 10:20:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:30,199 INFO L225 Difference]: With dead ends: 179 [2019-09-07 10:20:30,199 INFO L226 Difference]: Without dead ends: 114 [2019-09-07 10:20:30,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1944, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:20:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-07 10:20:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-09-07 10:20:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-07 10:20:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2019-09-07 10:20:30,206 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 96 [2019-09-07 10:20:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:30,206 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2019-09-07 10:20:30,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:20:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2019-09-07 10:20:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 10:20:30,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:30,208 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:30,208 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:30,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:30,208 INFO L82 PathProgramCache]: Analyzing trace with hash -138810422, now seen corresponding path program 24 times [2019-09-07 10:20:30,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:30,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:30,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:30,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:20:30,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 10:20:30,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:30,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:20:30,434 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:20:53,824 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:20:53,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:20:53,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:20:53,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-07 10:20:54,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:54,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 10:20:54,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:20:54,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:20:54,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:20:54,187 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand 39 states. [2019-09-07 10:20:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:54,654 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-09-07 10:20:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:20:54,655 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 101 [2019-09-07 10:20:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:54,656 INFO L225 Difference]: With dead ends: 187 [2019-09-07 10:20:54,657 INFO L226 Difference]: Without dead ends: 119 [2019-09-07 10:20:54,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1140, Invalid=2166, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:20:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-07 10:20:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-09-07 10:20:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-07 10:20:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2019-09-07 10:20:54,664 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 101 [2019-09-07 10:20:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:54,665 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2019-09-07 10:20:54,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:20:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2019-09-07 10:20:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 10:20:54,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:54,666 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:54,667 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1822395232, now seen corresponding path program 25 times [2019-09-07 10:20:54,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:54,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:54,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:20:54,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 10:20:54,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:54,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:20:54,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:20:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:54,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:20:54,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-07 10:20:55,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:55,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2019-09-07 10:20:55,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:20:55,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:20:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:20:55,358 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand 41 states. [2019-09-07 10:20:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:55,845 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-09-07 10:20:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 10:20:55,848 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 106 [2019-09-07 10:20:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:55,850 INFO L225 Difference]: With dead ends: 195 [2019-09-07 10:20:55,850 INFO L226 Difference]: Without dead ends: 124 [2019-09-07 10:20:55,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1260, Invalid=2400, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:20:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-07 10:20:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-09-07 10:20:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-07 10:20:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2019-09-07 10:20:55,857 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 106 [2019-09-07 10:20:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:55,857 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2019-09-07 10:20:55,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:20:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2019-09-07 10:20:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 10:20:55,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:55,858 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:55,858 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:55,859 INFO L82 PathProgramCache]: Analyzing trace with hash -550791162, now seen corresponding path program 26 times [2019-09-07 10:20:55,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:55,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:55,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:20:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 10:20:56,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:56,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:20:56,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:20:56,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:20:56,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:20:56,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:20:56,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:20:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:20:56,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:20:56,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-07 10:20:56,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:20:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:20:56,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:20:56,604 INFO L87 Difference]: Start difference. First operand 121 states and 144 transitions. Second operand 43 states. [2019-09-07 10:20:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:20:57,156 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-09-07 10:20:57,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 10:20:57,157 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 111 [2019-09-07 10:20:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:20:57,158 INFO L225 Difference]: With dead ends: 203 [2019-09-07 10:20:57,158 INFO L226 Difference]: Without dead ends: 129 [2019-09-07 10:20:57,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1386, Invalid=2646, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 10:20:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-07 10:20:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-09-07 10:20:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-07 10:20:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2019-09-07 10:20:57,171 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 111 [2019-09-07 10:20:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:20:57,171 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2019-09-07 10:20:57,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:20:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2019-09-07 10:20:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 10:20:57,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:20:57,172 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:20:57,172 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:20:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:20:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1873820892, now seen corresponding path program 27 times [2019-09-07 10:20:57,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:20:57,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:20:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:57,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:20:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:20:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:20:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 10:20:57,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:20:57,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:20:57,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:18,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-07 10:21:18,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:18,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:21:18,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 10:21:18,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:18,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:21:18,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:21:18,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:21:18,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:21:18,706 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 24 states. [2019-09-07 10:21:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:18,845 INFO L93 Difference]: Finished difference Result 147 states and 176 transitions. [2019-09-07 10:21:18,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:21:18,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 116 [2019-09-07 10:21:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:18,847 INFO L225 Difference]: With dead ends: 147 [2019-09-07 10:21:18,847 INFO L226 Difference]: Without dead ends: 131 [2019-09-07 10:21:18,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:21:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-07 10:21:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-09-07 10:21:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-07 10:21:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 154 transitions. [2019-09-07 10:21:18,855 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 154 transitions. Word has length 116 [2019-09-07 10:21:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:18,855 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 154 transitions. [2019-09-07 10:21:18,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:21:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 154 transitions. [2019-09-07 10:21:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 10:21:18,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:18,862 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:18,862 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash 244113700, now seen corresponding path program 28 times [2019-09-07 10:21:18,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:18,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:18,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:18,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:18,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-07 10:21:19,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:19,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:21:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:19,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:21:19,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:19,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:21:19,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-07 10:21:19,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:19,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:21:19,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:21:19,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:21:19,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:21:19,519 INFO L87 Difference]: Start difference. First operand 129 states and 154 transitions. Second operand 25 states. [2019-09-07 10:21:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:19,581 INFO L93 Difference]: Finished difference Result 212 states and 262 transitions. [2019-09-07 10:21:19,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:21:19,581 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 119 [2019-09-07 10:21:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:19,582 INFO L225 Difference]: With dead ends: 212 [2019-09-07 10:21:19,582 INFO L226 Difference]: Without dead ends: 132 [2019-09-07 10:21:19,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:21:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-07 10:21:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-07 10:21:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-07 10:21:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2019-09-07 10:21:19,587 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 119 [2019-09-07 10:21:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:19,588 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2019-09-07 10:21:19,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:21:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2019-09-07 10:21:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 10:21:19,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:19,589 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:19,590 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash 689269826, now seen corresponding path program 29 times [2019-09-07 10:21:19,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:19,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:19,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 10:21:19,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:19,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:21:20,013 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:22:47,650 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-07 10:22:47,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:47,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:22:47,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-07 10:22:48,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:48,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-09-07 10:22:48,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:22:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:22:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:22:48,133 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand 47 states. [2019-09-07 10:22:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:48,718 INFO L93 Difference]: Finished difference Result 219 states and 272 transitions. [2019-09-07 10:22:48,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:22:48,719 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 121 [2019-09-07 10:22:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:48,720 INFO L225 Difference]: With dead ends: 219 [2019-09-07 10:22:48,720 INFO L226 Difference]: Without dead ends: 139 [2019-09-07 10:22:48,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1656, Invalid=3174, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:22:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-07 10:22:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-09-07 10:22:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-07 10:22:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2019-09-07 10:22:48,727 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 121 [2019-09-07 10:22:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:48,727 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2019-09-07 10:22:48,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:22:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2019-09-07 10:22:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 10:22:48,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:48,729 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:48,729 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash -271584536, now seen corresponding path program 30 times [2019-09-07 10:22:48,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:48,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:48,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 10:22:49,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:49,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:22:49,040 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:24:09,921 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-09-07 10:24:09,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:09,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:24:09,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 10:24:10,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:10,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:24:10,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:24:10,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:24:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:24:10,011 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 26 states. [2019-09-07 10:24:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:10,169 INFO L93 Difference]: Finished difference Result 157 states and 188 transitions. [2019-09-07 10:24:10,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:24:10,169 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 126 [2019-09-07 10:24:10,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:10,170 INFO L225 Difference]: With dead ends: 157 [2019-09-07 10:24:10,170 INFO L226 Difference]: Without dead ends: 141 [2019-09-07 10:24:10,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:24:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-07 10:24:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-09-07 10:24:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-07 10:24:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2019-09-07 10:24:10,176 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 126 [2019-09-07 10:24:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:10,177 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2019-09-07 10:24:10,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:24:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2019-09-07 10:24:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 10:24:10,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:10,178 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:10,178 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:10,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1799132448, now seen corresponding path program 31 times [2019-09-07 10:24:10,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:10,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:10,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-09-07 10:24:10,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:10,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:24:10,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:10,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:24:10,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-09-07 10:24:10,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:10,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:24:10,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:24:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:24:10,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:24:10,759 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand 27 states. [2019-09-07 10:24:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:10,839 INFO L93 Difference]: Finished difference Result 228 states and 282 transitions. [2019-09-07 10:24:10,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:24:10,840 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 129 [2019-09-07 10:24:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:10,841 INFO L225 Difference]: With dead ends: 228 [2019-09-07 10:24:10,841 INFO L226 Difference]: Without dead ends: 142 [2019-09-07 10:24:10,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:24:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-07 10:24:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-09-07 10:24:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-07 10:24:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 168 transitions. [2019-09-07 10:24:10,846 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 168 transitions. Word has length 129 [2019-09-07 10:24:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:10,847 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 168 transitions. [2019-09-07 10:24:10,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:24:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 168 transitions. [2019-09-07 10:24:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 10:24:10,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:10,848 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:10,849 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash -987289474, now seen corresponding path program 32 times [2019-09-07 10:24:10,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:10,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-07 10:24:11,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:11,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:24:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:24:11,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:24:11,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:11,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:24:11,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-09-07 10:24:11,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:11,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 10:24:11,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:24:11,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:24:11,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:24:11,824 INFO L87 Difference]: Start difference. First operand 141 states and 168 transitions. Second operand 51 states. [2019-09-07 10:24:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:12,531 INFO L93 Difference]: Finished difference Result 235 states and 292 transitions. [2019-09-07 10:24:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:24:12,532 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 131 [2019-09-07 10:24:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:12,533 INFO L225 Difference]: With dead ends: 235 [2019-09-07 10:24:12,533 INFO L226 Difference]: Without dead ends: 149 [2019-09-07 10:24:12,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1950, Invalid=3750, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 10:24:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-07 10:24:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-09-07 10:24:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-07 10:24:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2019-09-07 10:24:12,541 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 131 [2019-09-07 10:24:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:12,541 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2019-09-07 10:24:12,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:24:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2019-09-07 10:24:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 10:24:12,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:12,542 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:12,542 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:12,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1802525356, now seen corresponding path program 33 times [2019-09-07 10:24:12,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:12,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:12,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1477 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 10:24:12,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:12,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:24:12,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:37,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-09-07 10:24:37,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:37,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:24:37,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1477 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 10:24:37,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:37,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:24:37,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:24:37,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:24:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:24:37,861 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 28 states. [2019-09-07 10:24:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:38,080 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2019-09-07 10:24:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:24:38,081 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 136 [2019-09-07 10:24:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:38,083 INFO L225 Difference]: With dead ends: 167 [2019-09-07 10:24:38,083 INFO L226 Difference]: Without dead ends: 151 [2019-09-07 10:24:38,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:24:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-07 10:24:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2019-09-07 10:24:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-07 10:24:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 178 transitions. [2019-09-07 10:24:38,090 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 178 transitions. Word has length 136 [2019-09-07 10:24:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:38,091 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 178 transitions. [2019-09-07 10:24:38,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:24:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 178 transitions. [2019-09-07 10:24:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 10:24:38,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:38,092 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:38,092 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:38,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:38,093 INFO L82 PathProgramCache]: Analyzing trace with hash 609139868, now seen corresponding path program 34 times [2019-09-07 10:24:38,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:38,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:38,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:38,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:38,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-09-07 10:24:38,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:38,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:24:38,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:39,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:24:39,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:39,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:24:39,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:24:39,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:39,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:24:39,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:24:39,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:24:39,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:24:39,257 INFO L87 Difference]: Start difference. First operand 149 states and 178 transitions. Second operand 29 states. [2019-09-07 10:24:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:39,374 INFO L93 Difference]: Finished difference Result 244 states and 302 transitions. [2019-09-07 10:24:39,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:24:39,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 139 [2019-09-07 10:24:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:39,377 INFO L225 Difference]: With dead ends: 244 [2019-09-07 10:24:39,377 INFO L226 Difference]: Without dead ends: 152 [2019-09-07 10:24:39,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:24:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-07 10:24:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-07 10:24:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-07 10:24:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 180 transitions. [2019-09-07 10:24:39,385 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 180 transitions. Word has length 139 [2019-09-07 10:24:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:39,387 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 180 transitions. [2019-09-07 10:24:39,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:24:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 180 transitions. [2019-09-07 10:24:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 10:24:39,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:39,389 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:39,389 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:39,389 INFO L82 PathProgramCache]: Analyzing trace with hash 839945402, now seen corresponding path program 35 times [2019-09-07 10:24:39,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:39,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:39,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:39,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 10:24:39,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:39,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:24:39,796 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:27:06,145 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-09-07 10:27:06,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:06,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:27:06,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 10:27:06,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:06,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:27:06,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:27:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:27:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:27:06,288 INFO L87 Difference]: Start difference. First operand 151 states and 180 transitions. Second operand 29 states. [2019-09-07 10:27:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:06,457 INFO L93 Difference]: Finished difference Result 172 states and 206 transitions. [2019-09-07 10:27:06,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:27:06,458 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 141 [2019-09-07 10:27:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:06,459 INFO L225 Difference]: With dead ends: 172 [2019-09-07 10:27:06,460 INFO L226 Difference]: Without dead ends: 156 [2019-09-07 10:27:06,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:27:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-07 10:27:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-09-07 10:27:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-07 10:27:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 184 transitions. [2019-09-07 10:27:06,466 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 184 transitions. Word has length 141 [2019-09-07 10:27:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:06,467 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 184 transitions. [2019-09-07 10:27:06,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:27:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 184 transitions. [2019-09-07 10:27:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 10:27:06,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:06,468 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:06,468 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:06,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:06,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1886365646, now seen corresponding path program 36 times [2019-09-07 10:27:06,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:06,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:06,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2019-09-07 10:27:06,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:06,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:27:06,965 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:59,723 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-09-07 10:28:59,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:59,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:28:59,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 10:29:00,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:00,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2019-09-07 10:29:00,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 10:29:00,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 10:29:00,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:29:00,378 INFO L87 Difference]: Start difference. First operand 154 states and 184 transitions. Second operand 56 states. [2019-09-07 10:29:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:01,190 INFO L93 Difference]: Finished difference Result 257 states and 320 transitions. [2019-09-07 10:29:01,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 10:29:01,190 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 144 [2019-09-07 10:29:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:01,191 INFO L225 Difference]: With dead ends: 257 [2019-09-07 10:29:01,191 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 10:29:01,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2323, Invalid=4483, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 10:29:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 10:29:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2019-09-07 10:29:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-07 10:29:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 190 transitions. [2019-09-07 10:29:01,197 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 190 transitions. Word has length 144 [2019-09-07 10:29:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:01,198 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 190 transitions. [2019-09-07 10:29:01,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 10:29:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 190 transitions. [2019-09-07 10:29:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 10:29:01,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:01,199 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:01,199 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1693881944, now seen corresponding path program 37 times [2019-09-07 10:29:01,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:01,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:01,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:01,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2019-09-07 10:29:01,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:01,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:29:01,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:29:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:01,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:29:01,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2019-09-07 10:29:01,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:01,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:29:01,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:29:01,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:29:01,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:29:01,735 INFO L87 Difference]: Start difference. First operand 159 states and 190 transitions. Second operand 31 states. [2019-09-07 10:29:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:01,824 INFO L93 Difference]: Finished difference Result 260 states and 322 transitions. [2019-09-07 10:29:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:29:01,824 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 149 [2019-09-07 10:29:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:01,825 INFO L225 Difference]: With dead ends: 260 [2019-09-07 10:29:01,825 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 10:29:01,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:29:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 10:29:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-07 10:29:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-07 10:29:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 192 transitions. [2019-09-07 10:29:01,830 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 192 transitions. Word has length 149 [2019-09-07 10:29:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:01,831 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 192 transitions. [2019-09-07 10:29:01,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:29:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 192 transitions. [2019-09-07 10:29:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 10:29:01,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:01,832 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:01,833 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:01,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash 964778230, now seen corresponding path program 38 times [2019-09-07 10:29:01,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:01,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:01,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:29:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 10:29:02,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:02,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:29:02,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:02,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:29:02,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:02,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:29:02,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2019-09-07 10:29:03,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:03,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2019-09-07 10:29:03,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 10:29:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 10:29:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:29:03,300 INFO L87 Difference]: Start difference. First operand 161 states and 192 transitions. Second operand 59 states. [2019-09-07 10:29:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:04,109 INFO L93 Difference]: Finished difference Result 267 states and 332 transitions. [2019-09-07 10:29:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 10:29:04,109 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 151 [2019-09-07 10:29:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:04,110 INFO L225 Difference]: With dead ends: 267 [2019-09-07 10:29:04,110 INFO L226 Difference]: Without dead ends: 169 [2019-09-07 10:29:04,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2610, Invalid=5046, Unknown=0, NotChecked=0, Total=7656 [2019-09-07 10:29:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-07 10:29:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-09-07 10:29:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-07 10:29:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 198 transitions. [2019-09-07 10:29:04,117 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 198 transitions. Word has length 151 [2019-09-07 10:29:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:04,120 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 198 transitions. [2019-09-07 10:29:04,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 10:29:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 198 transitions. [2019-09-07 10:29:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 10:29:04,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:04,122 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:04,122 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash -615329228, now seen corresponding path program 39 times [2019-09-07 10:29:04,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:04,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:04,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:04,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-07 10:29:04,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:04,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:29:04,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:30:14,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-07 10:30:14,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:14,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:30:14,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 57 proven. 1162 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 10:30:14,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:14,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 34 [2019-09-07 10:30:14,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:30:14,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:30:14,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=563, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:30:14,551 INFO L87 Difference]: Start difference. First operand 166 states and 198 transitions. Second operand 34 states. [2019-09-07 10:30:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:14,749 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2019-09-07 10:30:14,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:30:14,750 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 156 [2019-09-07 10:30:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:14,752 INFO L225 Difference]: With dead ends: 187 [2019-09-07 10:30:14,752 INFO L226 Difference]: Without dead ends: 171 [2019-09-07 10:30:14,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=627, Invalid=633, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:30:14,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-07 10:30:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-09-07 10:30:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-07 10:30:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2019-09-07 10:30:14,758 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 156 [2019-09-07 10:30:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:14,758 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2019-09-07 10:30:14,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:30:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2019-09-07 10:30:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 10:30:14,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:14,759 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:14,759 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:14,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1199749140, now seen corresponding path program 40 times [2019-09-07 10:30:14,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:14,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:14,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:14,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:14,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1247 trivial. 0 not checked. [2019-09-07 10:30:15,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:15,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:15,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:30:16,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:30:16,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:16,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:30:16,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1247 trivial. 0 not checked. [2019-09-07 10:30:16,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:16,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 10:30:16,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:30:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:30:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:30:16,588 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 33 states. [2019-09-07 10:30:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:16,724 INFO L93 Difference]: Finished difference Result 276 states and 342 transitions. [2019-09-07 10:30:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:30:16,725 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 159 [2019-09-07 10:30:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:16,728 INFO L225 Difference]: With dead ends: 276 [2019-09-07 10:30:16,729 INFO L226 Difference]: Without dead ends: 172 [2019-09-07 10:30:16,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:30:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-07 10:30:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-07 10:30:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-07 10:30:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 204 transitions. [2019-09-07 10:30:16,742 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 204 transitions. Word has length 159 [2019-09-07 10:30:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:16,743 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 204 transitions. [2019-09-07 10:30:16,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:30:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 204 transitions. [2019-09-07 10:30:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-07 10:30:16,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:16,744 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:16,744 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:16,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1406579406, now seen corresponding path program 41 times [2019-09-07 10:30:16,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:16,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:16,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:16,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:16,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 10:30:17,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:17,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:30:17,256 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:33:14,233 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-07 10:33:14,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:14,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:33:14,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1247 trivial. 0 not checked. [2019-09-07 10:33:15,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:15,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 63 [2019-09-07 10:33:15,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:33:15,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:33:15,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:33:15,093 INFO L87 Difference]: Start difference. First operand 171 states and 204 transitions. Second operand 63 states. [2019-09-07 10:33:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:16,004 INFO L93 Difference]: Finished difference Result 283 states and 352 transitions. [2019-09-07 10:33:16,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 10:33:16,005 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 161 [2019-09-07 10:33:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:16,006 INFO L225 Difference]: With dead ends: 283 [2019-09-07 10:33:16,006 INFO L226 Difference]: Without dead ends: 179 [2019-09-07 10:33:16,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2976, Invalid=5766, Unknown=0, NotChecked=0, Total=8742 [2019-09-07 10:33:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-07 10:33:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-09-07 10:33:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-07 10:33:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 210 transitions. [2019-09-07 10:33:16,012 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 210 transitions. Word has length 161 [2019-09-07 10:33:16,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:16,012 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 210 transitions. [2019-09-07 10:33:16,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:33:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 210 transitions. [2019-09-07 10:33:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-07 10:33:16,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:16,014 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:16,014 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash -13278728, now seen corresponding path program 42 times [2019-09-07 10:33:16,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:16,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:16,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:16,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2296 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 10:33:16,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:16,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:33:16,605 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE