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-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:19:15,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:19:15,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:19:15,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:19:15,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:19:15,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:19:15,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:19:15,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:19:15,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:19:15,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:19:15,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:19:15,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:19:15,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:19:15,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:19:15,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:19:15,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:19:15,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:19:15,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:19:15,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:19:15,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:19:15,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:19:15,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:19:15,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:19:15,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:19:15,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:19:15,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:19:15,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:19:15,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:19:15,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:19:15,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:19:15,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:19:15,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:19:15,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:19:15,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:19:15,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:19:15,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:19:15,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:19:15,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:19:15,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:19:15,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:19:15,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:19:15,532 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-10-02 11:19:15,546 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:19:15,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:19:15,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:19:15,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:19:15,548 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:19:15,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:19:15,549 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:19:15,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:19:15,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:19:15,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:19:15,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:19:15,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:19:15,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:19:15,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:19:15,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:19:15,551 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:19:15,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:19:15,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:19:15,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:19:15,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:19:15,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:19:15,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:19:15,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:19:15,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:19:15,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:19:15,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:19:15,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:19:15,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:19:15,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:19:15,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:19:15,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:19:15,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:19:15,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:19:15,622 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:19:15,622 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2019-10-02 11:19:15,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676cae285/0486f485a0744c4ca479db82c9eb2d6e/FLAG8268a36d2 [2019-10-02 11:19:16,198 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:19:16,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2019-10-02 11:19:16,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676cae285/0486f485a0744c4ca479db82c9eb2d6e/FLAG8268a36d2 [2019-10-02 11:19:16,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676cae285/0486f485a0744c4ca479db82c9eb2d6e [2019-10-02 11:19:16,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:19:16,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:19:16,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:19:16,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:19:16,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:19:16,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:19:16" (1/1) ... [2019-10-02 11:19:16,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37bb7e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16, skipping insertion in model container [2019-10-02 11:19:16,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:19:16" (1/1) ... [2019-10-02 11:19:16,642 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:19:16,662 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:19:16,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:19:16,830 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:19:16,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:19:16,856 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:19:16,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16 WrapperNode [2019-10-02 11:19:16,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:19:16,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:19:16,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:19:16,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:19:16,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16" (1/1) ... [2019-10-02 11:19:16,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16" (1/1) ... [2019-10-02 11:19:16,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16" (1/1) ... [2019-10-02 11:19:16,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16" (1/1) ... [2019-10-02 11:19:16,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16" (1/1) ... [2019-10-02 11:19:16,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16" (1/1) ... [2019-10-02 11:19:16,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16" (1/1) ... [2019-10-02 11:19:16,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:19:16,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:19:16,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:19:16,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:19:16,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16" (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-10-02 11:19:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:19:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:19:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:19:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:19:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:19:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:19:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:19:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:19:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:19:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:19:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:19:17,211 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:19:17,212 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:19:17,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:19:17 BoogieIcfgContainer [2019-10-02 11:19:17,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:19:17,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:19:17,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:19:17,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:19:17,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:19:16" (1/3) ... [2019-10-02 11:19:17,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373167d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:19:17, skipping insertion in model container [2019-10-02 11:19:17,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:19:16" (2/3) ... [2019-10-02 11:19:17,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373167d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:19:17, skipping insertion in model container [2019-10-02 11:19:17,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:19:17" (3/3) ... [2019-10-02 11:19:17,221 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.i [2019-10-02 11:19:17,232 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:19:17,240 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:19:17,257 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:19:17,285 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:19:17,286 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:19:17,286 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:19:17,286 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:19:17,286 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:19:17,286 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:19:17,286 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:19:17,286 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:19:17,287 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:19:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-02 11:19:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:19:17,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:17,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:17,309 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:17,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1001202113, now seen corresponding path program 1 times [2019-10-02 11:19:17,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:17,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:17,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:17,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:17,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:17,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:17,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:19:17,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:19:17,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:19:17,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:19:17,438 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-10-02 11:19:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:17,458 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-10-02 11:19:17,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:19:17,459 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-02 11:19:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:17,465 INFO L225 Difference]: With dead ends: 32 [2019-10-02 11:19:17,466 INFO L226 Difference]: Without dead ends: 13 [2019-10-02 11:19:17,469 INFO L640 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-10-02 11:19:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-02 11:19:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-02 11:19:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-02 11:19:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-02 11:19:17,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-10-02 11:19:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:17,509 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-02 11:19:17,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:19:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-02 11:19:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 11:19:17,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:17,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:17,511 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash 563077882, now seen corresponding path program 1 times [2019-10-02 11:19:17,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:17,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:17,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:17,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:17,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:17,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:17,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:19:17,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:19:17,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:19:17,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:19:17,585 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-10-02 11:19:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:17,722 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-10-02 11:19:17,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:19:17,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-02 11:19:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:17,725 INFO L225 Difference]: With dead ends: 22 [2019-10-02 11:19:17,725 INFO L226 Difference]: Without dead ends: 17 [2019-10-02 11:19:17,726 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:19:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-02 11:19:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-02 11:19:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-02 11:19:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-02 11:19:17,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-02 11:19:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:17,734 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-02 11:19:17,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:19:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-02 11:19:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 11:19:17,735 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:17,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:17,735 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:17,736 INFO L82 PathProgramCache]: Analyzing trace with hash 620336184, now seen corresponding path program 1 times [2019-10-02 11:19:17,736 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:17,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:17,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:17,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:17,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:19:17,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:19:17,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:19:17,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:19:17,768 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-02 11:19:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:17,783 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-10-02 11:19:17,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:19:17,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-02 11:19:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:17,785 INFO L225 Difference]: With dead ends: 32 [2019-10-02 11:19:17,785 INFO L226 Difference]: Without dead ends: 20 [2019-10-02 11:19:17,786 INFO L640 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-10-02 11:19:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-02 11:19:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-02 11:19:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-02 11:19:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-02 11:19:17,791 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-10-02 11:19:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:17,792 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-02 11:19:17,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:19:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-02 11:19:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:19:17,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:17,793 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:17,794 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:17,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash -657196198, now seen corresponding path program 1 times [2019-10-02 11:19:17,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:17,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:17,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:19:17,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:17,846 INFO L224 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) [2019-10-02 11:19:17,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:17,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:19:17,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:19:17,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:17,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-02 11:19:17,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:19:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:19:17,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:19:17,947 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-10-02 11:19:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:17,977 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-10-02 11:19:17,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:19:17,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-02 11:19:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:17,979 INFO L225 Difference]: With dead ends: 35 [2019-10-02 11:19:17,979 INFO L226 Difference]: Without dead ends: 23 [2019-10-02 11:19:17,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:19:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-02 11:19:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-02 11:19:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-02 11:19:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-02 11:19:17,986 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2019-10-02 11:19:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:17,987 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-02 11:19:17,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:19:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-02 11:19:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:19:17,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:17,988 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:17,988 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1550672957, now seen corresponding path program 2 times [2019-10-02 11:19:17,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:17,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:17,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:17,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:17,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 11:19:18,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:18,076 INFO L224 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-10-02 11:19:18,098 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-10-02 11:19:18,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:19:18,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:18,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:19:18,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:19:18,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:18,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 11:19:18,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:19:18,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:19:18,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:19:18,172 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 9 states. [2019-10-02 11:19:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:18,410 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2019-10-02 11:19:18,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:19:18,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-02 11:19:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:18,416 INFO L225 Difference]: With dead ends: 54 [2019-10-02 11:19:18,416 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 11:19:18,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:19:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 11:19:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-10-02 11:19:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 11:19:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-02 11:19:18,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2019-10-02 11:19:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:18,437 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-02 11:19:18,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:19:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-02 11:19:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:19:18,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:18,439 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:18,439 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash -497587749, now seen corresponding path program 3 times [2019-10-02 11:19:18,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:18,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:18,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:18,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:18,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:19:18,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:18,568 INFO L224 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-10-02 11:19:18,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:19:18,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 11:19:18,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:18,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:19:18,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 11:19:18,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:18,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-02 11:19:18,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:19:18,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:19:18,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:19:18,696 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 11 states. [2019-10-02 11:19:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:18,912 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2019-10-02 11:19:18,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:19:18,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-10-02 11:19:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:18,916 INFO L225 Difference]: With dead ends: 81 [2019-10-02 11:19:18,917 INFO L226 Difference]: Without dead ends: 76 [2019-10-02 11:19:18,917 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:19:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-02 11:19:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 43. [2019-10-02 11:19:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 11:19:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-10-02 11:19:18,928 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2019-10-02 11:19:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:18,928 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-10-02 11:19:18,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:19:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-10-02 11:19:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 11:19:18,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:18,930 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:18,931 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396762, now seen corresponding path program 4 times [2019-10-02 11:19:18,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:18,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:18,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:18,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:18,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 81 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:19,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:19,162 INFO L224 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) [2019-10-02 11:19:19,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:19,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:19:19,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:19,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:19:19,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 80 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 11:19:19,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:19,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 20 [2019-10-02 11:19:19,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:19:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:19:19,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:19:19,295 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 20 states. [2019-10-02 11:19:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:19,445 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-10-02 11:19:19,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:19:19,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-10-02 11:19:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:19,447 INFO L225 Difference]: With dead ends: 77 [2019-10-02 11:19:19,447 INFO L226 Difference]: Without dead ends: 47 [2019-10-02 11:19:19,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:19:19,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-02 11:19:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-02 11:19:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 11:19:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-10-02 11:19:19,459 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 42 [2019-10-02 11:19:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:19,460 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-10-02 11:19:19,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:19:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-10-02 11:19:19,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:19:19,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:19,462 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:19,462 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:19,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash -778605187, now seen corresponding path program 5 times [2019-10-02 11:19:19,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:19,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:19,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:19,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:19,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 84 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:19,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:19,720 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:19,742 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:19:19,771 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-02 11:19:19,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:19,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:19:19,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 102 proven. 26 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 11:19:19,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2019-10-02 11:19:19,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 11:19:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 11:19:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:19:19,863 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 23 states. [2019-10-02 11:19:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:20,109 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2019-10-02 11:19:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:19:20,110 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-10-02 11:19:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:20,110 INFO L225 Difference]: With dead ends: 80 [2019-10-02 11:19:20,111 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 11:19:20,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2019-10-02 11:19:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 11:19:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-02 11:19:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 11:19:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-10-02 11:19:20,119 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 45 [2019-10-02 11:19:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:20,119 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-10-02 11:19:20,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 11:19:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-10-02 11:19:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 11:19:20,121 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:20,121 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:20,121 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:20,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1253478074, now seen corresponding path program 6 times [2019-10-02 11:19:20,122 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:20,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:20,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:20,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:20,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 87 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:20,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:20,389 INFO L224 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-10-02 11:19:20,407 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:19:20,442 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-02 11:19:20,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:20,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:19:20,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 124 proven. 40 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 11:19:20,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:20,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2019-10-02 11:19:20,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 11:19:20,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 11:19:20,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:19:20,558 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 26 states. [2019-10-02 11:19:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:20,791 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-10-02 11:19:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:19:20,793 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-10-02 11:19:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:20,794 INFO L225 Difference]: With dead ends: 83 [2019-10-02 11:19:20,794 INFO L226 Difference]: Without dead ends: 53 [2019-10-02 11:19:20,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1008, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 11:19:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-02 11:19:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-10-02 11:19:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-02 11:19:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-10-02 11:19:20,802 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 48 [2019-10-02 11:19:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:20,803 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-10-02 11:19:20,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 11:19:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-10-02 11:19:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:19:20,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:20,804 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:20,805 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1481869405, now seen corresponding path program 7 times [2019-10-02 11:19:20,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:20,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:20,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:20,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:20,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 90 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:21,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:21,064 INFO L224 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-10-02 11:19:21,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:21,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:19:21,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 57 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 11:19:21,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:21,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 29 [2019-10-02 11:19:21,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 11:19:21,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 11:19:21,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2019-10-02 11:19:21,281 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 29 states. [2019-10-02 11:19:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:21,521 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-10-02 11:19:21,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:19:21,521 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-10-02 11:19:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:21,522 INFO L225 Difference]: With dead ends: 86 [2019-10-02 11:19:21,523 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 11:19:21,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=425, Invalid=1297, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 11:19:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 11:19:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-02 11:19:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 11:19:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-02 11:19:21,531 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 51 [2019-10-02 11:19:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:21,531 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-02 11:19:21,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 11:19:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-02 11:19:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:19:21,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:21,533 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:21,533 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:21,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:21,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2035152934, now seen corresponding path program 8 times [2019-10-02 11:19:21,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:21,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:21,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:21,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:21,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 168 proven. 77 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 11:19:21,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:21,606 INFO L224 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:21,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:19:21,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:19:21,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:21,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:19:21,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 168 proven. 77 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 11:19:21,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:21,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-10-02 11:19:21,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:19:21,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:19:21,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:19:21,683 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 10 states. [2019-10-02 11:19:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:21,725 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2019-10-02 11:19:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:19:21,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-02 11:19:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:21,728 INFO L225 Difference]: With dead ends: 89 [2019-10-02 11:19:21,728 INFO L226 Difference]: Without dead ends: 59 [2019-10-02 11:19:21,729 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:19:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-02 11:19:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-10-02 11:19:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-02 11:19:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-10-02 11:19:21,737 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 54 [2019-10-02 11:19:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:21,737 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-10-02 11:19:21,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:19:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-10-02 11:19:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 11:19:21,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:21,738 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:21,739 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:21,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:21,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1920468163, now seen corresponding path program 9 times [2019-10-02 11:19:21,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:21,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:21,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:21,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:21,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 11:19:21,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:21,873 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:21,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:19:21,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-02 11:19:21,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:21,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 11:19:21,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 190 proven. 100 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 11:19:22,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:22,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-10-02 11:19:22,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:19:22,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:19:22,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:19:22,055 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 21 states. [2019-10-02 11:19:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:22,465 INFO L93 Difference]: Finished difference Result 174 states and 221 transitions. [2019-10-02 11:19:22,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 11:19:22,466 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-10-02 11:19:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:22,467 INFO L225 Difference]: With dead ends: 174 [2019-10-02 11:19:22,467 INFO L226 Difference]: Without dead ends: 144 [2019-10-02 11:19:22,468 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=398, Invalid=1242, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 11:19:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-02 11:19:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 76. [2019-10-02 11:19:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-02 11:19:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2019-10-02 11:19:22,479 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 57 [2019-10-02 11:19:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:22,479 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2019-10-02 11:19:22,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:19:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2019-10-02 11:19:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 11:19:22,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:22,481 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:22,481 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:22,482 INFO L82 PathProgramCache]: Analyzing trace with hash -588505765, now seen corresponding path program 10 times [2019-10-02 11:19:22,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:22,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:22,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 11:19:22,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:22,644 INFO L224 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-10-02 11:19:22,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:19:22,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:19:22,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:22,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 11:19:22,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 241 proven. 126 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:19:22,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:22,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-10-02 11:19:22,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 11:19:22,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 11:19:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:19:22,868 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 23 states. [2019-10-02 11:19:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:23,337 INFO L93 Difference]: Finished difference Result 220 states and 282 transitions. [2019-10-02 11:19:23,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 11:19:23,338 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2019-10-02 11:19:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:23,339 INFO L225 Difference]: With dead ends: 220 [2019-10-02 11:19:23,339 INFO L226 Difference]: Without dead ends: 175 [2019-10-02 11:19:23,341 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=476, Invalid=1504, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 11:19:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-02 11:19:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 82. [2019-10-02 11:19:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-02 11:19:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-10-02 11:19:23,350 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 63 [2019-10-02 11:19:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:23,350 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-10-02 11:19:23,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 11:19:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2019-10-02 11:19:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 11:19:23,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:23,352 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:23,352 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:23,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:23,353 INFO L82 PathProgramCache]: Analyzing trace with hash -346376131, now seen corresponding path program 11 times [2019-10-02 11:19:23,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:23,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:23,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:23,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 415 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-02 11:19:23,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:23,497 INFO L224 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-10-02 11:19:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:19:23,561 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-10-02 11:19:23,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:23,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:19:23,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 298 proven. 155 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-02 11:19:23,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:23,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-10-02 11:19:23,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 11:19:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 11:19:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:19:23,700 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 25 states. [2019-10-02 11:19:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:24,218 INFO L93 Difference]: Finished difference Result 242 states and 311 transitions. [2019-10-02 11:19:24,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 11:19:24,224 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2019-10-02 11:19:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:24,225 INFO L225 Difference]: With dead ends: 242 [2019-10-02 11:19:24,225 INFO L226 Difference]: Without dead ends: 194 [2019-10-02 11:19:24,227 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=1791, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 11:19:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-02 11:19:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 88. [2019-10-02 11:19:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-02 11:19:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-10-02 11:19:24,235 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 69 [2019-10-02 11:19:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:24,236 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-10-02 11:19:24,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 11:19:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-10-02 11:19:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 11:19:24,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:24,237 INFO L411 BasicCegarLoop]: trace histogram [22, 21, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:24,237 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:24,238 INFO L82 PathProgramCache]: Analyzing trace with hash 2024448987, now seen corresponding path program 12 times [2019-10-02 11:19:24,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:24,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:24,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:24,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:24,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 11:19:24,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:24,387 INFO L224 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:24,412 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:19:24,450 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-10-02 11:19:24,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:24,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:19:24,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 361 proven. 187 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-02 11:19:24,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:24,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2019-10-02 11:19:24,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 11:19:24,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 11:19:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:19:24,629 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 27 states. [2019-10-02 11:19:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:25,260 INFO L93 Difference]: Finished difference Result 264 states and 340 transitions. [2019-10-02 11:19:25,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 11:19:25,261 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 75 [2019-10-02 11:19:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:25,262 INFO L225 Difference]: With dead ends: 264 [2019-10-02 11:19:25,262 INFO L226 Difference]: Without dead ends: 213 [2019-10-02 11:19:25,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=653, Invalid=2103, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:19:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-02 11:19:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 94. [2019-10-02 11:19:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-02 11:19:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2019-10-02 11:19:25,272 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 75 [2019-10-02 11:19:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:25,272 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2019-10-02 11:19:25,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 11:19:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2019-10-02 11:19:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-02 11:19:25,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:25,274 INFO L411 BasicCegarLoop]: trace histogram [24, 23, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:25,274 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash 275670333, now seen corresponding path program 13 times [2019-10-02 11:19:25,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:25,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:25,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 606 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-02 11:19:25,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:25,466 INFO L224 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-10-02 11:19:25,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:25,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:19:25,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 430 proven. 222 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-02 11:19:25,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:25,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-10-02 11:19:25,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 11:19:25,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 11:19:25,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-10-02 11:19:25,705 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 29 states. [2019-10-02 11:19:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:26,351 INFO L93 Difference]: Finished difference Result 286 states and 369 transitions. [2019-10-02 11:19:26,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 11:19:26,351 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2019-10-02 11:19:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:26,353 INFO L225 Difference]: With dead ends: 286 [2019-10-02 11:19:26,354 INFO L226 Difference]: Without dead ends: 232 [2019-10-02 11:19:26,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=752, Invalid=2440, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 11:19:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-02 11:19:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 100. [2019-10-02 11:19:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-02 11:19:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2019-10-02 11:19:26,368 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 81 [2019-10-02 11:19:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:26,368 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2019-10-02 11:19:26,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 11:19:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2019-10-02 11:19:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 11:19:26,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:26,369 INFO L411 BasicCegarLoop]: trace histogram [26, 25, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:26,370 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:26,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:26,370 INFO L82 PathProgramCache]: Analyzing trace with hash 910752347, now seen corresponding path program 14 times [2019-10-02 11:19:26,370 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:26,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:26,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:26,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:26,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-02 11:19:26,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:26,560 INFO L224 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:26,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:19:26,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:19:26,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:26,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:19:26,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 505 proven. 260 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-02 11:19:26,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:26,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-10-02 11:19:26,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 11:19:26,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 11:19:26,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-10-02 11:19:26,862 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand 31 states. [2019-10-02 11:19:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:27,644 INFO L93 Difference]: Finished difference Result 308 states and 398 transitions. [2019-10-02 11:19:27,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-02 11:19:27,644 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 87 [2019-10-02 11:19:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:27,646 INFO L225 Difference]: With dead ends: 308 [2019-10-02 11:19:27,646 INFO L226 Difference]: Without dead ends: 251 [2019-10-02 11:19:27,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=858, Invalid=2802, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 11:19:27,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-02 11:19:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 106. [2019-10-02 11:19:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-02 11:19:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-10-02 11:19:27,658 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 87 [2019-10-02 11:19:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:27,658 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-10-02 11:19:27,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 11:19:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2019-10-02 11:19:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 11:19:27,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:27,660 INFO L411 BasicCegarLoop]: trace histogram [28, 27, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:27,660 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 96928317, now seen corresponding path program 15 times [2019-10-02 11:19:27,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:27,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:27,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 833 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-02 11:19:27,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:27,886 INFO L224 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:27,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:19:27,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-10-02 11:19:27,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:27,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 11:19:27,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 561 proven. 534 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 11:19:28,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:28,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-10-02 11:19:28,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 11:19:28,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 11:19:28,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 11:19:28,433 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 33 states. [2019-10-02 11:19:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:29,285 INFO L93 Difference]: Finished difference Result 435 states and 577 transitions. [2019-10-02 11:19:29,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-02 11:19:29,287 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 93 [2019-10-02 11:19:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:29,289 INFO L225 Difference]: With dead ends: 435 [2019-10-02 11:19:29,290 INFO L226 Difference]: Without dead ends: 430 [2019-10-02 11:19:29,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1235, Invalid=2797, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 11:19:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-02 11:19:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 142. [2019-10-02 11:19:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-02 11:19:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2019-10-02 11:19:29,302 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 93 [2019-10-02 11:19:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:29,305 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2019-10-02 11:19:29,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 11:19:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2019-10-02 11:19:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 11:19:29,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:29,307 INFO L411 BasicCegarLoop]: trace histogram [44, 43, 30, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:29,307 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1146565437, now seen corresponding path program 16 times [2019-10-02 11:19:29,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:29,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:29,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:29,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:29,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1291 proven. 1547 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:30,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:30,682 INFO L224 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-10-02 11:19:30,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:19:30,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:19:30,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:30,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-02 11:19:30,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 170 proven. 2667 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:19:32,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:32,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 45] total 103 [2019-10-02 11:19:32,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-10-02 11:19:32,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-10-02 11:19:32,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1918, Invalid=8588, Unknown=0, NotChecked=0, Total=10506 [2019-10-02 11:19:32,534 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand 103 states. [2019-10-02 11:19:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:33,504 INFO L93 Difference]: Finished difference Result 326 states and 415 transitions. [2019-10-02 11:19:33,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 11:19:33,505 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 141 [2019-10-02 11:19:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:33,507 INFO L225 Difference]: With dead ends: 326 [2019-10-02 11:19:33,507 INFO L226 Difference]: Without dead ends: 230 [2019-10-02 11:19:33,512 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4438 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3868, Invalid=13424, Unknown=0, NotChecked=0, Total=17292 [2019-10-02 11:19:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-02 11:19:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-10-02 11:19:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-02 11:19:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 259 transitions. [2019-10-02 11:19:33,525 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 259 transitions. Word has length 141 [2019-10-02 11:19:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:33,526 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 259 transitions. [2019-10-02 11:19:33,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-10-02 11:19:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 259 transitions. [2019-10-02 11:19:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 11:19:33,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:33,529 INFO L411 BasicCegarLoop]: trace histogram [73, 72, 43, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:33,529 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1877929926, now seen corresponding path program 17 times [2019-10-02 11:19:33,530 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:33,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:33,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:33,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:33,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 0 proven. 5089 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2019-10-02 11:19:34,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:34,138 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:34,176 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:19:34,346 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2019-10-02 11:19:34,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:34,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-02 11:19:34,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 3842 proven. 2795 refuted. 0 times theorem prover too weak. 1247 trivial. 0 not checked. [2019-10-02 11:19:35,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:35,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 46] total 78 [2019-10-02 11:19:35,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-02 11:19:35,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-02 11:19:35,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1535, Invalid=4471, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 11:19:35,651 INFO L87 Difference]: Start difference. First operand 229 states and 259 transitions. Second operand 78 states. [2019-10-02 11:19:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:39,344 INFO L93 Difference]: Finished difference Result 1115 states and 1448 transitions. [2019-10-02 11:19:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-10-02 11:19:39,345 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 228 [2019-10-02 11:19:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:39,350 INFO L225 Difference]: With dead ends: 1115 [2019-10-02 11:19:39,351 INFO L226 Difference]: Without dead ends: 1019 [2019-10-02 11:19:39,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6257 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6773, Invalid=21283, Unknown=0, NotChecked=0, Total=28056 [2019-10-02 11:19:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-10-02 11:19:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 280. [2019-10-02 11:19:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-02 11:19:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 326 transitions. [2019-10-02 11:19:39,381 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 326 transitions. Word has length 228 [2019-10-02 11:19:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:39,381 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 326 transitions. [2019-10-02 11:19:39,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-02 11:19:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 326 transitions. [2019-10-02 11:19:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 11:19:39,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:39,385 INFO L411 BasicCegarLoop]: trace histogram [75, 74, 44, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:39,385 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash 387565848, now seen corresponding path program 18 times [2019-10-02 11:19:39,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:39,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:39,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:39,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 0 proven. 5399 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-10-02 11:19:40,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:40,204 INFO L224 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-10-02 11:19:40,251 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:19:40,417 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-10-02 11:19:40,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:40,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-02 11:19:40,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 4064 proven. 2926 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2019-10-02 11:19:41,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:41,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 47] total 80 [2019-10-02 11:19:41,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-02 11:19:41,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-02 11:19:41,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1613, Invalid=4707, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 11:19:41,780 INFO L87 Difference]: Start difference. First operand 280 states and 326 transitions. Second operand 80 states. [2019-10-02 11:19:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:45,565 INFO L93 Difference]: Finished difference Result 1260 states and 1641 transitions. [2019-10-02 11:19:45,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-10-02 11:19:45,566 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 234 [2019-10-02 11:19:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:45,571 INFO L225 Difference]: With dead ends: 1260 [2019-10-02 11:19:45,572 INFO L226 Difference]: Without dead ends: 1116 [2019-10-02 11:19:45,575 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6557 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7083, Invalid=22329, Unknown=0, NotChecked=0, Total=29412 [2019-10-02 11:19:45,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-10-02 11:19:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 286. [2019-10-02 11:19:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-02 11:19:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 333 transitions. [2019-10-02 11:19:45,603 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 333 transitions. Word has length 234 [2019-10-02 11:19:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:45,603 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 333 transitions. [2019-10-02 11:19:45,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-02 11:19:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 333 transitions. [2019-10-02 11:19:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 11:19:45,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:45,607 INFO L411 BasicCegarLoop]: trace histogram [77, 76, 45, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:45,607 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:45,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1058539962, now seen corresponding path program 19 times [2019-10-02 11:19:45,607 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:45,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:45,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 5718 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2019-10-02 11:19:46,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:46,347 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:46,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:46,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-02 11:19:46,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 4292 proven. 3060 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2019-10-02 11:19:47,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:47,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 48] total 82 [2019-10-02 11:19:47,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-02 11:19:47,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-02 11:19:47,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1693, Invalid=4949, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 11:19:47,905 INFO L87 Difference]: Start difference. First operand 286 states and 333 transitions. Second operand 82 states. [2019-10-02 11:19:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:51,874 INFO L93 Difference]: Finished difference Result 1315 states and 1714 transitions. [2019-10-02 11:19:51,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-10-02 11:19:51,876 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 240 [2019-10-02 11:19:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:51,882 INFO L225 Difference]: With dead ends: 1315 [2019-10-02 11:19:51,882 INFO L226 Difference]: Without dead ends: 1168 [2019-10-02 11:19:51,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6864 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7400, Invalid=23400, Unknown=0, NotChecked=0, Total=30800 [2019-10-02 11:19:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2019-10-02 11:19:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 292. [2019-10-02 11:19:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-02 11:19:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 340 transitions. [2019-10-02 11:19:51,913 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 340 transitions. Word has length 240 [2019-10-02 11:19:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:51,914 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 340 transitions. [2019-10-02 11:19:51,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-02 11:19:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 340 transitions. [2019-10-02 11:19:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 11:19:51,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:51,917 INFO L411 BasicCegarLoop]: trace histogram [79, 78, 46, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:51,917 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2101031912, now seen corresponding path program 20 times [2019-10-02 11:19:51,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:51,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:51,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:51,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:51,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9243 backedges. 0 proven. 6046 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-10-02 11:19:52,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:52,581 INFO L224 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-10-02 11:19:52,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:19:52,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:19:52,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:52,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-02 11:19:52,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9243 backedges. 4526 proven. 3197 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-10-02 11:19:54,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:54,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 49] total 84 [2019-10-02 11:19:54,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-10-02 11:19:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-10-02 11:19:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1775, Invalid=5197, Unknown=0, NotChecked=0, Total=6972 [2019-10-02 11:19:54,201 INFO L87 Difference]: Start difference. First operand 292 states and 340 transitions. Second operand 84 states. [2019-10-02 11:19:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:58,333 INFO L93 Difference]: Finished difference Result 1370 states and 1787 transitions. [2019-10-02 11:19:58,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-10-02 11:19:58,333 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 246 [2019-10-02 11:19:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:58,340 INFO L225 Difference]: With dead ends: 1370 [2019-10-02 11:19:58,340 INFO L226 Difference]: Without dead ends: 1220 [2019-10-02 11:19:58,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7178 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7724, Invalid=24496, Unknown=0, NotChecked=0, Total=32220 [2019-10-02 11:19:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2019-10-02 11:19:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 298. [2019-10-02 11:19:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-02 11:19:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 347 transitions. [2019-10-02 11:19:58,377 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 347 transitions. Word has length 246 [2019-10-02 11:19:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:58,377 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 347 transitions. [2019-10-02 11:19:58,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-10-02 11:19:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 347 transitions. [2019-10-02 11:19:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 11:19:58,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:58,381 INFO L411 BasicCegarLoop]: trace histogram [81, 80, 47, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:58,381 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:58,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:58,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1215483078, now seen corresponding path program 21 times [2019-10-02 11:19:58,382 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:58,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:58,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:58,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:58,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 6383 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2019-10-02 11:19:59,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:59,073 INFO L224 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-10-02 11:19:59,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:19:59,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-10-02 11:19:59,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:59,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 83 conjunts are in the unsatisfiable core [2019-10-02 11:19:59,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 6286 proven. 3334 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 11:19:59,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:59,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 50] total 54 [2019-10-02 11:19:59,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-02 11:19:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-02 11:19:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 11:19:59,905 INFO L87 Difference]: Start difference. First operand 298 states and 347 transitions. Second operand 54 states. [2019-10-02 11:20:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:04,104 INFO L93 Difference]: Finished difference Result 1967 states and 2593 transitions. [2019-10-02 11:20:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-10-02 11:20:04,104 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 252 [2019-10-02 11:20:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:04,114 INFO L225 Difference]: With dead ends: 1967 [2019-10-02 11:20:04,115 INFO L226 Difference]: Without dead ends: 1962 [2019-10-02 11:20:04,118 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7901, Invalid=15355, Unknown=0, NotChecked=0, Total=23256 [2019-10-02 11:20:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-10-02 11:20:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 304. [2019-10-02 11:20:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-02 11:20:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 355 transitions. [2019-10-02 11:20:04,165 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 355 transitions. Word has length 252 [2019-10-02 11:20:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:04,166 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 355 transitions. [2019-10-02 11:20:04,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-02 11:20:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 355 transitions. [2019-10-02 11:20:04,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 11:20:04,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:04,173 INFO L411 BasicCegarLoop]: trace histogram [98, 97, 51, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:04,174 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash -950949861, now seen corresponding path program 22 times [2019-10-02 11:20:04,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:04,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:04,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 3868 proven. 10391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:10,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:10,819 INFO L224 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-10-02 11:20:10,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:20:10,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:20:10,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:10,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 11:20:10,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 7197 proven. 3337 refuted. 0 times theorem prover too weak. 3725 trivial. 0 not checked. [2019-10-02 11:20:14,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:14,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 50] total 195 [2019-10-02 11:20:14,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 195 states [2019-10-02 11:20:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2019-10-02 11:20:14,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7205, Invalid=30625, Unknown=0, NotChecked=0, Total=37830 [2019-10-02 11:20:14,429 INFO L87 Difference]: Start difference. First operand 304 states and 355 transitions. Second operand 195 states. [2019-10-02 11:20:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:21,060 INFO L93 Difference]: Finished difference Result 467 states and 570 transitions. [2019-10-02 11:20:21,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-02 11:20:21,060 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 303 [2019-10-02 11:20:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:21,062 INFO L225 Difference]: With dead ends: 467 [2019-10-02 11:20:21,062 INFO L226 Difference]: Without dead ends: 308 [2019-10-02 11:20:21,065 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18748 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=20707, Invalid=63103, Unknown=0, NotChecked=0, Total=83810 [2019-10-02 11:20:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-02 11:20:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2019-10-02 11:20:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-02 11:20:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 358 transitions. [2019-10-02 11:20:21,091 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 358 transitions. Word has length 303 [2019-10-02 11:20:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:21,092 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 358 transitions. [2019-10-02 11:20:21,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 195 states. [2019-10-02 11:20:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 358 transitions. [2019-10-02 11:20:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 11:20:21,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:21,096 INFO L411 BasicCegarLoop]: trace histogram [99, 98, 51, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:21,097 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1225535976, now seen corresponding path program 23 times [2019-10-02 11:20:21,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:21,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:21,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:21,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 14553 backedges. 3871 proven. 10682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:27,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:27,603 INFO L224 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-10-02 11:20:27,700 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:20:27,955 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 99 check-sat command(s) [2019-10-02 11:20:27,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:27,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-02 11:20:27,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14553 backedges. 7348 proven. 3480 refuted. 0 times theorem prover too weak. 3725 trivial. 0 not checked. [2019-10-02 11:20:31,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:31,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 51] total 198 [2019-10-02 11:20:31,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-10-02 11:20:31,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-10-02 11:20:31,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7450, Invalid=31556, Unknown=0, NotChecked=0, Total=39006 [2019-10-02 11:20:31,612 INFO L87 Difference]: Start difference. First operand 307 states and 358 transitions. Second operand 198 states. [2019-10-02 11:20:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:38,242 INFO L93 Difference]: Finished difference Result 470 states and 573 transitions. [2019-10-02 11:20:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-10-02 11:20:38,242 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 306 [2019-10-02 11:20:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:38,244 INFO L225 Difference]: With dead ends: 470 [2019-10-02 11:20:38,244 INFO L226 Difference]: Without dead ends: 311 [2019-10-02 11:20:38,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19198 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21618, Invalid=65112, Unknown=0, NotChecked=0, Total=86730 [2019-10-02 11:20:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-02 11:20:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2019-10-02 11:20:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-10-02 11:20:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 361 transitions. [2019-10-02 11:20:38,273 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 361 transitions. Word has length 306 [2019-10-02 11:20:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:38,274 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 361 transitions. [2019-10-02 11:20:38,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-10-02 11:20:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 361 transitions. [2019-10-02 11:20:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 11:20:38,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:38,278 INFO L411 BasicCegarLoop]: trace histogram [100, 99, 51, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:38,278 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:38,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:38,278 INFO L82 PathProgramCache]: Analyzing trace with hash 492210939, now seen corresponding path program 24 times [2019-10-02 11:20:38,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:38,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:38,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 14850 backedges. 3874 proven. 10976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:44,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:44,953 INFO L224 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-10-02 11:20:45,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:20:45,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2019-10-02 11:20:45,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:45,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-02 11:20:45,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14850 backedges. 7499 proven. 3626 refuted. 0 times theorem prover too weak. 3725 trivial. 0 not checked. [2019-10-02 11:20:49,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:49,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 52] total 201 [2019-10-02 11:20:49,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 201 states [2019-10-02 11:20:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2019-10-02 11:20:49,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7700, Invalid=32500, Unknown=0, NotChecked=0, Total=40200 [2019-10-02 11:20:49,582 INFO L87 Difference]: Start difference. First operand 310 states and 361 transitions. Second operand 201 states. [2019-10-02 11:20:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:56,530 INFO L93 Difference]: Finished difference Result 521 states and 624 transitions. [2019-10-02 11:20:56,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-10-02 11:20:56,536 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 309 [2019-10-02 11:20:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:56,538 INFO L225 Difference]: With dead ends: 521 [2019-10-02 11:20:56,539 INFO L226 Difference]: Without dead ends: 362 [2019-10-02 11:20:56,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19648 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=22552, Invalid=67148, Unknown=0, NotChecked=0, Total=89700 [2019-10-02 11:20:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-02 11:20:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 313. [2019-10-02 11:20:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-02 11:20:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2019-10-02 11:20:56,570 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 309 [2019-10-02 11:20:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:56,570 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2019-10-02 11:20:56,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 201 states. [2019-10-02 11:20:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2019-10-02 11:20:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 11:20:56,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:56,573 INFO L411 BasicCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:56,573 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash -644776136, now seen corresponding path program 25 times [2019-10-02 11:20:56,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:56,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:56,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:56,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:56,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:00,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:00,846 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:21:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:21:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:01,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 158 conjunts are in the unsatisfiable core [2019-10-02 11:21:01,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:01,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:01,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:01,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 108 [2019-10-02 11:21:01,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-10-02 11:21:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-10-02 11:21:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1491, Invalid=10065, Unknown=0, NotChecked=0, Total=11556 [2019-10-02 11:21:01,385 INFO L87 Difference]: Start difference. First operand 313 states and 364 transitions. Second operand 108 states. [2019-10-02 11:21:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:08,646 INFO L93 Difference]: Finished difference Result 4398 states and 5825 transitions. [2019-10-02 11:21:08,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-10-02 11:21:08,647 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 312 [2019-10-02 11:21:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:08,665 INFO L225 Difference]: With dead ends: 4398 [2019-10-02 11:21:08,666 INFO L226 Difference]: Without dead ends: 4236 [2019-10-02 11:21:08,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2806 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1497, Invalid=10275, Unknown=0, NotChecked=0, Total=11772 [2019-10-02 11:21:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2019-10-02 11:21:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 4187. [2019-10-02 11:21:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-10-02 11:21:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 4287 transitions. [2019-10-02 11:21:09,135 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 4287 transitions. Word has length 312 [2019-10-02 11:21:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:09,135 INFO L475 AbstractCegarLoop]: Abstraction has 4187 states and 4287 transitions. [2019-10-02 11:21:09,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-10-02 11:21:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 4287 transitions. [2019-10-02 11:21:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-02 11:21:09,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:09,138 INFO L411 BasicCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:09,138 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1847249315, now seen corresponding path program 26 times [2019-10-02 11:21:09,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:09,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:09,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:21:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-02 11:21:10,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:10,420 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:21:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:21:10,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:21:10,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:10,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 103 conjunts are in the unsatisfiable core [2019-10-02 11:21:10,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-02 11:21:10,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:10,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-10-02 11:21:10,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-02 11:21:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-02 11:21:10,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 11:21:10,789 INFO L87 Difference]: Start difference. First operand 4187 states and 4287 transitions. Second operand 54 states. [2019-10-02 11:21:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:11,885 INFO L93 Difference]: Finished difference Result 8374 states and 8575 transitions. [2019-10-02 11:21:11,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 11:21:11,885 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 315 [2019-10-02 11:21:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:11,902 INFO L225 Difference]: With dead ends: 8374 [2019-10-02 11:21:11,903 INFO L226 Difference]: Without dead ends: 4190 [2019-10-02 11:21:11,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 11:21:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-10-02 11:21:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2019-10-02 11:21:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-10-02 11:21:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 4290 transitions. [2019-10-02 11:21:12,380 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 4290 transitions. Word has length 315 [2019-10-02 11:21:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:12,381 INFO L475 AbstractCegarLoop]: Abstraction has 4190 states and 4290 transitions. [2019-10-02 11:21:12,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-02 11:21:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 4290 transitions. [2019-10-02 11:21:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-02 11:21:12,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:12,383 INFO L411 BasicCegarLoop]: trace histogram [103, 102, 52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:12,383 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash -973780774, now seen corresponding path program 27 times [2019-10-02 11:21:12,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:12,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:12,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:12,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:12,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15759 backedges. 11729 proven. 0 refuted. 0 times theorem prover too weak. 4030 trivial. 0 not checked. [2019-10-02 11:21:13,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:21:13,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2019-10-02 11:21:13,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 11:21:13,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 11:21:13,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:21:13,931 INFO L87 Difference]: Start difference. First operand 4190 states and 4290 transitions. Second operand 53 states. [2019-10-02 11:21:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:14,119 INFO L93 Difference]: Finished difference Result 4190 states and 4290 transitions. [2019-10-02 11:21:14,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 11:21:14,120 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 318 [2019-10-02 11:21:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:14,120 INFO L225 Difference]: With dead ends: 4190 [2019-10-02 11:21:14,120 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:21:14,128 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:21:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:21:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:21:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:21:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:21:14,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 318 [2019-10-02 11:21:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:14,129 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:21:14,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 11:21:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:21:14,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:21:14,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:21:20,477 WARN L191 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 1676 DAG size of output: 953 [2019-10-02 11:21:27,557 WARN L191 SmtUtils]: Spent 7.05 s on a formula simplification. DAG size of input: 869 DAG size of output: 477 [2019-10-02 11:21:27,567 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:21:27,567 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:21:27,567 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:21:27,567 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:21:27,567 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:21:27,567 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:21:27,567 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 25) the Hoare annotation is: true [2019-10-02 11:21:27,567 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 25) no Hoare annotation was computed. [2019-10-02 11:21:27,567 INFO L443 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-10-02 11:21:27,567 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2019-10-02 11:21:27,567 INFO L443 ceAbstractionStarter]: For program point L15-2(lines 14 22) no Hoare annotation was computed. [2019-10-02 11:21:27,567 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 25) no Hoare annotation was computed. [2019-10-02 11:21:27,569 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 14 22) the Hoare annotation is: (let ((.cse12 (<= main_~x~0 main_~y~0)) (.cse4 (<= 14 main_~y~0))) (let ((.cse15 (<= 47 main_~y~0)) (.cse5 (and .cse12 .cse4))) (let ((.cse1 (<= main_~y~0 34)) (.cse8 (<= 8 main_~y~0)) (.cse18 (<= main_~y~0 49)) (.cse13 (<= main_~y~0 0)) (.cse19 (<= main_~y~0 20)) (.cse21 (<= main_~y~0 19)) (.cse3 (<= main_~y~0 23)) (.cse0 (<= main_~y~0 1)) (.cse31 (<= main_~y~0 31)) (.cse16 (<= main_~y~0 18)) (.cse17 (and .cse15 .cse5)) (.cse33 (<= 9 main_~y~0)) (.cse24 (<= main_~y~0 27)) (.cse11 (<= 7 main_~y~0)) (.cse10 (<= 3 main_~y~0)) (.cse7 (<= main_~y~0 29)) (.cse29 (<= main_~y~0 26)) (.cse26 (<= main_~y~0 21)) (.cse20 (<= main_~y~0 30)) (.cse28 (<= main_~y~0 39)) (.cse30 (<= main_~y~0 2)) (.cse35 (<= main_~y~0 41)) (.cse23 (<= main_~y~0 32)) (.cse2 (<= main_~y~0 35)) (.cse40 (<= main_~y~0 38)) (.cse38 (<= main_~y~0 28)) (.cse39 (<= main_~y~0 17)) (.cse14 (<= main_~y~0 37)) (.cse9 (<= main_~y~0 16)) (.cse6 (+ main_~x~0 main_~y~0)) (.cse41 (<= main_~y~0 15)) (.cse37 (<= 44 main_~y~0)) (.cse34 (<= main_~y~0 40)) (.cse42 (<= main_~y~0 24)) (.cse22 (<= main_~y~0 33)) (.cse44 (<= main_~y~0 42)) (.cse32 (<= main_~y~0 6)) (.cse25 (<= main_~y~0 25)) (.cse43 (<= main_~y~0 43)) (.cse27 (<= main_~y~0 36)) (.cse36 (<= main_~y~0 22))) (or (and (<= main_~x~0 99) (<= 1 main_~y~0) .cse0 (<= 99 main_~x~0)) (and .cse1 (<= 66 main_~x~0) (<= 34 main_~y~0) (<= main_~x~0 66)) (and (<= 35 main_~y~0) .cse2 (<= 65 main_~x~0) (<= main_~x~0 65)) (and (<= 23 main_~y~0) .cse3 (<= 77 main_~x~0) (<= main_~x~0 77)) (and .cse4 (<= main_~x~0 86) (<= main_~y~0 14) (<= 86 main_~x~0)) (and (<= 46 main_~x~0) .cse5 (<= .cse6 92)) (and .cse7 (<= 71 main_~x~0) (<= main_~x~0 71) (<= 29 main_~y~0)) (and (<= 46 main_~y~0) (<= 54 main_~x~0) (<= main_~x~0 54) (<= main_~y~0 46)) (and (<= 8 main_~x~0) .cse8 (<= .cse6 16)) (and (<= 16 main_~x~0) .cse9 .cse5) (and (<= 34 main_~x~0) .cse1 .cse5) (and .cse10 (<= 97 main_~x~0) (<= main_~y~0 3) (<= main_~x~0 97)) (and .cse11 (<= 93 main_~x~0) (<= main_~y~0 7) (<= main_~x~0 93)) (and .cse12 (<= 0 main_~x~0) .cse13) (and (<= 63 main_~x~0) (<= 37 main_~y~0) (<= main_~x~0 63) .cse14) (and (<= main_~y~0 10) (<= 10 main_~y~0) (<= 90 main_~x~0) (<= main_~x~0 90)) (and (<= 48 main_~y~0) (<= main_~y~0 48) (<= main_~x~0 52) (<= 52 main_~x~0)) (and (<= main_~x~0 92) .cse8 (<= main_~y~0 8) (<= 92 main_~x~0)) (and (<= 5 main_~x~0) .cse12 (<= .cse6 10)) (and (<= main_~y~0 47) (<= 53 main_~x~0) (<= main_~x~0 53) .cse15) (and .cse5 .cse16 (<= 18 main_~x~0)) (and (<= 47 main_~x~0) (<= .cse6 94) .cse17) (and (<= 49 main_~x~0) .cse17 .cse18) (and (<= main_~y~0 50) (<= 50 main_~x~0) .cse17) (and (<= 49 main_~y~0) (<= main_~x~0 51) (<= 51 main_~x~0) .cse18) (and (<= main_~x~0 95) (<= main_~y~0 5) (<= 5 main_~y~0) (<= 95 main_~x~0)) (and (<= 20 main_~x~0) .cse19 .cse5) (and (<= main_~x~0 70) (<= 30 main_~y~0) .cse20 (<= 70 main_~x~0)) (and .cse21 .cse5 (<= 19 main_~x~0)) (and .cse22 (<= 33 main_~x~0) .cse5) (and (<= 32 main_~x~0) .cse23 .cse5) (and .cse24 .cse5 (<= 27 main_~x~0)) (and (<= main_~x~0 100) (<= 0 main_~y~0) (<= 100 main_~x~0) .cse13) (and (<= 25 main_~y~0) (<= main_~x~0 75) (<= 75 main_~x~0) .cse25) (and (<= 20 main_~y~0) (<= 80 main_~x~0) (<= main_~x~0 80) .cse19) (and .cse26 (<= 21 main_~x~0) .cse5) (and (<= main_~x~0 64) .cse27 (<= 64 main_~x~0) (<= 36 main_~y~0)) (and (<= 19 main_~y~0) (<= main_~x~0 81) (<= 81 main_~x~0) .cse21) (and (<= 39 main_~x~0) .cse28 .cse5) (and .cse3 (<= 23 main_~x~0) .cse5) (and (<= main_~y~0 4) (<= main_~x~0 96) (<= 4 main_~y~0) (<= 96 main_~x~0)) (and (<= 1 main_~x~0) .cse12 .cse0) (and (<= 74 main_~x~0) (<= 26 main_~y~0) (<= main_~x~0 74) .cse29) (and (<= 2 main_~x~0) .cse30 .cse12) (and (<= 31 main_~x~0) .cse5 .cse31) (and (<= 31 main_~y~0) (<= main_~x~0 69) (<= 69 main_~x~0) .cse31) (and (<= main_~y~0 45) (<= main_~x~0 55) (<= 45 main_~y~0) (<= 55 main_~x~0)) (and (<= .cse6 8) (<= 4 main_~x~0) .cse12) (and .cse32 (<= 6 main_~x~0) .cse12) (and (<= 9 main_~x~0) (<= .cse6 18) .cse33) (and (<= 45 main_~x~0) (<= .cse6 90) .cse5) (and (<= 18 main_~y~0) .cse16 (<= 82 main_~x~0) (<= main_~x~0 82)) (and (<= 11 main_~x~0) (<= .cse6 22) .cse12) (and (<= 48 main_~x~0) .cse17 (<= .cse6 96)) (and .cse34 .cse5 (<= 40 main_~x~0)) (and (<= main_~x~0 91) (<= 91 main_~x~0) (<= main_~y~0 9) .cse33) (and (<= main_~x~0 73) (<= 27 main_~y~0) (<= 73 main_~x~0) .cse24) (and .cse35 (<= 41 main_~x~0) .cse5) (and (<= main_~y~0 13) (<= main_~x~0 87) (<= 13 main_~y~0) (<= 87 main_~x~0)) (and (<= .cse6 14) .cse11 (<= 7 main_~x~0)) (and .cse36 .cse5 (<= 22 main_~x~0)) (and (<= 44 main_~x~0) (<= .cse6 88) .cse37) (and .cse38 (<= 28 main_~x~0) .cse5) (and (<= .cse6 6) (<= 3 main_~x~0) .cse10) (and .cse7 (<= 29 main_~x~0) .cse5) (and .cse5 .cse29 (<= 26 main_~x~0)) (and (<= 12 main_~x~0) .cse12 (<= .cse6 24)) (and .cse39 (<= 17 main_~x~0) .cse5) (and .cse40 (<= 38 main_~x~0) .cse5) (and .cse26 (<= main_~x~0 79) (<= 21 main_~y~0) (<= 79 main_~x~0)) (and (<= 30 main_~x~0) .cse20 .cse5) (and (<= 61 main_~x~0) .cse28 (<= main_~x~0 61) (<= 39 main_~y~0)) (and (<= main_~x~0 88) (<= 88 main_~x~0) (<= main_~y~0 12) (<= 12 main_~y~0)) (and .cse30 (<= main_~x~0 98) (<= 2 main_~y~0) (<= 98 main_~x~0)) (and .cse35 (<= 41 main_~y~0) (<= 59 main_~x~0) (<= main_~x~0 59)) (and (<= 68 main_~x~0) (<= 32 main_~y~0) (<= main_~x~0 68) .cse23) (and (<= .cse6 20) (<= 10 main_~x~0) .cse12) (and .cse41 (<= main_~x~0 85) (<= 15 main_~y~0) (<= 85 main_~x~0)) (and (<= 35 main_~x~0) .cse2 .cse5) (and (<= 13 main_~x~0) (<= .cse6 26) .cse12) (and (<= 62 main_~x~0) (<= main_~x~0 62) (<= 38 main_~y~0) .cse40) (and .cse38 (<= 72 main_~x~0) (<= 28 main_~y~0) (<= main_~x~0 72)) (and .cse39 (<= 83 main_~x~0) (<= 17 main_~y~0) (<= main_~x~0 83)) (and .cse42 (<= 24 main_~y~0) (<= 76 main_~x~0) (<= main_~x~0 76)) (and (<= 37 main_~x~0) .cse14 .cse5) (and .cse9 (<= 84 main_~x~0) (<= 16 main_~y~0) (<= main_~x~0 84)) (and (<= 14 main_~x~0) (<= .cse6 28) .cse5) (and (<= main_~y~0 11) (<= 11 main_~y~0) (<= 89 main_~x~0) (<= main_~x~0 89)) (and (<= 15 main_~x~0) .cse41 .cse5) (and (<= 57 main_~x~0) (<= main_~x~0 57) (<= 43 main_~y~0) .cse43) (and (<= main_~x~0 56) .cse37 (<= main_~y~0 44) (<= 56 main_~x~0)) (and .cse34 (<= main_~x~0 60) (<= 40 main_~y~0) (<= 60 main_~x~0)) (and .cse42 (<= 24 main_~x~0) .cse5) (and .cse44 (<= 42 main_~x~0) .cse5) (and .cse22 (<= 67 main_~x~0) (<= main_~x~0 67) (<= 33 main_~y~0)) (and (<= 58 main_~x~0) .cse44 (<= main_~x~0 58) (<= 42 main_~y~0)) (and (<= 94 main_~x~0) (<= 6 main_~y~0) .cse32 (<= main_~x~0 94)) (and (<= 25 main_~x~0) .cse5 .cse25) (and (<= 43 main_~x~0) .cse43 .cse5) (and .cse27 .cse5 (<= 36 main_~x~0)) (and (<= main_~x~0 78) (<= 22 main_~y~0) .cse36 (<= 78 main_~x~0)))))) [2019-10-02 11:21:27,569 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 22) the Hoare annotation is: (and (<= (+ main_~y~0 1) 0) (<= main_~x~0 100) (<= 100 main_~x~0)) [2019-10-02 11:21:27,570 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-02 11:21:27,570 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:21:27,570 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-02 11:21:27,570 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-02 11:21:27,570 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-02 11:21:27,570 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:21:27,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:21:27 BoogieIcfgContainer [2019-10-02 11:21:27,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:21:27,620 INFO L168 Benchmark]: Toolchain (without parser) took 130996.42 ms. Allocated memory was 140.0 MB in the beginning and 1.1 GB in the end (delta: 925.4 MB). Free memory was 87.6 MB in the beginning and 591.3 MB in the end (delta: -503.7 MB). Peak memory consumption was 909.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:21:27,620 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:21:27,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.20 ms. Allocated memory is still 140.0 MB. Free memory was 87.4 MB in the beginning and 78.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:21:27,622 INFO L168 Benchmark]: Boogie Preprocessor took 115.78 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 78.1 MB in the beginning and 177.1 MB in the end (delta: -99.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:21:27,623 INFO L168 Benchmark]: RCFGBuilder took 239.64 ms. Allocated memory is still 199.2 MB. Free memory was 177.1 MB in the beginning and 165.0 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:21:27,623 INFO L168 Benchmark]: TraceAbstraction took 130403.65 ms. Allocated memory was 199.2 MB in the beginning and 1.1 GB in the end (delta: 866.1 MB). Free memory was 165.0 MB in the beginning and 591.3 MB in the end (delta: -426.3 MB). Peak memory consumption was 927.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:21:27,627 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 233.20 ms. Allocated memory is still 140.0 MB. Free memory was 87.4 MB in the beginning and 78.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.78 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 78.1 MB in the beginning and 177.1 MB in the end (delta: -99.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 239.64 ms. Allocated memory is still 199.2 MB. Free memory was 177.1 MB in the beginning and 165.0 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130403.65 ms. Allocated memory was 199.2 MB in the beginning and 1.1 GB in the end (delta: 866.1 MB). Free memory was 165.0 MB in the beginning and 591.3 MB in the end (delta: -426.3 MB). Peak memory consumption was 927.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x <= 99 && 1 <= y) && y <= 1) && 99 <= x) || (((y <= 34 && 66 <= x) && 34 <= y) && x <= 66)) || (((35 <= y && y <= 35) && 65 <= x) && x <= 65)) || (((23 <= y && y <= 23) && 77 <= x) && x <= 77)) || (((14 <= y && x <= 86) && y <= 14) && 86 <= x)) || ((46 <= x && x <= y && 14 <= y) && x + y <= 92)) || (((y <= 29 && 71 <= x) && x <= 71) && 29 <= y)) || (((46 <= y && 54 <= x) && x <= 54) && y <= 46)) || ((8 <= x && 8 <= y) && x + y <= 16)) || ((16 <= x && y <= 16) && x <= y && 14 <= y)) || ((34 <= x && y <= 34) && x <= y && 14 <= y)) || (((3 <= y && 97 <= x) && y <= 3) && x <= 97)) || (((7 <= y && 93 <= x) && y <= 7) && x <= 93)) || ((x <= y && 0 <= x) && y <= 0)) || (((63 <= x && 37 <= y) && x <= 63) && y <= 37)) || (((y <= 10 && 10 <= y) && 90 <= x) && x <= 90)) || (((48 <= y && y <= 48) && x <= 52) && 52 <= x)) || (((x <= 92 && 8 <= y) && y <= 8) && 92 <= x)) || ((5 <= x && x <= y) && x + y <= 10)) || (((y <= 47 && 53 <= x) && x <= 53) && 47 <= y)) || (((x <= y && 14 <= y) && y <= 18) && 18 <= x)) || ((47 <= x && x + y <= 94) && 47 <= y && x <= y && 14 <= y)) || ((49 <= x && 47 <= y && x <= y && 14 <= y) && y <= 49)) || ((y <= 50 && 50 <= x) && 47 <= y && x <= y && 14 <= y)) || (((49 <= y && x <= 51) && 51 <= x) && y <= 49)) || (((x <= 95 && y <= 5) && 5 <= y) && 95 <= x)) || ((20 <= x && y <= 20) && x <= y && 14 <= y)) || (((x <= 70 && 30 <= y) && y <= 30) && 70 <= x)) || ((y <= 19 && x <= y && 14 <= y) && 19 <= x)) || ((y <= 33 && 33 <= x) && x <= y && 14 <= y)) || ((32 <= x && y <= 32) && x <= y && 14 <= y)) || ((y <= 27 && x <= y && 14 <= y) && 27 <= x)) || (((x <= 100 && 0 <= y) && 100 <= x) && y <= 0)) || (((25 <= y && x <= 75) && 75 <= x) && y <= 25)) || (((20 <= y && 80 <= x) && x <= 80) && y <= 20)) || ((y <= 21 && 21 <= x) && x <= y && 14 <= y)) || (((x <= 64 && y <= 36) && 64 <= x) && 36 <= y)) || (((19 <= y && x <= 81) && 81 <= x) && y <= 19)) || ((39 <= x && y <= 39) && x <= y && 14 <= y)) || ((y <= 23 && 23 <= x) && x <= y && 14 <= y)) || (((y <= 4 && x <= 96) && 4 <= y) && 96 <= x)) || ((1 <= x && x <= y) && y <= 1)) || (((74 <= x && 26 <= y) && x <= 74) && y <= 26)) || ((2 <= x && y <= 2) && x <= y)) || ((31 <= x && x <= y && 14 <= y) && y <= 31)) || (((31 <= y && x <= 69) && 69 <= x) && y <= 31)) || (((y <= 45 && x <= 55) && 45 <= y) && 55 <= x)) || ((x + y <= 8 && 4 <= x) && x <= y)) || ((y <= 6 && 6 <= x) && x <= y)) || ((9 <= x && x + y <= 18) && 9 <= y)) || ((45 <= x && x + y <= 90) && x <= y && 14 <= y)) || (((18 <= y && y <= 18) && 82 <= x) && x <= 82)) || ((11 <= x && x + y <= 22) && x <= y)) || ((48 <= x && 47 <= y && x <= y && 14 <= y) && x + y <= 96)) || ((y <= 40 && x <= y && 14 <= y) && 40 <= x)) || (((x <= 91 && 91 <= x) && y <= 9) && 9 <= y)) || (((x <= 73 && 27 <= y) && 73 <= x) && y <= 27)) || ((y <= 41 && 41 <= x) && x <= y && 14 <= y)) || (((y <= 13 && x <= 87) && 13 <= y) && 87 <= x)) || ((x + y <= 14 && 7 <= y) && 7 <= x)) || ((y <= 22 && x <= y && 14 <= y) && 22 <= x)) || ((44 <= x && x + y <= 88) && 44 <= y)) || ((y <= 28 && 28 <= x) && x <= y && 14 <= y)) || ((x + y <= 6 && 3 <= x) && 3 <= y)) || ((y <= 29 && 29 <= x) && x <= y && 14 <= y)) || (((x <= y && 14 <= y) && y <= 26) && 26 <= x)) || ((12 <= x && x <= y) && x + y <= 24)) || ((y <= 17 && 17 <= x) && x <= y && 14 <= y)) || ((y <= 38 && 38 <= x) && x <= y && 14 <= y)) || (((y <= 21 && x <= 79) && 21 <= y) && 79 <= x)) || ((30 <= x && y <= 30) && x <= y && 14 <= y)) || (((61 <= x && y <= 39) && x <= 61) && 39 <= y)) || (((x <= 88 && 88 <= x) && y <= 12) && 12 <= y)) || (((y <= 2 && x <= 98) && 2 <= y) && 98 <= x)) || (((y <= 41 && 41 <= y) && 59 <= x) && x <= 59)) || (((68 <= x && 32 <= y) && x <= 68) && y <= 32)) || ((x + y <= 20 && 10 <= x) && x <= y)) || (((y <= 15 && x <= 85) && 15 <= y) && 85 <= x)) || ((35 <= x && y <= 35) && x <= y && 14 <= y)) || ((13 <= x && x + y <= 26) && x <= y)) || (((62 <= x && x <= 62) && 38 <= y) && y <= 38)) || (((y <= 28 && 72 <= x) && 28 <= y) && x <= 72)) || (((y <= 17 && 83 <= x) && 17 <= y) && x <= 83)) || (((y <= 24 && 24 <= y) && 76 <= x) && x <= 76)) || ((37 <= x && y <= 37) && x <= y && 14 <= y)) || (((y <= 16 && 84 <= x) && 16 <= y) && x <= 84)) || ((14 <= x && x + y <= 28) && x <= y && 14 <= y)) || (((y <= 11 && 11 <= y) && 89 <= x) && x <= 89)) || ((15 <= x && y <= 15) && x <= y && 14 <= y)) || (((57 <= x && x <= 57) && 43 <= y) && y <= 43)) || (((x <= 56 && 44 <= y) && y <= 44) && 56 <= x)) || (((y <= 40 && x <= 60) && 40 <= y) && 60 <= x)) || ((y <= 24 && 24 <= x) && x <= y && 14 <= y)) || ((y <= 42 && 42 <= x) && x <= y && 14 <= y)) || (((y <= 33 && 67 <= x) && x <= 67) && 33 <= y)) || (((58 <= x && y <= 42) && x <= 58) && 42 <= y)) || (((94 <= x && 6 <= y) && y <= 6) && x <= 94)) || ((25 <= x && x <= y && 14 <= y) && y <= 25)) || ((43 <= x && y <= 43) && x <= y && 14 <= y)) || ((y <= 36 && x <= y && 14 <= y) && 36 <= x)) || (((x <= 78 && 22 <= y) && y <= 22) && 78 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 130.2s OverallTime, 30 OverallIterations, 103 TraceHistogramMax, 55.6s AutomataDifference, 0.0s DeadEndRemovalTime, 13.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 637 SDtfs, 843 SDslu, 24335 SDs, 0 SdLazy, 19200 SolverSat, 5316 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6488 GetRequests, 3898 SyntacticMatches, 0 SemanticMatches, 2590 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98891 ImplicationChecksByTransitivity, 88.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4190occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 6125 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 37 PreInvPairs, 139 NumberOfFragments, 1370 HoareAnnotationTreeSize, 37 FomulaSimplifications, 2663313 FormulaSimplificationTreeSizeReduction, 6.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 10093 FormulaSimplificationTreeSizeReductionInter, 7.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 54.3s InterpolantComputationTime, 7786 NumberOfCodeBlocks, 7768 NumberOfCodeBlocksAsserted, 592 NumberOfCheckSat, 7730 ConstructedInterpolants, 0 QuantifiedInterpolants, 5405376 SizeOfPredicates, 27 NumberOfNonLiveVariables, 8631 ConjunctsInSsa, 879 ConjunctsInUnsatCore, 56 InterpolantComputations, 4 PerfectInterpolantSequences, 128521/270417 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...