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/loop-acceleration/array_3-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:26:49,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:26:49,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:26:49,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:26:49,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:26:49,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:26:49,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:26:49,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:26:49,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:26:49,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:26:49,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:26:49,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:26:49,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:26:49,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:26:49,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:26:49,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:26:49,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:26:49,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:26:49,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:26:49,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:26:49,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:26:49,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:26:49,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:26:49,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:26:49,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:26:49,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:26:49,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:26:49,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:26:49,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:26:49,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:26:49,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:26:49,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:26:49,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:26:49,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:26:49,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:26:49,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:26:49,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:26:49,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:26:49,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:26:49,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:26:49,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:26:49,621 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-03 19:26:49,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:26:49,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:26:49,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:26:49,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:26:49,645 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:26:49,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:26:49,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:26:49,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:26:49,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:26:49,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:26:49,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:26:49,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:26:49,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:26:49,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:26:49,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:26:49,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:26:49,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:26:49,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:26:49,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:26:49,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:26:49,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:26:49,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:26:49,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:26:49,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:26:49,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:26:49,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:26:49,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:26:49,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:26:49,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:26:49,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:26:49,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:26:49,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:26:49,695 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:26:49,696 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:26:49,696 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-2.i [2019-09-03 19:26:49,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e34074d4/8eb0461ed0a84d10b042fa28ffab9326/FLAGb55a168fa [2019-09-03 19:26:50,173 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:26:50,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-2.i [2019-09-03 19:26:50,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e34074d4/8eb0461ed0a84d10b042fa28ffab9326/FLAGb55a168fa [2019-09-03 19:26:50,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e34074d4/8eb0461ed0a84d10b042fa28ffab9326 [2019-09-03 19:26:50,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:26:50,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:26:50,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:26:50,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:26:50,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:26:50,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:26:50" (1/1) ... [2019-09-03 19:26:50,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bee0674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50, skipping insertion in model container [2019-09-03 19:26:50,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:26:50" (1/1) ... [2019-09-03 19:26:50,599 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:26:50,615 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:26:50,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:26:50,801 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:26:50,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:26:50,843 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:26:50,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50 WrapperNode [2019-09-03 19:26:50,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:26:50,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:26:50,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:26:50,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:26:50,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50" (1/1) ... [2019-09-03 19:26:50,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50" (1/1) ... [2019-09-03 19:26:50,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50" (1/1) ... [2019-09-03 19:26:50,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50" (1/1) ... [2019-09-03 19:26:50,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50" (1/1) ... [2019-09-03 19:26:50,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50" (1/1) ... [2019-09-03 19:26:50,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50" (1/1) ... [2019-09-03 19:26:50,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:26:50,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:26:50,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:26:50,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:26:50,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50" (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-03 19:26:51,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:26:51,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:26:51,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:26:51,019 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:26:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:26:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:26:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:26:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:26:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:26:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:26:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:26:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:26:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:26:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:26:51,227 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:26:51,227 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:26:51,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:26:51 BoogieIcfgContainer [2019-09-03 19:26:51,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:26:51,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:26:51,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:26:51,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:26:51,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:26:50" (1/3) ... [2019-09-03 19:26:51,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248a5db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:26:51, skipping insertion in model container [2019-09-03 19:26:51,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:26:50" (2/3) ... [2019-09-03 19:26:51,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248a5db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:26:51, skipping insertion in model container [2019-09-03 19:26:51,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:26:51" (3/3) ... [2019-09-03 19:26:51,236 INFO L109 eAbstractionObserver]: Analyzing ICFG array_3-2.i [2019-09-03 19:26:51,247 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:26:51,254 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:26:51,274 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:26:51,317 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:26:51,321 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:26:51,321 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:26:51,321 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:26:51,321 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:26:51,322 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:26:51,322 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:26:51,322 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:26:51,322 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:26:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-03 19:26:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:26:51,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:51,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:51,355 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:51,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1584649929, now seen corresponding path program 1 times [2019-09-03 19:26:51,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:51,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:51,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:51,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:51,478 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-03 19:26:51,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:26:51,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:26:51,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:26:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:26:51,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:26:51,495 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-03 19:26:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:51,514 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-03 19:26:51,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:26:51,515 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-03 19:26:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:51,521 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:26:51,521 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:26:51,524 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-03 19:26:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:26:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 19:26:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 19:26:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-03 19:26:51,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-09-03 19:26:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:51,557 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-03 19:26:51,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:26:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-03 19:26:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:26:51,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:51,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:51,559 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:51,560 INFO L82 PathProgramCache]: Analyzing trace with hash -963606854, now seen corresponding path program 1 times [2019-09-03 19:26:51,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:51,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:51,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:51,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:51,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:51,636 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-03 19:26:51,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:26:51,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:26:51,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:26:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:26:51,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:26:51,643 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-09-03 19:26:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:51,698 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-09-03 19:26:51,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:26:51,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-03 19:26:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:51,701 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:26:51,702 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:26:51,703 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-03 19:26:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:26:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-09-03 19:26:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:26:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-03 19:26:51,710 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-09-03 19:26:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:51,710 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-03 19:26:51,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:26:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-03 19:26:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:26:51,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:51,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:51,712 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -544788776, now seen corresponding path program 1 times [2019-09-03 19:26:51,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:51,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:51,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:51,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:51,828 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-03 19:26:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:26:51,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:26:51,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:26:51,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:26:51,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:26:51,830 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 5 states. [2019-09-03 19:26:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:51,889 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-09-03 19:26:51,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:26:51,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:26:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:51,891 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:26:51,891 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:26:51,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:26:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:26:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-09-03 19:26:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:26:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-03 19:26:51,898 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2019-09-03 19:26:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:51,898 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-03 19:26:51,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:26:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-03 19:26:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:26:51,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:51,900 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-03 19:26:51,900 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:51,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:51,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1315898579, now seen corresponding path program 1 times [2019-09-03 19:26:51,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:51,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:51,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:51,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 19:26:51,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:51,948 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-03 19:26:51,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:51,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 19:26:51,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 19:26:52,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:52,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:26:52,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:26:52,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:26:52,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:26:52,030 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2019-09-03 19:26:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:52,078 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-09-03 19:26:52,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:26:52,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-03 19:26:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:52,080 INFO L225 Difference]: With dead ends: 44 [2019-09-03 19:26:52,080 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:26:52,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-03 19:26:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:26:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-09-03 19:26:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:26:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-09-03 19:26:52,086 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2019-09-03 19:26:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:52,086 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-09-03 19:26:52,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:26:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-09-03 19:26:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:26:52,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:52,087 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:52,088 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1597858191, now seen corresponding path program 2 times [2019-09-03 19:26:52,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:52,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 19:26:52,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:52,159 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) [2019-09-03 19:26:52,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:52,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:26:52,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:52,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:26:52,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 19:26:52,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:52,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:26:52,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:26:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:26:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:26:52,240 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2019-09-03 19:26:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:52,311 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-09-03 19:26:52,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:26:52,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-03 19:26:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:52,313 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:26:52,313 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:26:52,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-03 19:26:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:26:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-09-03 19:26:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 19:26:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-03 19:26:52,319 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2019-09-03 19:26:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:52,320 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-03 19:26:52,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:26:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-03 19:26:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:26:52,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:52,321 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:52,322 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1399437169, now seen corresponding path program 3 times [2019-09-03 19:26:52,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:52,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:52,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:52,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 19:26:52,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:52,408 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-03 19:26:52,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:26:52,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 19:26:52,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:52,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:26:52,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:52,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 19:26:52,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:52,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-03 19:26:52,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:26:52,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:26:52,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:26:52,530 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 9 states. [2019-09-03 19:26:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:52,617 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-09-03 19:26:52,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:26:52,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-09-03 19:26:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:52,619 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:26:52,619 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:26:52,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:26:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:26:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-03 19:26:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:26:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-09-03 19:26:52,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 25 [2019-09-03 19:26:52,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:52,626 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-09-03 19:26:52,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:26:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-09-03 19:26:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:26:52,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:52,628 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:52,628 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash 893709598, now seen corresponding path program 4 times [2019-09-03 19:26:52,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:52,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:52,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:52,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:52,701 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-03 19:26:52,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:26:52,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:26:52,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:52,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:26:52,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:52,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:52,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:26:52,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:26:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:26:52,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:26:52,784 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-09-03 19:26:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:52,864 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-09-03 19:26:52,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:26:52,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-09-03 19:26:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:52,867 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:26:52,867 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:26:52,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 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-03 19:26:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:26:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-09-03 19:26:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:26:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-09-03 19:26:52,879 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2019-09-03 19:26:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:52,879 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-09-03 19:26:52,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:26:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-09-03 19:26:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:26:52,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:52,881 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:52,885 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2087492412, now seen corresponding path program 5 times [2019-09-03 19:26:52,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:52,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:52,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:52,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:52,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:52,990 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) [2019-09-03 19:26:53,003 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:53,039 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:26:53,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:53,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:26:53,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:26:53,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:53,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:26:53,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:26:53,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:26:53,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:26:53,076 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 9 states. [2019-09-03 19:26:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:53,144 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2019-09-03 19:26:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:26:53,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-09-03 19:26:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:53,146 INFO L225 Difference]: With dead ends: 81 [2019-09-03 19:26:53,146 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:26:53,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:26:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:26:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2019-09-03 19:26:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:26:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-09-03 19:26:53,153 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 41 [2019-09-03 19:26:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:53,153 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-09-03 19:26:53,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:26:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-09-03 19:26:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 19:26:53,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:53,155 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:53,155 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1738458662, now seen corresponding path program 6 times [2019-09-03 19:26:53,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:53,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:53,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:53,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:53,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:53,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:53,255 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:53,279 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:26:53,323 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:26:53,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:53,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:26:53,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:53,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:53,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:26:53,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:26:53,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:26:53,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:26:53,358 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 10 states. [2019-09-03 19:26:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:53,447 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2019-09-03 19:26:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:26:53,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-09-03 19:26:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:53,448 INFO L225 Difference]: With dead ends: 88 [2019-09-03 19:26:53,449 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 19:26:53,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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-03 19:26:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 19:26:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2019-09-03 19:26:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:26:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-09-03 19:26:53,464 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 43 [2019-09-03 19:26:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:53,464 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-09-03 19:26:53,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:26:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-09-03 19:26:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:26:53,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:53,466 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:53,467 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:53,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1985435400, now seen corresponding path program 7 times [2019-09-03 19:26:53,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:53,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:53,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:53,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:53,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:53,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:53,611 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-03 19:26:53,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:53,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:26:53,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:53,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:53,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:26:53,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:26:53,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:26:53,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:26:53,690 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 11 states. [2019-09-03 19:26:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:53,768 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2019-09-03 19:26:53,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:26:53,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-09-03 19:26:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:53,770 INFO L225 Difference]: With dead ends: 95 [2019-09-03 19:26:53,770 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 19:26:53,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 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-03 19:26:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 19:26:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2019-09-03 19:26:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:26:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-09-03 19:26:53,777 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 45 [2019-09-03 19:26:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:53,777 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-09-03 19:26:53,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:26:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-09-03 19:26:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:26:53,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:53,778 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:53,779 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1188087958, now seen corresponding path program 8 times [2019-09-03 19:26:53,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:53,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:53,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:53,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:53,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:53,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:53,885 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-03 19:26:53,907 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-03 19:26:53,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:26:53,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:53,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:26:53,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:53,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:53,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 19:26:53,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:26:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:26:53,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:26:53,974 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 12 states. [2019-09-03 19:26:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:54,079 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2019-09-03 19:26:54,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:26:54,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-09-03 19:26:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:54,080 INFO L225 Difference]: With dead ends: 102 [2019-09-03 19:26:54,081 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 19:26:54,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:26:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 19:26:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 50. [2019-09-03 19:26:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:26:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-09-03 19:26:54,087 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 47 [2019-09-03 19:26:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:54,087 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-09-03 19:26:54,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:26:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-09-03 19:26:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:26:54,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:54,091 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:54,091 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:54,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1517254836, now seen corresponding path program 9 times [2019-09-03 19:26:54,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:54,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:54,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:54,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:54,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:26:54,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:54,221 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) [2019-09-03 19:26:54,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:54,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 19:26:54,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:54,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:26:54,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:54,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 19:26:54,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:54,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2019-09-03 19:26:54,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:26:54,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:26:54,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:26:54,335 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 15 states. [2019-09-03 19:26:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:54,448 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2019-09-03 19:26:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:26:54,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2019-09-03 19:26:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:54,451 INFO L225 Difference]: With dead ends: 111 [2019-09-03 19:26:54,452 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 19:26:54,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:26:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 19:26:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-03 19:26:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 19:26:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-09-03 19:26:54,459 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 49 [2019-09-03 19:26:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:54,459 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-09-03 19:26:54,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:26:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-09-03 19:26:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 19:26:54,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:54,461 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:54,461 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1277783220, now seen corresponding path program 10 times [2019-09-03 19:26:54,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:54,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:54,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 19:26:54,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:54,604 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-03 19:26:54,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:26:54,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:26:54,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:54,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:26:54,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:26:54,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:54,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:26:54,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:26:54,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:26:54,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:26:54,694 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 14 states. [2019-09-03 19:26:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:54,781 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-09-03 19:26:54,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:26:54,781 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2019-09-03 19:26:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:54,782 INFO L225 Difference]: With dead ends: 134 [2019-09-03 19:26:54,783 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 19:26:54,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:26:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 19:26:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-09-03 19:26:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 19:26:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-09-03 19:26:54,798 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 75 [2019-09-03 19:26:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:54,798 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-09-03 19:26:54,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:26:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-09-03 19:26:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 19:26:54,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:54,800 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:54,804 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:54,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1422072878, now seen corresponding path program 11 times [2019-09-03 19:26:54,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:54,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:54,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:54,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:54,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 19:26:54,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:54,956 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:54,982 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:26:55,117 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:26:55,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:55,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:26:55,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 19:26:55,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:55,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 19:26:55,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:26:55,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:26:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:26:55,181 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 15 states. [2019-09-03 19:26:55,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:55,272 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2019-09-03 19:26:55,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:26:55,272 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 77 [2019-09-03 19:26:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:55,273 INFO L225 Difference]: With dead ends: 141 [2019-09-03 19:26:55,273 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 19:26:55,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:26:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 19:26:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2019-09-03 19:26:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:26:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2019-09-03 19:26:55,280 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 77 [2019-09-03 19:26:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:55,280 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2019-09-03 19:26:55,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:26:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2019-09-03 19:26:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 19:26:55,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:55,281 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:55,282 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1823536272, now seen corresponding path program 12 times [2019-09-03 19:26:55,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:55,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:55,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:55,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:55,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:55,415 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-03 19:26:55,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:55,415 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-03 19:26:55,430 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-03 19:26:55,608 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:26:55,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:55,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:26:55,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:55,629 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-03 19:26:55,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:55,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 19:26:55,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:26:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:26:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:26:55,635 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 16 states. [2019-09-03 19:26:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:55,738 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2019-09-03 19:26:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:26:55,739 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2019-09-03 19:26:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:55,740 INFO L225 Difference]: With dead ends: 148 [2019-09-03 19:26:55,740 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 19:26:55,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:26:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 19:26:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2019-09-03 19:26:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 19:26:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-09-03 19:26:55,746 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 79 [2019-09-03 19:26:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:55,746 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-09-03 19:26:55,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:26:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-09-03 19:26:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 19:26:55,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:55,747 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:55,748 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1082801266, now seen corresponding path program 13 times [2019-09-03 19:26:55,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:55,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:55,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:55,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 19:26:55,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:55,927 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-03 19:26:55,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:55,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:26:55,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 19:26:56,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:56,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:26:56,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:26:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:26:56,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:26:56,042 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 17 states. [2019-09-03 19:26:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:56,160 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2019-09-03 19:26:56,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:26:56,164 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-09-03 19:26:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:56,165 INFO L225 Difference]: With dead ends: 155 [2019-09-03 19:26:56,165 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 19:26:56,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 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-03 19:26:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 19:26:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2019-09-03 19:26:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-03 19:26:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-09-03 19:26:56,170 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 81 [2019-09-03 19:26:56,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:56,170 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-09-03 19:26:56,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:26:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-09-03 19:26:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 19:26:56,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:56,172 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:56,172 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:56,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:56,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2093935660, now seen corresponding path program 14 times [2019-09-03 19:26:56,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:56,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:56,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:56,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:56,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 19:26:56,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:56,339 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-03 19:26:56,356 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-03 19:26:56,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:26:56,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:56,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:26:56,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 19:26:56,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:56,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 19:26:56,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:26:56,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:26:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:26:56,447 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 18 states. [2019-09-03 19:26:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:56,588 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2019-09-03 19:26:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:26:56,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2019-09-03 19:26:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:56,589 INFO L225 Difference]: With dead ends: 162 [2019-09-03 19:26:56,589 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 19:26:56,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:26:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 19:26:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 86. [2019-09-03 19:26:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 19:26:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-09-03 19:26:56,595 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 83 [2019-09-03 19:26:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:56,596 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-09-03 19:26:56,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:26:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-09-03 19:26:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-03 19:26:56,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:56,597 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:56,597 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:56,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1216374090, now seen corresponding path program 15 times [2019-09-03 19:26:56,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:56,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 19:26:56,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:56,793 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-03 19:26:56,813 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-03 19:26:56,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 19:26:56,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:56,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:26:56,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:56,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 19:26:56,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:56,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 21 [2019-09-03 19:26:56,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:26:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:26:56,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:26:56,980 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 21 states. [2019-09-03 19:26:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:57,142 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2019-09-03 19:26:57,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:26:57,143 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2019-09-03 19:26:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:57,144 INFO L225 Difference]: With dead ends: 171 [2019-09-03 19:26:57,144 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:26:57,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:26:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:26:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-09-03 19:26:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 19:26:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-09-03 19:26:57,149 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 85 [2019-09-03 19:26:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:57,149 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-09-03 19:26:57,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:26:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-09-03 19:26:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-03 19:26:57,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:57,150 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:57,151 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:57,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1858273206, now seen corresponding path program 16 times [2019-09-03 19:26:57,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:57,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:57,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:57,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:57,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-03 19:26:57,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:57,330 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-03 19:26:57,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:26:57,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:26:57,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:57,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:26:57,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-03 19:26:57,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:57,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:26:57,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:26:57,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:26:57,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:26:57,443 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 20 states. [2019-09-03 19:26:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:57,588 INFO L93 Difference]: Finished difference Result 194 states and 232 transitions. [2019-09-03 19:26:57,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:26:57,589 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2019-09-03 19:26:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:57,590 INFO L225 Difference]: With dead ends: 194 [2019-09-03 19:26:57,590 INFO L226 Difference]: Without dead ends: 121 [2019-09-03 19:26:57,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:26:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-03 19:26:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-09-03 19:26:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 19:26:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2019-09-03 19:26:57,594 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 111 [2019-09-03 19:26:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:57,595 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2019-09-03 19:26:57,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:26:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2019-09-03 19:26:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-03 19:26:57,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:57,596 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:57,596 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:57,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:57,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1942732904, now seen corresponding path program 17 times [2019-09-03 19:26:57,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:57,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:57,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:57,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:57,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-03 19:26:57,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:57,809 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) [2019-09-03 19:26:57,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:58,239 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 19:26:58,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:58,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:26:58,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-03 19:26:58,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:58,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 19:26:58,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:26:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:26:58,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:26:58,276 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 21 states. [2019-09-03 19:26:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:58,413 INFO L93 Difference]: Finished difference Result 201 states and 241 transitions. [2019-09-03 19:26:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:26:58,414 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 113 [2019-09-03 19:26:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:58,415 INFO L225 Difference]: With dead ends: 201 [2019-09-03 19:26:58,415 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 19:26:58,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:26:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 19:26:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-09-03 19:26:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 19:26:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2019-09-03 19:26:58,421 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 113 [2019-09-03 19:26:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:58,421 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2019-09-03 19:26:58,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:26:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2019-09-03 19:26:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-03 19:26:58,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:58,423 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:58,423 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:58,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:58,423 INFO L82 PathProgramCache]: Analyzing trace with hash -307564282, now seen corresponding path program 18 times [2019-09-03 19:26:58,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:58,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:58,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-03 19:26:58,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:58,663 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) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:58,675 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:26:59,234 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:26:59,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:59,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:26:59,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:26:59,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:59,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 19:26:59,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:26:59,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:26:59,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:26:59,294 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 22 states. [2019-09-03 19:26:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:59,467 INFO L93 Difference]: Finished difference Result 208 states and 250 transitions. [2019-09-03 19:26:59,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:26:59,467 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2019-09-03 19:26:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:59,468 INFO L225 Difference]: With dead ends: 208 [2019-09-03 19:26:59,468 INFO L226 Difference]: Without dead ends: 135 [2019-09-03 19:26:59,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:26:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-03 19:26:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2019-09-03 19:26:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 19:26:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2019-09-03 19:26:59,473 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 115 [2019-09-03 19:26:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:59,473 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2019-09-03 19:26:59,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:26:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2019-09-03 19:26:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 19:26:59,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:59,475 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:59,475 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:59,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1820357156, now seen corresponding path program 19 times [2019-09-03 19:26:59,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:59,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:59,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:59,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:59,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-03 19:26:59,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:59,701 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) [2019-09-03 19:26:59,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:59,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:26:59,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-03 19:26:59,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:59,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:26:59,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:26:59,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:26:59,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:26:59,798 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 23 states. [2019-09-03 19:26:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:59,941 INFO L93 Difference]: Finished difference Result 215 states and 259 transitions. [2019-09-03 19:26:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:26:59,943 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-09-03 19:26:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:59,945 INFO L225 Difference]: With dead ends: 215 [2019-09-03 19:26:59,945 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 19:26:59,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:26:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 19:26:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 120. [2019-09-03 19:26:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:26:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2019-09-03 19:26:59,953 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 117 [2019-09-03 19:26:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:59,953 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2019-09-03 19:26:59,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:26:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2019-09-03 19:26:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-03 19:26:59,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:59,954 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:59,955 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1946541118, now seen corresponding path program 20 times [2019-09-03 19:26:59,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:59,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:59,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:59,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:59,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-03 19:27:00,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:00,219 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-03 19:27:00,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:27:00,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:27:00,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:00,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:27:00,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 528 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-03 19:27:00,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:00,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 19:27:00,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:27:00,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:27:00,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:27:00,341 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 24 states. [2019-09-03 19:27:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:00,502 INFO L93 Difference]: Finished difference Result 222 states and 268 transitions. [2019-09-03 19:27:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:27:00,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2019-09-03 19:27:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:00,503 INFO L225 Difference]: With dead ends: 222 [2019-09-03 19:27:00,503 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 19:27:00,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 119 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-03 19:27:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 19:27:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2019-09-03 19:27:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 19:27:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2019-09-03 19:27:00,508 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 119 [2019-09-03 19:27:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:00,508 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2019-09-03 19:27:00,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:27:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2019-09-03 19:27:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 19:27:00,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:00,510 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:00,510 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:00,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1278351904, now seen corresponding path program 21 times [2019-09-03 19:27:00,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:00,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:00,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:00,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-03 19:27:00,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:00,781 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-03 19:27:00,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:27:01,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 19:27:01,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:01,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:27:01,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:01,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-03 19:27:01,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:01,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 27 [2019-09-03 19:27:01,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:27:01,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:27:01,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:27:01,142 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 27 states. [2019-09-03 19:27:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:01,345 INFO L93 Difference]: Finished difference Result 231 states and 279 transitions. [2019-09-03 19:27:01,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:27:01,345 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 121 [2019-09-03 19:27:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:01,346 INFO L225 Difference]: With dead ends: 231 [2019-09-03 19:27:01,346 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 19:27:01,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=308, Invalid=448, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:27:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 19:27:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-03 19:27:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-03 19:27:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2019-09-03 19:27:01,352 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 121 [2019-09-03 19:27:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:01,352 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2019-09-03 19:27:01,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:27:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2019-09-03 19:27:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-03 19:27:01,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:01,353 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:01,353 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:01,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1942005728, now seen corresponding path program 22 times [2019-09-03 19:27:01,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:01,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:01,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:01,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:01,688 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-03 19:27:01,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:27:01,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:27:01,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:01,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:27:01,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:01,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:01,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 19:27:01,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:27:01,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:27:01,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:27:01,787 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand 26 states. [2019-09-03 19:27:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:01,972 INFO L93 Difference]: Finished difference Result 254 states and 304 transitions. [2019-09-03 19:27:01,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:27:01,972 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 147 [2019-09-03 19:27:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:01,974 INFO L225 Difference]: With dead ends: 254 [2019-09-03 19:27:01,974 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 19:27:01,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 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-03 19:27:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 19:27:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2019-09-03 19:27:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:27:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2019-09-03 19:27:01,980 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 147 [2019-09-03 19:27:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:01,981 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2019-09-03 19:27:01,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:27:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2019-09-03 19:27:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 19:27:01,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:01,982 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:01,982 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash -744869634, now seen corresponding path program 23 times [2019-09-03 19:27:01,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:01,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:01,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:02,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:02,284 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-03 19:27:02,293 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:27:02,875 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-03 19:27:02,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:02,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:27:02,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:02,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:02,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 19:27:02,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:27:02,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:27:02,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:27:02,916 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand 27 states. [2019-09-03 19:27:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:03,113 INFO L93 Difference]: Finished difference Result 261 states and 313 transitions. [2019-09-03 19:27:03,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:27:03,114 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2019-09-03 19:27:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:03,115 INFO L225 Difference]: With dead ends: 261 [2019-09-03 19:27:03,115 INFO L226 Difference]: Without dead ends: 164 [2019-09-03 19:27:03,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:27:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-03 19:27:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-09-03 19:27:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 19:27:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2019-09-03 19:27:03,121 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 149 [2019-09-03 19:27:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:03,121 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2019-09-03 19:27:03,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:27:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2019-09-03 19:27:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-03 19:27:03,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:03,122 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:03,123 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1556747620, now seen corresponding path program 24 times [2019-09-03 19:27:03,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:03,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:03,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:03,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:03,550 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-03 19:27:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:27:05,790 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:27:05,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:05,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:27:05,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:05,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:05,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 19:27:05,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:27:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:27:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:27:05,824 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 28 states. [2019-09-03 19:27:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:06,019 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2019-09-03 19:27:06,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:27:06,019 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 151 [2019-09-03 19:27:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:06,021 INFO L225 Difference]: With dead ends: 268 [2019-09-03 19:27:06,021 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:27:06,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 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-03 19:27:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:27:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2019-09-03 19:27:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 19:27:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2019-09-03 19:27:06,027 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 151 [2019-09-03 19:27:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:06,027 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2019-09-03 19:27:06,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:27:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2019-09-03 19:27:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 19:27:06,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:06,028 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:06,028 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash -87444294, now seen corresponding path program 25 times [2019-09-03 19:27:06,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:06,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:06,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:06,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:06,438 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) [2019-09-03 19:27:06,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:06,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:27:06,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:06,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:06,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 19:27:06,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:27:06,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:27:06,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:27:06,570 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 29 states. [2019-09-03 19:27:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:06,766 INFO L93 Difference]: Finished difference Result 275 states and 331 transitions. [2019-09-03 19:27:06,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:27:06,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 153 [2019-09-03 19:27:06,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:06,768 INFO L225 Difference]: With dead ends: 275 [2019-09-03 19:27:06,768 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 19:27:06,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 153 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-03 19:27:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 19:27:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 156. [2019-09-03 19:27:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 19:27:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2019-09-03 19:27:06,774 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 153 [2019-09-03 19:27:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:06,774 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2019-09-03 19:27:06,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:27:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2019-09-03 19:27:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-03 19:27:06,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:06,779 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:06,779 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1131188392, now seen corresponding path program 26 times [2019-09-03 19:27:06,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:06,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:06,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:27:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:07,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:07,224 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) [2019-09-03 19:27:07,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:07,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:27:07,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:07,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:27:07,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 990 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-03 19:27:07,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:07,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-03 19:27:07,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:27:07,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:27:07,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:27:07,390 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 30 states. [2019-09-03 19:27:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:07,631 INFO L93 Difference]: Finished difference Result 282 states and 340 transitions. [2019-09-03 19:27:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:27:07,632 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 155 [2019-09-03 19:27:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:07,633 INFO L225 Difference]: With dead ends: 282 [2019-09-03 19:27:07,633 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 19:27:07,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:27:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 19:27:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2019-09-03 19:27:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-03 19:27:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2019-09-03 19:27:07,639 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 155 [2019-09-03 19:27:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:07,639 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2019-09-03 19:27:07,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:27:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2019-09-03 19:27:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 19:27:07,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:07,640 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:07,641 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 853080694, now seen corresponding path program 27 times [2019-09-03 19:27:07,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:07,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-03 19:27:08,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:08,099 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) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:08,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:27:09,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-03 19:27:09,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:09,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:27:09,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:09,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 19:27:09,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:09,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 33 [2019-09-03 19:27:09,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:27:09,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:27:09,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=587, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:27:09,701 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand 33 states. [2019-09-03 19:27:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:09,945 INFO L93 Difference]: Finished difference Result 291 states and 351 transitions. [2019-09-03 19:27:09,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:27:09,945 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 157 [2019-09-03 19:27:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:09,946 INFO L225 Difference]: With dead ends: 291 [2019-09-03 19:27:09,946 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 19:27:09,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=473, Invalid=649, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:27:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 19:27:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-03 19:27:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 19:27:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2019-09-03 19:27:09,953 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 157 [2019-09-03 19:27:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:09,953 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2019-09-03 19:27:09,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:27:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2019-09-03 19:27:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-03 19:27:09,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:09,954 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:09,955 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1433756534, now seen corresponding path program 28 times [2019-09-03 19:27:09,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:09,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:09,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:09,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:09,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:10,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:10,391 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) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:10,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:27:10,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:27:10,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:10,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:27:10,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:10,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:10,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-03 19:27:10,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:27:10,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:27:10,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:27:10,526 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand 32 states. [2019-09-03 19:27:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:10,759 INFO L93 Difference]: Finished difference Result 314 states and 376 transitions. [2019-09-03 19:27:10,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:27:10,760 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 183 [2019-09-03 19:27:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:10,761 INFO L225 Difference]: With dead ends: 314 [2019-09-03 19:27:10,761 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 19:27:10,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:27:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 19:27:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 186. [2019-09-03 19:27:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-03 19:27:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 216 transitions. [2019-09-03 19:27:10,767 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 216 transitions. Word has length 183 [2019-09-03 19:27:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:10,768 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 216 transitions. [2019-09-03 19:27:10,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:27:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 216 transitions. [2019-09-03 19:27:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-03 19:27:10,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:10,769 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:10,770 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1700186732, now seen corresponding path program 29 times [2019-09-03 19:27:10,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:10,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:11,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:11,239 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-03 19:27:11,258 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:27:13,152 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-03 19:27:13,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:13,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:27:13,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:13,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:13,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-03 19:27:13,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:27:13,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:27:13,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:27:13,199 INFO L87 Difference]: Start difference. First operand 186 states and 216 transitions. Second operand 33 states. [2019-09-03 19:27:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:13,447 INFO L93 Difference]: Finished difference Result 321 states and 385 transitions. [2019-09-03 19:27:13,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:27:13,447 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 185 [2019-09-03 19:27:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:13,448 INFO L225 Difference]: With dead ends: 321 [2019-09-03 19:27:13,449 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 19:27:13,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:27:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 19:27:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 188. [2019-09-03 19:27:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-03 19:27:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2019-09-03 19:27:13,458 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 185 [2019-09-03 19:27:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:13,458 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2019-09-03 19:27:13,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:27:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2019-09-03 19:27:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-03 19:27:13,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:13,459 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:13,460 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:13,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:13,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1647376434, now seen corresponding path program 30 times [2019-09-03 19:27:13,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:13,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:13,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:13,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:13,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2496 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:14,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:14,023 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-03 19:27:14,046 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:27:21,389 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 19:27:21,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:21,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:27:21,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2496 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:21,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:21,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-03 19:27:21,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:27:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:27:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:27:21,454 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand 34 states. [2019-09-03 19:27:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:21,714 INFO L93 Difference]: Finished difference Result 328 states and 394 transitions. [2019-09-03 19:27:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:27:21,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 187 [2019-09-03 19:27:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:21,716 INFO L225 Difference]: With dead ends: 328 [2019-09-03 19:27:21,716 INFO L226 Difference]: Without dead ends: 207 [2019-09-03 19:27:21,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:27:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-03 19:27:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2019-09-03 19:27:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 19:27:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2019-09-03 19:27:21,724 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 187 [2019-09-03 19:27:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:21,724 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2019-09-03 19:27:21,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:27:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2019-09-03 19:27:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 19:27:21,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:21,727 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:21,727 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:21,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1725074256, now seen corresponding path program 31 times [2019-09-03 19:27:21,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:21,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:21,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:21,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:21,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:22,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:22,259 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-03 19:27:22,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:27:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:22,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:27:22,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:22,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:22,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-03 19:27:22,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:27:22,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:27:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:27:22,388 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand 35 states. [2019-09-03 19:27:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:22,641 INFO L93 Difference]: Finished difference Result 335 states and 403 transitions. [2019-09-03 19:27:22,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:27:22,641 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2019-09-03 19:27:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:22,643 INFO L225 Difference]: With dead ends: 335 [2019-09-03 19:27:22,644 INFO L226 Difference]: Without dead ends: 214 [2019-09-03 19:27:22,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:27:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-03 19:27:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 192. [2019-09-03 19:27:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 19:27:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2019-09-03 19:27:22,652 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 189 [2019-09-03 19:27:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:22,653 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2019-09-03 19:27:22,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:27:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2019-09-03 19:27:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-03 19:27:22,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:22,657 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:22,657 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:22,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:22,658 INFO L82 PathProgramCache]: Analyzing trace with hash -916730130, now seen corresponding path program 32 times [2019-09-03 19:27:22,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:22,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:22,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:22,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:27:22,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2620 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:23,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:23,348 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) [2019-09-03 19:27:23,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:23,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:27:23,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:23,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:27:23,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2620 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:23,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:23,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-03 19:27:23,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:27:23,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:27:23,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:27:23,501 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 36 states. [2019-09-03 19:27:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:23,779 INFO L93 Difference]: Finished difference Result 342 states and 412 transitions. [2019-09-03 19:27:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:27:23,780 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 191 [2019-09-03 19:27:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:23,781 INFO L225 Difference]: With dead ends: 342 [2019-09-03 19:27:23,781 INFO L226 Difference]: Without dead ends: 221 [2019-09-03 19:27:23,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:27:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-03 19:27:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2019-09-03 19:27:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 19:27:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 224 transitions. [2019-09-03 19:27:23,788 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 224 transitions. Word has length 191 [2019-09-03 19:27:23,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:23,788 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 224 transitions. [2019-09-03 19:27:23,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:27:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 224 transitions. [2019-09-03 19:27:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-03 19:27:23,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:23,790 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:23,790 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:23,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:23,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1365073140, now seen corresponding path program 33 times [2019-09-03 19:27:23,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:23,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:23,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:23,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:23,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2685 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-03 19:27:24,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:24,312 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) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:24,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:27:29,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-03 19:27:29,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:29,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:27:29,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:29,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2685 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 19:27:29,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:29,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 39 [2019-09-03 19:27:29,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:27:29,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:27:29,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:27:29,957 INFO L87 Difference]: Start difference. First operand 194 states and 224 transitions. Second operand 39 states. [2019-09-03 19:27:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:30,270 INFO L93 Difference]: Finished difference Result 351 states and 423 transitions. [2019-09-03 19:27:30,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:27:30,271 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 193 [2019-09-03 19:27:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:30,272 INFO L225 Difference]: With dead ends: 351 [2019-09-03 19:27:30,272 INFO L226 Difference]: Without dead ends: 222 [2019-09-03 19:27:30,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=674, Invalid=886, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:27:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-03 19:27:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-09-03 19:27:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 19:27:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2019-09-03 19:27:30,279 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 193 [2019-09-03 19:27:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:30,280 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2019-09-03 19:27:30,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:27:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2019-09-03 19:27:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-03 19:27:30,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:30,281 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:30,282 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:30,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1251750668, now seen corresponding path program 34 times [2019-09-03 19:27:30,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:30,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:30,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:30,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:30,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:27:30,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:30,872 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) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:30,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:27:30,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:27:30,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:30,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:27:30,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:27:31,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:31,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-03 19:27:31,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:27:31,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:27:31,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:27:31,021 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand 38 states. [2019-09-03 19:27:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:31,362 INFO L93 Difference]: Finished difference Result 374 states and 448 transitions. [2019-09-03 19:27:31,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:27:31,362 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 219 [2019-09-03 19:27:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:31,363 INFO L225 Difference]: With dead ends: 374 [2019-09-03 19:27:31,364 INFO L226 Difference]: Without dead ends: 229 [2019-09-03 19:27:31,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:27:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-03 19:27:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 222. [2019-09-03 19:27:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-03 19:27:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 258 transitions. [2019-09-03 19:27:31,370 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 258 transitions. Word has length 219 [2019-09-03 19:27:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:31,370 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 258 transitions. [2019-09-03 19:27:31,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:27:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 258 transitions. [2019-09-03 19:27:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-03 19:27:31,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:31,372 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:31,372 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:31,372 INFO L82 PathProgramCache]: Analyzing trace with hash 729402922, now seen corresponding path program 35 times [2019-09-03 19:27:31,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:31,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:31,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:31,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:31,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:27:31,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:31,966 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-03 19:27:31,976 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:27:34,954 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-03 19:27:34,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:34,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:27:34,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:27:35,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:35,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-03 19:27:35,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:27:35,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:27:35,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:27:35,016 INFO L87 Difference]: Start difference. First operand 222 states and 258 transitions. Second operand 39 states. [2019-09-03 19:27:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:35,379 INFO L93 Difference]: Finished difference Result 381 states and 457 transitions. [2019-09-03 19:27:35,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:27:35,379 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 221 [2019-09-03 19:27:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:35,380 INFO L225 Difference]: With dead ends: 381 [2019-09-03 19:27:35,381 INFO L226 Difference]: Without dead ends: 236 [2019-09-03 19:27:35,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:27:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-03 19:27:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2019-09-03 19:27:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-03 19:27:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 260 transitions. [2019-09-03 19:27:35,387 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 260 transitions. Word has length 221 [2019-09-03 19:27:35,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:35,387 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 260 transitions. [2019-09-03 19:27:35,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:27:35,387 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 260 transitions. [2019-09-03 19:27:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-03 19:27:35,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:35,389 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:35,389 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:35,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1264392648, now seen corresponding path program 36 times [2019-09-03 19:27:35,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:35,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:35,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:27:36,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:36,101 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) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:28:11,651 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 19:28:11,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:11,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:28:11,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:28:11,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:11,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-03 19:28:11,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:28:11,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:28:11,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:28:11,734 INFO L87 Difference]: Start difference. First operand 224 states and 260 transitions. Second operand 40 states. [2019-09-03 19:28:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:12,048 INFO L93 Difference]: Finished difference Result 388 states and 466 transitions. [2019-09-03 19:28:12,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:28:12,048 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 223 [2019-09-03 19:28:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:12,050 INFO L225 Difference]: With dead ends: 388 [2019-09-03 19:28:12,050 INFO L226 Difference]: Without dead ends: 243 [2019-09-03 19:28:12,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:28:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-03 19:28:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 226. [2019-09-03 19:28:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 19:28:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 262 transitions. [2019-09-03 19:28:12,056 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 262 transitions. Word has length 223 [2019-09-03 19:28:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:12,056 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 262 transitions. [2019-09-03 19:28:12,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:28:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 262 transitions. [2019-09-03 19:28:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-03 19:28:12,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:12,058 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:12,058 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash -6556186, now seen corresponding path program 37 times [2019-09-03 19:28:12,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:12,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:12,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3715 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:28:12,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:12,991 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) [2019-09-03 19:28:13,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:13,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:28:13,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3715 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:28:13,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:13,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-03 19:28:13,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:28:13,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:28:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:28:13,145 INFO L87 Difference]: Start difference. First operand 226 states and 262 transitions. Second operand 41 states. [2019-09-03 19:28:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:13,489 INFO L93 Difference]: Finished difference Result 395 states and 475 transitions. [2019-09-03 19:28:13,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:28:13,489 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 225 [2019-09-03 19:28:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:13,491 INFO L225 Difference]: With dead ends: 395 [2019-09-03 19:28:13,491 INFO L226 Difference]: Without dead ends: 250 [2019-09-03 19:28:13,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:28:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-03 19:28:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 228. [2019-09-03 19:28:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-03 19:28:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 264 transitions. [2019-09-03 19:28:13,499 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 264 transitions. Word has length 225 [2019-09-03 19:28:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:13,499 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 264 transitions. [2019-09-03 19:28:13,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:28:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 264 transitions. [2019-09-03 19:28:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-03 19:28:13,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:13,501 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:13,501 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1617673596, now seen corresponding path program 38 times [2019-09-03 19:28:13,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:13,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:13,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:13,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:13,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3790 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:28:14,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:14,145 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) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:14,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:28:14,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:28:14,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:14,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:28:14,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3790 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:28:14,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:14,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-03 19:28:14,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:28:14,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:28:14,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:28:14,293 INFO L87 Difference]: Start difference. First operand 228 states and 264 transitions. Second operand 42 states. [2019-09-03 19:28:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:14,654 INFO L93 Difference]: Finished difference Result 402 states and 484 transitions. [2019-09-03 19:28:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:28:14,654 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 227 [2019-09-03 19:28:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:14,656 INFO L225 Difference]: With dead ends: 402 [2019-09-03 19:28:14,657 INFO L226 Difference]: Without dead ends: 257 [2019-09-03 19:28:14,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:28:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-03 19:28:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 230. [2019-09-03 19:28:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-03 19:28:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 266 transitions. [2019-09-03 19:28:14,665 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 266 transitions. Word has length 227 [2019-09-03 19:28:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:14,665 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 266 transitions. [2019-09-03 19:28:14,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:28:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 266 transitions. [2019-09-03 19:28:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-03 19:28:14,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:14,667 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:14,667 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash 581689250, now seen corresponding path program 39 times [2019-09-03 19:28:14,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:14,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:14,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:14,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:14,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:15,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-03 19:28:15,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:15,365 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) [2019-09-03 19:28:15,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:28,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-03 19:28:28,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:28,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:28:28,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:28,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:28:29,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:29,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 39] total 45 [2019-09-03 19:28:29,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:28:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:28:29,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=1073, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:28:29,068 INFO L87 Difference]: Start difference. First operand 230 states and 266 transitions. Second operand 45 states. [2019-09-03 19:28:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:29,439 INFO L93 Difference]: Finished difference Result 411 states and 495 transitions. [2019-09-03 19:28:29,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:28:29,441 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 229 [2019-09-03 19:28:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:29,443 INFO L225 Difference]: With dead ends: 411 [2019-09-03 19:28:29,443 INFO L226 Difference]: Without dead ends: 258 [2019-09-03 19:28:29,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=911, Invalid=1159, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:28:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-03 19:28:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-03 19:28:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-03 19:28:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 298 transitions. [2019-09-03 19:28:29,450 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 298 transitions. Word has length 229 [2019-09-03 19:28:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:29,451 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 298 transitions. [2019-09-03 19:28:29,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:28:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 298 transitions. [2019-09-03 19:28:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-03 19:28:29,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:29,453 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:29,453 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash -638183774, now seen corresponding path program 40 times [2019-09-03 19:28:29,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:29,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:29,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4840 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-03 19:28:30,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:30,172 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) [2019-09-03 19:28:30,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:30,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:28:30,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:30,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:28:30,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4840 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:28:30,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:30,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-03 19:28:30,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:28:30,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:28:30,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:28:30,364 INFO L87 Difference]: Start difference. First operand 256 states and 298 transitions. Second operand 44 states. [2019-09-03 19:28:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:30,871 INFO L93 Difference]: Finished difference Result 434 states and 520 transitions. [2019-09-03 19:28:30,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:28:30,872 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 255 [2019-09-03 19:28:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:30,875 INFO L225 Difference]: With dead ends: 434 [2019-09-03 19:28:30,875 INFO L226 Difference]: Without dead ends: 265 [2019-09-03 19:28:30,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:28:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-03 19:28:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 258. [2019-09-03 19:28:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-03 19:28:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 300 transitions. [2019-09-03 19:28:30,887 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 300 transitions. Word has length 255 [2019-09-03 19:28:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:30,887 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 300 transitions. [2019-09-03 19:28:30,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:28:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 300 transitions. [2019-09-03 19:28:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-03 19:28:30,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:30,891 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:30,891 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash 990706368, now seen corresponding path program 41 times [2019-09-03 19:28:30,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:30,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:30,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-03 19:28:31,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:31,968 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) [2019-09-03 19:28:31,994 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:35,213 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-03 19:28:35,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:35,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:28:35,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-03 19:28:35,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:35,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-03 19:28:35,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:28:35,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:28:35,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:28:35,280 INFO L87 Difference]: Start difference. First operand 258 states and 300 transitions. Second operand 45 states. [2019-09-03 19:28:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:35,659 INFO L93 Difference]: Finished difference Result 441 states and 529 transitions. [2019-09-03 19:28:35,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:28:35,659 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 257 [2019-09-03 19:28:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:35,660 INFO L225 Difference]: With dead ends: 441 [2019-09-03 19:28:35,660 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 19:28:35,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:28:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 19:28:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-03 19:28:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-03 19:28:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 302 transitions. [2019-09-03 19:28:35,667 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 302 transitions. Word has length 257 [2019-09-03 19:28:35,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:35,668 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 302 transitions. [2019-09-03 19:28:35,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:28:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 302 transitions. [2019-09-03 19:28:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-03 19:28:35,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:35,669 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:35,670 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1308930210, now seen corresponding path program 42 times [2019-09-03 19:28:35,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:35,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:35,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5004 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-03 19:28:36,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:36,429 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-03 19:28:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:29:40,729 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-03 19:29:40,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:40,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:29:40,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5004 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-03 19:29:40,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:40,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-03 19:29:40,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:29:40,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:29:40,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:29:40,842 INFO L87 Difference]: Start difference. First operand 260 states and 302 transitions. Second operand 46 states. [2019-09-03 19:29:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:41,249 INFO L93 Difference]: Finished difference Result 448 states and 538 transitions. [2019-09-03 19:29:41,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:29:41,249 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 259 [2019-09-03 19:29:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:41,253 INFO L225 Difference]: With dead ends: 448 [2019-09-03 19:29:41,253 INFO L226 Difference]: Without dead ends: 279 [2019-09-03 19:29:41,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:29:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-03 19:29:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 262. [2019-09-03 19:29:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-03 19:29:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 304 transitions. [2019-09-03 19:29:41,259 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 304 transitions. Word has length 259 [2019-09-03 19:29:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:41,260 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 304 transitions. [2019-09-03 19:29:41,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:29:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 304 transitions. [2019-09-03 19:29:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-03 19:29:41,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:41,261 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:41,262 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 648475772, now seen corresponding path program 43 times [2019-09-03 19:29:41,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:41,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:41,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:41,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5089 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-03 19:29:42,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:42,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:42,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:42,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:29:42,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5089 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:29:42,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:42,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-03 19:29:42,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:29:42,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:29:42,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:29:42,258 INFO L87 Difference]: Start difference. First operand 262 states and 304 transitions. Second operand 47 states. [2019-09-03 19:29:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:42,783 INFO L93 Difference]: Finished difference Result 455 states and 547 transitions. [2019-09-03 19:29:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:29:42,784 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 261 [2019-09-03 19:29:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:42,785 INFO L225 Difference]: With dead ends: 455 [2019-09-03 19:29:42,786 INFO L226 Difference]: Without dead ends: 286 [2019-09-03 19:29:42,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:29:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-03 19:29:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 264. [2019-09-03 19:29:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-03 19:29:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 306 transitions. [2019-09-03 19:29:42,794 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 306 transitions. Word has length 261 [2019-09-03 19:29:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:42,794 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 306 transitions. [2019-09-03 19:29:42,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:29:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 306 transitions. [2019-09-03 19:29:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-03 19:29:42,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:42,796 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:42,796 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:42,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash 519948826, now seen corresponding path program 44 times [2019-09-03 19:29:42,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:42,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:42,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5176 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-03 19:29:43,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:43,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:43,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:29:43,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:29:43,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:43,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:29:43,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5176 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-03 19:29:43,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:43,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-03 19:29:43,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:29:43,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:29:43,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:29:43,942 INFO L87 Difference]: Start difference. First operand 264 states and 306 transitions. Second operand 48 states. [2019-09-03 19:29:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:44,283 INFO L93 Difference]: Finished difference Result 462 states and 556 transitions. [2019-09-03 19:29:44,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:29:44,284 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 263 [2019-09-03 19:29:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:44,286 INFO L225 Difference]: With dead ends: 462 [2019-09-03 19:29:44,286 INFO L226 Difference]: Without dead ends: 293 [2019-09-03 19:29:44,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:29:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-03 19:29:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 266. [2019-09-03 19:29:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-03 19:29:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 308 transitions. [2019-09-03 19:29:44,293 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 308 transitions. Word has length 263 [2019-09-03 19:29:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:44,294 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 308 transitions. [2019-09-03 19:29:44,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:29:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 308 transitions. [2019-09-03 19:29:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-03 19:29:44,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:44,296 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:44,296 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1559605304, now seen corresponding path program 45 times [2019-09-03 19:29:44,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:44,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:44,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-03 19:29:45,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:45,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:30:16,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-09-03 19:30:16,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:16,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:30:16,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:16,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-03 19:30:16,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:16,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 45] total 50 [2019-09-03 19:30:16,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:30:16,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:30:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:30:16,696 INFO L87 Difference]: Start difference. First operand 266 states and 308 transitions. Second operand 50 states. [2019-09-03 19:30:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:17,139 INFO L93 Difference]: Finished difference Result 471 states and 567 transitions. [2019-09-03 19:30:17,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:30:17,139 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 265 [2019-09-03 19:30:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:17,141 INFO L225 Difference]: With dead ends: 471 [2019-09-03 19:30:17,141 INFO L226 Difference]: Without dead ends: 294 [2019-09-03 19:30:17,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1136, Invalid=1414, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:30:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-03 19:30:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-09-03 19:30:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-03 19:30:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 340 transitions. [2019-09-03 19:30:17,148 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 340 transitions. Word has length 265 [2019-09-03 19:30:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:17,149 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 340 transitions. [2019-09-03 19:30:17,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:30:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 340 transitions. [2019-09-03 19:30:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-03 19:30:17,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:17,151 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:17,151 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1128001992, now seen corresponding path program 46 times [2019-09-03 19:30:17,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:17,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:17,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:30:18,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:18,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:18,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:30:18,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:30:18,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:18,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:30:18,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:30:18,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:18,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-03 19:30:18,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:30:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:30:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:30:18,429 INFO L87 Difference]: Start difference. First operand 292 states and 340 transitions. Second operand 50 states. [2019-09-03 19:30:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:18,817 INFO L93 Difference]: Finished difference Result 494 states and 592 transitions. [2019-09-03 19:30:18,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:30:18,817 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 291 [2019-09-03 19:30:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:18,819 INFO L225 Difference]: With dead ends: 494 [2019-09-03 19:30:18,819 INFO L226 Difference]: Without dead ends: 301 [2019-09-03 19:30:18,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:30:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-03 19:30:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 294. [2019-09-03 19:30:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-03 19:30:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 342 transitions. [2019-09-03 19:30:18,826 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 342 transitions. Word has length 291 [2019-09-03 19:30:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:18,827 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 342 transitions. [2019-09-03 19:30:18,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:30:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 342 transitions. [2019-09-03 19:30:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-03 19:30:18,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:18,829 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:18,829 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1864123562, now seen corresponding path program 47 times [2019-09-03 19:30:18,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:18,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:18,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:18,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6487 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:30:19,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:19,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:19,849 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:30:34,540 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-03 19:30:34,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:34,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:30:34,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6487 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:30:34,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:34,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-03 19:30:34,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:30:34,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:30:34,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:30:34,641 INFO L87 Difference]: Start difference. First operand 294 states and 342 transitions. Second operand 51 states. [2019-09-03 19:30:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:35,310 INFO L93 Difference]: Finished difference Result 501 states and 601 transitions. [2019-09-03 19:30:35,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:30:35,311 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 293 [2019-09-03 19:30:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:35,313 INFO L225 Difference]: With dead ends: 501 [2019-09-03 19:30:35,313 INFO L226 Difference]: Without dead ends: 308 [2019-09-03 19:30:35,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:30:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-03 19:30:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 296. [2019-09-03 19:30:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 19:30:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 344 transitions. [2019-09-03 19:30:35,319 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 344 transitions. Word has length 293 [2019-09-03 19:30:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:35,320 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 344 transitions. [2019-09-03 19:30:35,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:30:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 344 transitions. [2019-09-03 19:30:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-03 19:30:35,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:35,322 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:35,323 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash -607348492, now seen corresponding path program 48 times [2019-09-03 19:30:35,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:35,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:35,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:35,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:30:36,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:36,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:36,407 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:31:29,211 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-03 19:31:29,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:29,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:31:29,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:31:29,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:29,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-03 19:31:29,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:31:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:31:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:31:29,297 INFO L87 Difference]: Start difference. First operand 296 states and 344 transitions. Second operand 52 states. [2019-09-03 19:31:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:29,785 INFO L93 Difference]: Finished difference Result 508 states and 610 transitions. [2019-09-03 19:31:29,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:31:29,785 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 295 [2019-09-03 19:31:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:29,787 INFO L225 Difference]: With dead ends: 508 [2019-09-03 19:31:29,787 INFO L226 Difference]: Without dead ends: 315 [2019-09-03 19:31:29,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:31:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-03 19:31:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 298. [2019-09-03 19:31:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-03 19:31:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 346 transitions. [2019-09-03 19:31:29,793 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 346 transitions. Word has length 295 [2019-09-03 19:31:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:29,794 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 346 transitions. [2019-09-03 19:31:29,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:31:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 346 transitions. [2019-09-03 19:31:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-03 19:31:29,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:29,796 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:29,796 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:29,797 INFO L82 PathProgramCache]: Analyzing trace with hash 267683602, now seen corresponding path program 49 times [2019-09-03 19:31:29,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:29,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:29,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6679 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:31:30,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:30,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:30,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:31:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:30,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:31:30,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6679 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:31:31,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:31,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-03 19:31:31,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:31:31,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:31:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:31:31,051 INFO L87 Difference]: Start difference. First operand 298 states and 346 transitions. Second operand 53 states. [2019-09-03 19:31:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:31,459 INFO L93 Difference]: Finished difference Result 515 states and 619 transitions. [2019-09-03 19:31:31,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:31:31,459 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 297 [2019-09-03 19:31:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:31,460 INFO L225 Difference]: With dead ends: 515 [2019-09-03 19:31:31,460 INFO L226 Difference]: Without dead ends: 322 [2019-09-03 19:31:31,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:31:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-03 19:31:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2019-09-03 19:31:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-03 19:31:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 348 transitions. [2019-09-03 19:31:31,466 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 348 transitions. Word has length 297 [2019-09-03 19:31:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:31,466 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 348 transitions. [2019-09-03 19:31:31,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:31:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 348 transitions. [2019-09-03 19:31:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-03 19:31:31,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:31,468 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:31,469 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash -640064080, now seen corresponding path program 50 times [2019-09-03 19:31:31,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:31,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:31,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:31:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6778 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:31:32,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:32,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:32,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:31:32,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:31:32,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:32,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:31:32,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6778 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:31:32,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:32,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-03 19:31:32,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:31:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:31:32,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:31:32,808 INFO L87 Difference]: Start difference. First operand 300 states and 348 transitions. Second operand 54 states. [2019-09-03 19:31:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:33,328 INFO L93 Difference]: Finished difference Result 522 states and 628 transitions. [2019-09-03 19:31:33,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:31:33,328 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 299 [2019-09-03 19:31:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:33,330 INFO L225 Difference]: With dead ends: 522 [2019-09-03 19:31:33,330 INFO L226 Difference]: Without dead ends: 329 [2019-09-03 19:31:33,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:31:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-03 19:31:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 302. [2019-09-03 19:31:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-03 19:31:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 350 transitions. [2019-09-03 19:31:33,337 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 350 transitions. Word has length 299 [2019-09-03 19:31:33,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:33,337 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 350 transitions. [2019-09-03 19:31:33,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:31:33,337 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 350 transitions. [2019-09-03 19:31:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-03 19:31:33,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:33,339 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:33,339 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:33,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:33,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1107225394, now seen corresponding path program 51 times [2019-09-03 19:31:33,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:33,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:33,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:33,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:33,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6879 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-03 19:31:34,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:34,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:34,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:32:18,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-09-03 19:32:18,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:18,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:32:18,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:18,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6879 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-03 19:32:18,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:18,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 51] total 57 [2019-09-03 19:32:18,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:32:18,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:32:18,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1489, Invalid=1703, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:32:18,919 INFO L87 Difference]: Start difference. First operand 302 states and 350 transitions. Second operand 57 states. [2019-09-03 19:32:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:19,468 INFO L93 Difference]: Finished difference Result 531 states and 639 transitions. [2019-09-03 19:32:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:32:19,469 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 301 [2019-09-03 19:32:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:19,470 INFO L225 Difference]: With dead ends: 531 [2019-09-03 19:32:19,471 INFO L226 Difference]: Without dead ends: 330 [2019-09-03 19:32:19,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1493, Invalid=1813, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:32:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-03 19:32:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-09-03 19:32:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-03 19:32:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 382 transitions. [2019-09-03 19:32:19,478 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 382 transitions. Word has length 301 [2019-09-03 19:32:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:19,478 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 382 transitions. [2019-09-03 19:32:19,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:32:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 382 transitions. [2019-09-03 19:32:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-03 19:32:19,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:19,480 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:19,480 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1631118898, now seen corresponding path program 52 times [2019-09-03 19:32:19,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:19,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:19,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:19,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8164 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:32:20,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:20,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:32:20,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:32:20,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:20,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:32:20,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8164 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:32:20,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:20,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-03 19:32:20,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:32:20,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:32:20,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:32:20,834 INFO L87 Difference]: Start difference. First operand 328 states and 382 transitions. Second operand 56 states. [2019-09-03 19:32:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:21,387 INFO L93 Difference]: Finished difference Result 554 states and 664 transitions. [2019-09-03 19:32:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:32:21,388 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 327 [2019-09-03 19:32:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:21,389 INFO L225 Difference]: With dead ends: 554 [2019-09-03 19:32:21,389 INFO L226 Difference]: Without dead ends: 337 [2019-09-03 19:32:21,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:32:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-03 19:32:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 330. [2019-09-03 19:32:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-03 19:32:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 384 transitions. [2019-09-03 19:32:21,395 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 384 transitions. Word has length 327 [2019-09-03 19:32:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:21,396 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 384 transitions. [2019-09-03 19:32:21,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:32:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 384 transitions. [2019-09-03 19:32:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-03 19:32:21,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:21,398 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:21,398 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:21,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash -956362772, now seen corresponding path program 53 times [2019-09-03 19:32:21,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:21,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:21,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:21,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:32:22,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:22,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:22,580 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:32:45,607 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-03 19:32:45,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:45,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:32:45,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:32:45,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:45,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-03 19:32:45,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:32:45,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:32:45,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:32:45,729 INFO L87 Difference]: Start difference. First operand 330 states and 384 transitions. Second operand 57 states. [2019-09-03 19:32:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:46,320 INFO L93 Difference]: Finished difference Result 561 states and 673 transitions. [2019-09-03 19:32:46,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:32:46,320 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 329 [2019-09-03 19:32:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:46,321 INFO L225 Difference]: With dead ends: 561 [2019-09-03 19:32:46,321 INFO L226 Difference]: Without dead ends: 344 [2019-09-03 19:32:46,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:32:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-03 19:32:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 332. [2019-09-03 19:32:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-03 19:32:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 386 transitions. [2019-09-03 19:32:46,327 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 386 transitions. Word has length 329 [2019-09-03 19:32:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:46,327 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 386 transitions. [2019-09-03 19:32:46,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:32:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 386 transitions. [2019-09-03 19:32:46,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-03 19:32:46,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:46,329 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:46,330 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:46,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:46,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1055787382, now seen corresponding path program 54 times [2019-09-03 19:32:46,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:46,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:46,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:46,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:46,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8376 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:32:47,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:47,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:47,544 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:34:27,184 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-03 19:34:27,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:27,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:34:27,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8376 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:34:27,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:27,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-03 19:34:27,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:34:27,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:34:27,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:34:27,283 INFO L87 Difference]: Start difference. First operand 332 states and 386 transitions. Second operand 58 states. [2019-09-03 19:34:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:27,918 INFO L93 Difference]: Finished difference Result 568 states and 682 transitions. [2019-09-03 19:34:27,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:34:27,918 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 331 [2019-09-03 19:34:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:27,920 INFO L225 Difference]: With dead ends: 568 [2019-09-03 19:34:27,920 INFO L226 Difference]: Without dead ends: 351 [2019-09-03 19:34:27,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:34:27,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-03 19:34:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 334. [2019-09-03 19:34:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-03 19:34:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 388 transitions. [2019-09-03 19:34:27,927 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 388 transitions. Word has length 331 [2019-09-03 19:34:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:27,927 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 388 transitions. [2019-09-03 19:34:27,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:34:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 388 transitions. [2019-09-03 19:34:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-03 19:34:27,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:27,929 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:27,930 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2113557080, now seen corresponding path program 55 times [2019-09-03 19:34:27,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:27,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:27,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8485 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:34:29,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:29,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:29,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:29,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:34:29,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8485 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:34:29,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:29,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-03 19:34:29,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:34:29,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:34:29,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:34:29,442 INFO L87 Difference]: Start difference. First operand 334 states and 388 transitions. Second operand 59 states. [2019-09-03 19:34:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:30,091 INFO L93 Difference]: Finished difference Result 575 states and 691 transitions. [2019-09-03 19:34:30,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 19:34:30,092 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 333 [2019-09-03 19:34:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:30,093 INFO L225 Difference]: With dead ends: 575 [2019-09-03 19:34:30,093 INFO L226 Difference]: Without dead ends: 358 [2019-09-03 19:34:30,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:34:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-03 19:34:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 336. [2019-09-03 19:34:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-03 19:34:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 390 transitions. [2019-09-03 19:34:30,101 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 390 transitions. Word has length 333 [2019-09-03 19:34:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:30,102 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 390 transitions. [2019-09-03 19:34:30,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:34:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 390 transitions. [2019-09-03 19:34:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-03 19:34:30,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:30,104 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:30,104 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash -722987706, now seen corresponding path program 56 times [2019-09-03 19:34:30,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:30,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:30,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8596 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:34:31,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:31,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:31,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:34:31,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:31,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:31,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 19:34:31,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8596 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:34:31,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:31,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-03 19:34:31,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:34:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:34:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:34:31,567 INFO L87 Difference]: Start difference. First operand 336 states and 390 transitions. Second operand 60 states. [2019-09-03 19:34:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:32,183 INFO L93 Difference]: Finished difference Result 582 states and 700 transitions. [2019-09-03 19:34:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:34:32,183 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 335 [2019-09-03 19:34:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:32,185 INFO L225 Difference]: With dead ends: 582 [2019-09-03 19:34:32,186 INFO L226 Difference]: Without dead ends: 365 [2019-09-03 19:34:32,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:34:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-03 19:34:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2019-09-03 19:34:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-03 19:34:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 392 transitions. [2019-09-03 19:34:32,192 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 392 transitions. Word has length 335 [2019-09-03 19:34:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:32,193 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 392 transitions. [2019-09-03 19:34:32,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:34:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 392 transitions. [2019-09-03 19:34:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-03 19:34:32,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:32,195 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:32,195 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash -120648348, now seen corresponding path program 57 times [2019-09-03 19:34:32,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:32,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:32,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:32,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:32,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8709 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-03 19:34:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:33,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:33,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:35:43,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-03 19:35:43,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:35:43,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 19:35:43,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:35:43,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:35:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8709 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-03 19:35:43,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:35:43,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 57] total 63 [2019-09-03 19:35:43,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:35:43,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:35:43,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:35:43,771 INFO L87 Difference]: Start difference. First operand 338 states and 392 transitions. Second operand 63 states. [2019-09-03 19:35:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:35:44,398 INFO L93 Difference]: Finished difference Result 591 states and 711 transitions. [2019-09-03 19:35:44,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:35:44,399 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 337 [2019-09-03 19:35:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:35:44,400 INFO L225 Difference]: With dead ends: 591 [2019-09-03 19:35:44,400 INFO L226 Difference]: Without dead ends: 366 [2019-09-03 19:35:44,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1838, Invalid=2194, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:35:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-03 19:35:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2019-09-03 19:35:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-03 19:35:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 424 transitions. [2019-09-03 19:35:44,406 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 424 transitions. Word has length 337 [2019-09-03 19:35:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:35:44,407 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 424 transitions. [2019-09-03 19:35:44,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:35:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 424 transitions. [2019-09-03 19:35:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-09-03 19:35:44,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:35:44,409 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:35:44,409 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:35:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:35:44,410 INFO L82 PathProgramCache]: Analyzing trace with hash -566216348, now seen corresponding path program 58 times [2019-09-03 19:35:44,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:35:44,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:35:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:44,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:35:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:35:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10150 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:35:45,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:35:45,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:35:45,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:35:45,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:35:45,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:35:45,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:35:45,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:35:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10150 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:35:46,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:35:46,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-09-03 19:35:46,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:35:46,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:35:46,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:35:46,021 INFO L87 Difference]: Start difference. First operand 364 states and 424 transitions. Second operand 62 states. [2019-09-03 19:35:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:35:46,640 INFO L93 Difference]: Finished difference Result 614 states and 736 transitions. [2019-09-03 19:35:46,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 19:35:46,640 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 363 [2019-09-03 19:35:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:35:46,642 INFO L225 Difference]: With dead ends: 614 [2019-09-03 19:35:46,642 INFO L226 Difference]: Without dead ends: 373 [2019-09-03 19:35:46,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:35:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-03 19:35:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 366. [2019-09-03 19:35:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-03 19:35:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 426 transitions. [2019-09-03 19:35:46,648 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 426 transitions. Word has length 363 [2019-09-03 19:35:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:35:46,648 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 426 transitions. [2019-09-03 19:35:46,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:35:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 426 transitions. [2019-09-03 19:35:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-03 19:35:46,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:35:46,651 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:35:46,651 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:35:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:35:46,651 INFO L82 PathProgramCache]: Analyzing trace with hash 165673090, now seen corresponding path program 59 times [2019-09-03 19:35:46,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:35:46,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:35:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:46,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:35:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:35:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10267 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:35:48,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:35:48,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:35:48,094 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:10,369 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-03 19:36:10,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:10,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 19:36:10,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10267 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:36:10,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:10,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-09-03 19:36:10,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:36:10,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:36:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:36:10,474 INFO L87 Difference]: Start difference. First operand 366 states and 426 transitions. Second operand 63 states. [2019-09-03 19:36:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:11,114 INFO L93 Difference]: Finished difference Result 621 states and 745 transitions. [2019-09-03 19:36:11,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:36:11,114 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 365 [2019-09-03 19:36:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:11,115 INFO L225 Difference]: With dead ends: 621 [2019-09-03 19:36:11,115 INFO L226 Difference]: Without dead ends: 380 [2019-09-03 19:36:11,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:36:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-03 19:36:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 368. [2019-09-03 19:36:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-03 19:36:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 428 transitions. [2019-09-03 19:36:11,120 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 428 transitions. Word has length 365 [2019-09-03 19:36:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:11,120 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 428 transitions. [2019-09-03 19:36:11,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:36:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 428 transitions. [2019-09-03 19:36:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-03 19:36:11,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:11,122 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:11,122 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:11,123 INFO L82 PathProgramCache]: Analyzing trace with hash -863213536, now seen corresponding path program 60 times [2019-09-03 19:36:11,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:11,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:11,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10386 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:36:12,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:12,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:12,563 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:40:20,795 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-03 19:40:20,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:20,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:40:20,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10386 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:40:20,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:20,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-09-03 19:40:20,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:40:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:40:20,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:40:20,974 INFO L87 Difference]: Start difference. First operand 368 states and 428 transitions. Second operand 64 states. [2019-09-03 19:40:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:21,770 INFO L93 Difference]: Finished difference Result 628 states and 754 transitions. [2019-09-03 19:40:21,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:40:21,770 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 367 [2019-09-03 19:40:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:21,772 INFO L225 Difference]: With dead ends: 628 [2019-09-03 19:40:21,772 INFO L226 Difference]: Without dead ends: 387 [2019-09-03 19:40:21,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:40:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-03 19:40:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 370. [2019-09-03 19:40:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-03 19:40:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 430 transitions. [2019-09-03 19:40:21,777 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 430 transitions. Word has length 367 [2019-09-03 19:40:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:21,778 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 430 transitions. [2019-09-03 19:40:21,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:40:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 430 transitions. [2019-09-03 19:40:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-03 19:40:21,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:21,780 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:21,780 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1780783042, now seen corresponding path program 61 times [2019-09-03 19:40:21,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:21,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:21,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:40:23,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:23,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:23,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:40:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:23,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 19:40:23,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:40:23,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:23,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-09-03 19:40:23,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:40:23,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:40:23,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:40:23,491 INFO L87 Difference]: Start difference. First operand 370 states and 430 transitions. Second operand 65 states. [2019-09-03 19:40:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:24,243 INFO L93 Difference]: Finished difference Result 635 states and 763 transitions. [2019-09-03 19:40:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:40:24,244 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 369 [2019-09-03 19:40:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:24,245 INFO L225 Difference]: With dead ends: 635 [2019-09-03 19:40:24,245 INFO L226 Difference]: Without dead ends: 394 [2019-09-03 19:40:24,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:40:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-03 19:40:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 372. [2019-09-03 19:40:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-03 19:40:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 432 transitions. [2019-09-03 19:40:24,251 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 432 transitions. Word has length 369 [2019-09-03 19:40:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:24,252 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 432 transitions. [2019-09-03 19:40:24,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:40:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 432 transitions. [2019-09-03 19:40:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-03 19:40:24,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:24,254 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:24,254 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:24,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1198184668, now seen corresponding path program 62 times [2019-09-03 19:40:24,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:24,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:24,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:40:24,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10630 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:40:25,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:25,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:25,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:40:25,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:40:25,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:25,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:40:25,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10630 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:40:25,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:25,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-09-03 19:40:25,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:40:25,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:40:25,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:40:25,942 INFO L87 Difference]: Start difference. First operand 372 states and 432 transitions. Second operand 66 states. [2019-09-03 19:40:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:26,757 INFO L93 Difference]: Finished difference Result 642 states and 772 transitions. [2019-09-03 19:40:26,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:40:26,757 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 371 [2019-09-03 19:40:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:26,759 INFO L225 Difference]: With dead ends: 642 [2019-09-03 19:40:26,759 INFO L226 Difference]: Without dead ends: 401 [2019-09-03 19:40:26,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:40:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-09-03 19:40:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 374. [2019-09-03 19:40:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-03 19:40:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 434 transitions. [2019-09-03 19:40:26,765 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 434 transitions. Word has length 371 [2019-09-03 19:40:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:26,765 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 434 transitions. [2019-09-03 19:40:26,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:40:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 434 transitions. [2019-09-03 19:40:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-03 19:40:26,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:26,767 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:26,767 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:26,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash -757032454, now seen corresponding path program 63 times [2019-09-03 19:40:26,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:26,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:26,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10755 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-03 19:40:28,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:28,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:28,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2