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/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:01:24,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:01:24,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:01:24,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:01:24,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:01:24,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:01:24,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:01:24,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:01:24,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:01:24,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:01:24,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:01:24,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:01:24,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:01:24,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:01:24,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:01:24,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:01:24,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:01:24,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:01:24,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:01:24,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:01:24,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:01:24,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:01:24,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:01:24,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:01:24,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:01:24,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:01:24,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:01:24,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:01:24,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:01:24,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:01:24,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:01:24,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:01:24,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:01:24,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:01:24,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:01:24,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:01:24,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:01:24,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:01:24,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:01:24,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:01:24,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:01:24,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 12:01:24,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:01:24,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:01:24,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 12:01:24,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 12:01:24,788 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 12:01:24,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:01:24,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:01:24,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 12:01:24,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:01:24,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:01:24,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:01:24,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:01:24,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:01:24,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:01:24,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:01:24,790 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 12:01:24,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:01:24,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:01:24,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:01:24,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 12:01:24,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 12:01:24,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:01:24,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:01:24,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:01:24,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 12:01:24,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 12:01:24,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:01:24,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:01:24,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 12:01:24,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:01:24,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:01:24,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:01:24,842 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:01:24,842 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:01:24,843 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-09-05 12:01:24,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad10d0e3c/e8ddbb58737c439981b0a48640a7108b/FLAG1523cbfdd [2019-09-05 12:01:25,374 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:01:25,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-09-05 12:01:25,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad10d0e3c/e8ddbb58737c439981b0a48640a7108b/FLAG1523cbfdd [2019-09-05 12:01:25,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad10d0e3c/e8ddbb58737c439981b0a48640a7108b [2019-09-05 12:01:25,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:01:25,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:01:25,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:01:25,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:01:25,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:01:25,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:01:25" (1/1) ... [2019-09-05 12:01:25,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dd4d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:25, skipping insertion in model container [2019-09-05 12:01:25,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:01:25" (1/1) ... [2019-09-05 12:01:25,852 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:01:25,885 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:01:26,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:01:26,080 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:01:26,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:01:26,241 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:01:26,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26 WrapperNode [2019-09-05 12:01:26,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:01:26,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:01:26,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:01:26,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:01:26,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26" (1/1) ... [2019-09-05 12:01:26,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26" (1/1) ... [2019-09-05 12:01:26,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26" (1/1) ... [2019-09-05 12:01:26,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26" (1/1) ... [2019-09-05 12:01:26,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26" (1/1) ... [2019-09-05 12:01:26,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26" (1/1) ... [2019-09-05 12:01:26,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26" (1/1) ... [2019-09-05 12:01:26,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:01:26,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:01:26,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:01:26,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:01:26,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:01:26,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:01:26,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:01:26,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:01:26,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:01:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 12:01:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:01:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 12:01:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:01:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:01:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:01:26,625 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:01:26,625 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 12:01:26,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:01:26 BoogieIcfgContainer [2019-09-05 12:01:26,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:01:26,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:01:26,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:01:26,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:01:26,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:01:25" (1/3) ... [2019-09-05 12:01:26,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e035d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:01:26, skipping insertion in model container [2019-09-05 12:01:26,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:01:26" (2/3) ... [2019-09-05 12:01:26,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e035d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:01:26, skipping insertion in model container [2019-09-05 12:01:26,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:01:26" (3/3) ... [2019-09-05 12:01:26,644 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2019-09-05 12:01:26,665 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:01:26,675 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:01:26,692 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:01:26,721 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 12:01:26,722 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:01:26,722 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 12:01:26,722 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:01:26,722 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:01:26,723 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:01:26,723 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:01:26,723 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:01:26,723 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:01:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-05 12:01:26,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 12:01:26,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:26,746 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:26,748 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2019-09-05 12:01:26,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:26,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:26,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:26,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:26,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:26,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:01:26,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:01:26,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:01:26,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:01:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:01:26,946 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-09-05 12:01:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:27,179 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2019-09-05 12:01:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:01:27,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-05 12:01:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:27,193 INFO L225 Difference]: With dead ends: 74 [2019-09-05 12:01:27,194 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 12:01:27,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:01:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 12:01:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-05 12:01:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 12:01:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-09-05 12:01:27,265 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2019-09-05 12:01:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:27,265 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-09-05 12:01:27,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:01:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-09-05 12:01:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 12:01:27,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:27,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:27,270 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:27,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2019-09-05 12:01:27,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:27,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:27,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:01:27,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:01:27,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:01:27,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:01:27,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:01:27,360 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 5 states. [2019-09-05 12:01:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:27,479 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-09-05 12:01:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:01:27,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-05 12:01:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:27,481 INFO L225 Difference]: With dead ends: 62 [2019-09-05 12:01:27,481 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 12:01:27,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:01:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 12:01:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 12:01:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 12:01:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-05 12:01:27,490 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-09-05 12:01:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:27,491 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-05 12:01:27,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:01:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-05 12:01:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 12:01:27,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:27,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:27,493 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:27,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash -646102720, now seen corresponding path program 1 times [2019-09-05 12:01:27,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:27,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:27,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:27,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:27,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:01:27,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 12:01:27,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:01:27,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:01:27,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:01:27,594 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 7 states. [2019-09-05 12:01:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:27,712 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-05 12:01:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:01:27,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-05 12:01:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:27,714 INFO L225 Difference]: With dead ends: 52 [2019-09-05 12:01:27,714 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 12:01:27,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:01:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 12:01:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 12:01:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 12:01:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-09-05 12:01:27,722 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2019-09-05 12:01:27,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:27,722 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-09-05 12:01:27,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:01:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-09-05 12:01:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 12:01:27,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:27,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:27,724 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:27,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2117052275, now seen corresponding path program 1 times [2019-09-05 12:01:27,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:27,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:27,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:27,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:01:27,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-05 12:01:27,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 12:01:27,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 12:01:27,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:01:27,857 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 10 states. [2019-09-05 12:01:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:27,939 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-09-05 12:01:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:01:27,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-05 12:01:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:27,940 INFO L225 Difference]: With dead ends: 42 [2019-09-05 12:01:27,940 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 12:01:27,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-09-05 12:01:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 12:01:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 12:01:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 12:01:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-05 12:01:27,946 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2019-09-05 12:01:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:27,947 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-05 12:01:27,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 12:01:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-05 12:01:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 12:01:27,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:27,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:27,948 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:27,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:27,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1286240867, now seen corresponding path program 1 times [2019-09-05 12:01:27,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:27,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:27,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:27,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:27,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:01:27,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:01:27,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:01:27,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:01:28,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:01:28,000 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2019-09-05 12:01:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:28,051 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-05 12:01:28,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:01:28,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-05 12:01:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:28,053 INFO L225 Difference]: With dead ends: 34 [2019-09-05 12:01:28,053 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 12:01:28,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:01:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 12:01:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 12:01:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 12:01:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-05 12:01:28,059 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-09-05 12:01:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:28,059 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-05 12:01:28,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:01:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-05 12:01:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 12:01:28,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:28,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:28,061 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1286806896, now seen corresponding path program 1 times [2019-09-05 12:01:28,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:28,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:28,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:28,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:28,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:28,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:01:28,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-05 12:01:28,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 12:01:28,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 12:01:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:01:28,187 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2019-09-05 12:01:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:28,276 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-05 12:01:28,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:01:28,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-05 12:01:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:28,278 INFO L225 Difference]: With dead ends: 36 [2019-09-05 12:01:28,278 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 12:01:28,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:01:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 12:01:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 12:01:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 12:01:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-05 12:01:28,289 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2019-09-05 12:01:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:28,289 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-05 12:01:28,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 12:01:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-05 12:01:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 12:01:28,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:28,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:28,293 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash -880646403, now seen corresponding path program 1 times [2019-09-05 12:01:28,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:28,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:28,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:01:28,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-05 12:01:28,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:01:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:01:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:01:28,441 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2019-09-05 12:01:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:28,531 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-05 12:01:28,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 12:01:28,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-09-05 12:01:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:28,534 INFO L225 Difference]: With dead ends: 38 [2019-09-05 12:01:28,535 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 12:01:28,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:01:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 12:01:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 12:01:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 12:01:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-05 12:01:28,548 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-09-05 12:01:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:28,549 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-05 12:01:28,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:01:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-05 12:01:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 12:01:28,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:28,553 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:28,553 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2019-09-05 12:01:28,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:28,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:28,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:28,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:28,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:28,722 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-09-05 12:01:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:28,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 12:01:28,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:28,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:28,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-05 12:01:28,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 12:01:28,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 12:01:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:01:28,809 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 13 states. [2019-09-05 12:01:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:28,912 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-05 12:01:28,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 12:01:28,912 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-09-05 12:01:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:28,913 INFO L225 Difference]: With dead ends: 40 [2019-09-05 12:01:28,913 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 12:01:28,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:01:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 12:01:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 12:01:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 12:01:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-05 12:01:28,928 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2019-09-05 12:01:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:28,928 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-05 12:01:28,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 12:01:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-05 12:01:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 12:01:28,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:28,930 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:28,930 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash -120875977, now seen corresponding path program 2 times [2019-09-05 12:01:28,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:28,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:28,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:28,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:28,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:29,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:29,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:29,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:29,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:29,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:29,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:01:29,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:01:29,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:29,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-05 12:01:29,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:01:29,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:01:29,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:01:29,127 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2019-09-05 12:01:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:29,215 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-05 12:01:29,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:01:29,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-09-05 12:01:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:29,217 INFO L225 Difference]: With dead ends: 42 [2019-09-05 12:01:29,217 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 12:01:29,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:01:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 12:01:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 12:01:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 12:01:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-05 12:01:29,227 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2019-09-05 12:01:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:29,227 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-05 12:01:29,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:01:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-05 12:01:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 12:01:29,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:29,234 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:29,234 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash -291122700, now seen corresponding path program 3 times [2019-09-05 12:01:29,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:29,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:29,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:29,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:29,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:29,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:29,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:29,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:29,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 12:01:29,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:29,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 12:01:29,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 12:01:29,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:29,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2019-09-05 12:01:29,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 12:01:29,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 12:01:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:01:29,497 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2019-09-05 12:01:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:29,600 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-09-05 12:01:29,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:01:29,600 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-09-05 12:01:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:29,601 INFO L225 Difference]: With dead ends: 46 [2019-09-05 12:01:29,601 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 12:01:29,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:01:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 12:01:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-05 12:01:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 12:01:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-05 12:01:29,607 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2019-09-05 12:01:29,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:29,607 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-05 12:01:29,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 12:01:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-05 12:01:29,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 12:01:29,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:29,608 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:29,608 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:29,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1159645813, now seen corresponding path program 4 times [2019-09-05 12:01:29,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:29,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:29,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:29,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:29,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:01:29,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:29,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:29,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:29,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:29,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:29,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 12:01:29,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:01:29,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:29,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-05 12:01:29,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:01:29,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:01:29,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:01:29,829 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 16 states. [2019-09-05 12:01:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:29,987 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-09-05 12:01:29,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 12:01:29,987 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-09-05 12:01:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:29,989 INFO L225 Difference]: With dead ends: 48 [2019-09-05 12:01:29,989 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 12:01:29,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:01:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 12:01:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-05 12:01:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 12:01:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-05 12:01:29,996 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2019-09-05 12:01:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:29,996 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-05 12:01:29,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:01:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-05 12:01:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 12:01:29,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:29,997 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:29,998 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:29,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:29,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1330868616, now seen corresponding path program 5 times [2019-09-05 12:01:29,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:29,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:29,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:01:30,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:30,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:30,161 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:01:30,191 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-05 12:01:30,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:30,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 12:01:30,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:01:30,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:30,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 21 [2019-09-05 12:01:30,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:01:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:01:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:01:30,265 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2019-09-05 12:01:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:30,401 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2019-09-05 12:01:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 12:01:30,402 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-09-05 12:01:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:30,403 INFO L225 Difference]: With dead ends: 55 [2019-09-05 12:01:30,403 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 12:01:30,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:01:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 12:01:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-05 12:01:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 12:01:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-05 12:01:30,409 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 41 [2019-09-05 12:01:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:30,410 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-05 12:01:30,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:01:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-05 12:01:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 12:01:30,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:30,411 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:30,411 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1267923961, now seen corresponding path program 6 times [2019-09-05 12:01:30,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:30,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:30,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:30,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:30,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:01:30,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:30,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:30,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:01:30,610 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-05 12:01:30,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:30,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:01:30,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:01:30,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:30,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-05 12:01:30,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 12:01:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 12:01:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-05 12:01:30,632 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 18 states. [2019-09-05 12:01:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:30,752 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-05 12:01:30,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 12:01:30,753 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-09-05 12:01:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:30,754 INFO L225 Difference]: With dead ends: 60 [2019-09-05 12:01:30,754 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 12:01:30,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-05 12:01:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 12:01:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-05 12:01:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 12:01:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-09-05 12:01:30,760 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 47 [2019-09-05 12:01:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:30,761 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-09-05 12:01:30,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 12:01:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-09-05 12:01:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 12:01:30,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:30,762 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:30,762 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1690572042, now seen corresponding path program 7 times [2019-09-05 12:01:30,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:30,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:30,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:01:30,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:30,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:30,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:30,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 12:01:30,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:01:30,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:30,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-05 12:01:30,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 12:01:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 12:01:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:01:30,984 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 19 states. [2019-09-05 12:01:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:31,085 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-09-05 12:01:31,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 12:01:31,086 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2019-09-05 12:01:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:31,087 INFO L225 Difference]: With dead ends: 62 [2019-09-05 12:01:31,087 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 12:01:31,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:01:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 12:01:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-05 12:01:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 12:01:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-09-05 12:01:31,093 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 49 [2019-09-05 12:01:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:31,093 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-09-05 12:01:31,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 12:01:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-09-05 12:01:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-05 12:01:31,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:31,095 INFO L399 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:31,095 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:31,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1536880973, now seen corresponding path program 8 times [2019-09-05 12:01:31,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:31,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:31,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:31,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:31,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:01:31,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:31,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:31,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:31,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:31,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:31,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 12:01:31,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 75 proven. 49 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-05 12:01:31,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:31,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 28 [2019-09-05 12:01:31,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:01:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:01:31,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:01:31,598 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 28 states. [2019-09-05 12:01:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:31,777 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-09-05 12:01:31,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 12:01:31,777 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2019-09-05 12:01:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:31,778 INFO L225 Difference]: With dead ends: 73 [2019-09-05 12:01:31,778 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 12:01:31,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:01:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 12:01:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-05 12:01:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-05 12:01:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-09-05 12:01:31,791 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 51 [2019-09-05 12:01:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:31,791 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-09-05 12:01:31,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:01:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-09-05 12:01:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-05 12:01:31,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:31,795 INFO L399 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:31,795 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2034313832, now seen corresponding path program 9 times [2019-09-05 12:01:31,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:31,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:31,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:31,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:31,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 150 proven. 90 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 12:01:32,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:32,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:32,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:32,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 12:01:32,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:32,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 12:01:32,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:32,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:32,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28] total 47 [2019-09-05 12:01:32,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 12:01:32,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 12:01:32,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:01:32,932 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 47 states. [2019-09-05 12:01:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:33,198 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2019-09-05 12:01:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 12:01:33,198 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 61 [2019-09-05 12:01:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:33,199 INFO L225 Difference]: With dead ends: 119 [2019-09-05 12:01:33,199 INFO L226 Difference]: Without dead ends: 101 [2019-09-05 12:01:33,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:01:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-05 12:01:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-05 12:01:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-05 12:01:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-09-05 12:01:33,208 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 61 [2019-09-05 12:01:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:33,208 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-09-05 12:01:33,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 12:01:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-09-05 12:01:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-05 12:01:33,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:33,210 INFO L399 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:33,210 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:33,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:33,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1443054295, now seen corresponding path program 10 times [2019-09-05 12:01:33,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:33,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:33,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:33,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:33,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 561 proven. 110 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-05 12:01:33,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:33,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:33,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:33,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:33,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:33,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 12:01:33,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 561 proven. 110 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-05 12:01:33,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:33,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-05 12:01:33,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 12:01:33,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 12:01:33,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 12:01:33,555 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 22 states. [2019-09-05 12:01:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:33,694 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-09-05 12:01:33,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 12:01:33,694 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 99 [2019-09-05 12:01:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:33,696 INFO L225 Difference]: With dead ends: 156 [2019-09-05 12:01:33,696 INFO L226 Difference]: Without dead ends: 102 [2019-09-05 12:01:33,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 12:01:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-05 12:01:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-05 12:01:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-05 12:01:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-09-05 12:01:33,703 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-09-05 12:01:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:33,704 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-09-05 12:01:33,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 12:01:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-09-05 12:01:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-05 12:01:33,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:33,705 INFO L399 BasicCegarLoop]: trace histogram [37, 26, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:33,706 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash 430708646, now seen corresponding path program 11 times [2019-09-05 12:01:33,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:33,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:33,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:33,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:33,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 612 proven. 132 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-05 12:01:33,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:33,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:34,004 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:01:34,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-09-05 12:01:34,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:34,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:01:34,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 583 proven. 676 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-05 12:01:35,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:35,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 50 [2019-09-05 12:01:35,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 12:01:35,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 12:01:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:01:35,035 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 50 states. [2019-09-05 12:01:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:35,371 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2019-09-05 12:01:35,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-05 12:01:35,372 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 101 [2019-09-05 12:01:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:35,374 INFO L225 Difference]: With dead ends: 161 [2019-09-05 12:01:35,374 INFO L226 Difference]: Without dead ends: 107 [2019-09-05 12:01:35,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:01:35,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-05 12:01:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-05 12:01:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-05 12:01:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-09-05 12:01:35,385 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 101 [2019-09-05 12:01:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:35,386 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-09-05 12:01:35,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 12:01:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-09-05 12:01:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-05 12:01:35,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:35,388 INFO L399 BasicCegarLoop]: trace histogram [39, 27, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:35,389 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1508217725, now seen corresponding path program 12 times [2019-09-05 12:01:35,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:35,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:35,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 689 proven. 156 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-05 12:01:35,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:35,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:35,778 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:35,852 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2019-09-05 12:01:35,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:35,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 12:01:35,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 660 proven. 729 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-05 12:01:36,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:36,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 30] total 52 [2019-09-05 12:01:36,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 12:01:36,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 12:01:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:01:36,733 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 52 states. [2019-09-05 12:01:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:36,965 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2019-09-05 12:01:36,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 12:01:36,966 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 105 [2019-09-05 12:01:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:36,966 INFO L225 Difference]: With dead ends: 167 [2019-09-05 12:01:36,966 INFO L226 Difference]: Without dead ends: 111 [2019-09-05 12:01:36,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:01:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-05 12:01:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-09-05 12:01:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-05 12:01:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-09-05 12:01:36,976 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 105 [2019-09-05 12:01:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:36,977 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-09-05 12:01:36,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 12:01:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-09-05 12:01:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-05 12:01:36,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:36,979 INFO L399 BasicCegarLoop]: trace histogram [41, 28, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:36,979 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:36,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash 997928724, now seen corresponding path program 13 times [2019-09-05 12:01:36,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:36,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:36,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:36,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:36,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 770 proven. 182 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 12:01:37,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:37,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:37,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:37,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 12:01:37,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 770 proven. 182 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 12:01:37,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:37,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-05 12:01:37,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 12:01:37,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 12:01:37,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:01:37,340 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 25 states. [2019-09-05 12:01:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:37,462 INFO L93 Difference]: Finished difference Result 170 states and 172 transitions. [2019-09-05 12:01:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 12:01:37,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2019-09-05 12:01:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:37,463 INFO L225 Difference]: With dead ends: 170 [2019-09-05 12:01:37,463 INFO L226 Difference]: Without dead ends: 112 [2019-09-05 12:01:37,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:01:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-05 12:01:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-05 12:01:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-05 12:01:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-05 12:01:37,470 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2019-09-05 12:01:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:37,470 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-05 12:01:37,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 12:01:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-05 12:01:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-05 12:01:37,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:37,472 INFO L399 BasicCegarLoop]: trace histogram [42, 28, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:37,472 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:37,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash 921522513, now seen corresponding path program 14 times [2019-09-05 12:01:37,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:37,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:37,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:37,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:37,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 825 proven. 210 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 12:01:37,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:37,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:37,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:01:37,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:37,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:37,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:01:37,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 825 proven. 210 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:01:37,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:37,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-05 12:01:37,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 12:01:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 12:01:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:01:37,851 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 26 states. [2019-09-05 12:01:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:37,960 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-09-05 12:01:37,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 12:01:37,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-09-05 12:01:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:37,962 INFO L225 Difference]: With dead ends: 172 [2019-09-05 12:01:37,962 INFO L226 Difference]: Without dead ends: 114 [2019-09-05 12:01:37,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:01:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-05 12:01:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-05 12:01:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-05 12:01:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-09-05 12:01:37,969 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2019-09-05 12:01:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:37,969 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-09-05 12:01:37,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 12:01:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-09-05 12:01:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-05 12:01:37,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:37,971 INFO L399 BasicCegarLoop]: trace histogram [43, 28, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:37,971 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:37,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash 509597774, now seen corresponding path program 15 times [2019-09-05 12:01:37,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:37,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:37,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:37,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:37,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 880 proven. 240 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 12:01:38,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:38,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:38,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:38,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-05 12:01:38,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:38,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 12:01:38,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 880 proven. 240 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 12:01:38,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:38,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-05 12:01:38,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 12:01:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 12:01:38,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:01:38,378 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 27 states. [2019-09-05 12:01:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:38,488 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2019-09-05 12:01:38,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 12:01:38,490 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 113 [2019-09-05 12:01:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:38,491 INFO L225 Difference]: With dead ends: 174 [2019-09-05 12:01:38,491 INFO L226 Difference]: Without dead ends: 116 [2019-09-05 12:01:38,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:01:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-05 12:01:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-09-05 12:01:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-05 12:01:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2019-09-05 12:01:38,497 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 113 [2019-09-05 12:01:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:38,497 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2019-09-05 12:01:38,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 12:01:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2019-09-05 12:01:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-05 12:01:38,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:38,499 INFO L399 BasicCegarLoop]: trace histogram [44, 28, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:38,499 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:38,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:38,499 INFO L82 PathProgramCache]: Analyzing trace with hash -213085173, now seen corresponding path program 16 times [2019-09-05 12:01:38,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:38,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:38,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 935 proven. 272 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 12:01:38,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:38,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:38,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:38,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:38,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:38,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 12:01:38,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 935 proven. 272 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 12:01:38,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:38,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-05 12:01:38,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:01:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:01:38,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:01:38,988 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 28 states. [2019-09-05 12:01:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:39,106 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2019-09-05 12:01:39,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 12:01:39,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 115 [2019-09-05 12:01:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:39,108 INFO L225 Difference]: With dead ends: 176 [2019-09-05 12:01:39,108 INFO L226 Difference]: Without dead ends: 118 [2019-09-05 12:01:39,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:01:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-05 12:01:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-05 12:01:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-05 12:01:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-09-05 12:01:39,114 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 115 [2019-09-05 12:01:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:39,114 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-09-05 12:01:39,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:01:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-09-05 12:01:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-05 12:01:39,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:39,116 INFO L399 BasicCegarLoop]: trace histogram [45, 28, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:39,116 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1073304712, now seen corresponding path program 17 times [2019-09-05 12:01:39,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:39,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:39,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 990 proven. 306 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 12:01:39,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:39,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:39,527 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:01:39,584 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2019-09-05 12:01:39,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:39,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 12:01:39,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 969 proven. 784 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:01:40,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:40,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2019-09-05 12:01:40,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-05 12:01:40,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-05 12:01:40,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:01:40,434 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 58 states. [2019-09-05 12:01:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:40,706 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-09-05 12:01:40,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-05 12:01:40,706 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 117 [2019-09-05 12:01:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:40,707 INFO L225 Difference]: With dead ends: 181 [2019-09-05 12:01:40,708 INFO L226 Difference]: Without dead ends: 123 [2019-09-05 12:01:40,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:01:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-05 12:01:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-05 12:01:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-05 12:01:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-09-05 12:01:40,716 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 117 [2019-09-05 12:01:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:40,716 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-09-05 12:01:40,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-05 12:01:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-09-05 12:01:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-05 12:01:40,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:40,718 INFO L399 BasicCegarLoop]: trace histogram [47, 29, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:40,718 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:40,719 INFO L82 PathProgramCache]: Analyzing trace with hash -709786145, now seen corresponding path program 18 times [2019-09-05 12:01:40,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:40,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:40,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1083 proven. 342 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-05 12:01:41,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:41,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:41,147 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:01:41,211 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2019-09-05 12:01:41,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:41,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 12:01:41,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1062 proven. 841 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-05 12:01:42,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:42,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 60 [2019-09-05 12:01:42,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-05 12:01:42,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-05 12:01:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 12:01:42,149 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 60 states. [2019-09-05 12:01:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:42,418 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-09-05 12:01:42,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-05 12:01:42,418 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 121 [2019-09-05 12:01:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:42,419 INFO L225 Difference]: With dead ends: 187 [2019-09-05 12:01:42,420 INFO L226 Difference]: Without dead ends: 127 [2019-09-05 12:01:42,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 12:01:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-05 12:01:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-09-05 12:01:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-05 12:01:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-09-05 12:01:42,427 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 121 [2019-09-05 12:01:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:42,427 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-09-05 12:01:42,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-05 12:01:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-09-05 12:01:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-05 12:01:42,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:42,428 INFO L399 BasicCegarLoop]: trace histogram [49, 30, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:42,429 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash -934578442, now seen corresponding path program 19 times [2019-09-05 12:01:42,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:42,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:42,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:42,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:42,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1180 proven. 380 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 12:01:42,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:42,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:42,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:42,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 12:01:42,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1180 proven. 380 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 12:01:42,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:42,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-05 12:01:42,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 12:01:42,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 12:01:42,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:01:42,932 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 31 states. [2019-09-05 12:01:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:43,095 INFO L93 Difference]: Finished difference Result 190 states and 192 transitions. [2019-09-05 12:01:43,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 12:01:43,095 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2019-09-05 12:01:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:43,096 INFO L225 Difference]: With dead ends: 190 [2019-09-05 12:01:43,096 INFO L226 Difference]: Without dead ends: 128 [2019-09-05 12:01:43,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:01:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-05 12:01:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-05 12:01:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-05 12:01:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-05 12:01:43,103 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2019-09-05 12:01:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:43,103 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-05 12:01:43,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 12:01:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-05 12:01:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-05 12:01:43,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:43,105 INFO L399 BasicCegarLoop]: trace histogram [50, 30, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:43,105 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:43,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1739816755, now seen corresponding path program 20 times [2019-09-05 12:01:43,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:43,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:43,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:43,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:43,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1239 proven. 420 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 12:01:43,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:43,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:43,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:01:43,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:43,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:43,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 12:01:43,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1239 proven. 420 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 12:01:43,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:43,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-05 12:01:43,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 12:01:43,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 12:01:43,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:01:43,667 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 32 states. [2019-09-05 12:01:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:43,833 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2019-09-05 12:01:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 12:01:43,833 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2019-09-05 12:01:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:43,834 INFO L225 Difference]: With dead ends: 192 [2019-09-05 12:01:43,834 INFO L226 Difference]: Without dead ends: 130 [2019-09-05 12:01:43,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:01:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-05 12:01:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-09-05 12:01:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-05 12:01:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-09-05 12:01:43,840 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 127 [2019-09-05 12:01:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:43,841 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-09-05 12:01:43,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 12:01:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-09-05 12:01:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-05 12:01:43,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:43,842 INFO L399 BasicCegarLoop]: trace histogram [51, 30, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:43,842 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:43,842 INFO L82 PathProgramCache]: Analyzing trace with hash -851809232, now seen corresponding path program 21 times [2019-09-05 12:01:43,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:43,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:43,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1298 proven. 462 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 12:01:44,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:44,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:44,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:44,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-05 12:01:44,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:44,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 12:01:44,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1298 proven. 462 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 12:01:44,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:44,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-05 12:01:44,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 12:01:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 12:01:44,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:01:44,549 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 33 states. [2019-09-05 12:01:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:44,731 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2019-09-05 12:01:44,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 12:01:44,732 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 129 [2019-09-05 12:01:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:44,733 INFO L225 Difference]: With dead ends: 194 [2019-09-05 12:01:44,733 INFO L226 Difference]: Without dead ends: 132 [2019-09-05 12:01:44,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:01:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-05 12:01:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-09-05 12:01:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-05 12:01:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-09-05 12:01:44,741 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2019-09-05 12:01:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:44,741 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-09-05 12:01:44,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 12:01:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-09-05 12:01:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-05 12:01:44,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:44,742 INFO L399 BasicCegarLoop]: trace histogram [52, 30, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:44,742 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash -323351059, now seen corresponding path program 22 times [2019-09-05 12:01:44,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:44,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:44,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1357 proven. 506 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 12:01:45,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:45,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:45,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:45,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:45,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:45,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 12:01:45,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1357 proven. 506 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 12:01:45,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:45,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-05 12:01:45,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:01:45,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:01:45,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:01:45,318 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 34 states. [2019-09-05 12:01:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:45,491 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2019-09-05 12:01:45,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 12:01:45,491 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 131 [2019-09-05 12:01:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:45,493 INFO L225 Difference]: With dead ends: 196 [2019-09-05 12:01:45,493 INFO L226 Difference]: Without dead ends: 134 [2019-09-05 12:01:45,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:01:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-05 12:01:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-09-05 12:01:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-05 12:01:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-09-05 12:01:45,501 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2019-09-05 12:01:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:45,502 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-09-05 12:01:45,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:01:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-09-05 12:01:45,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-05 12:01:45,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:45,504 INFO L399 BasicCegarLoop]: trace histogram [53, 30, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:45,504 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:45,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash 718812266, now seen corresponding path program 23 times [2019-09-05 12:01:45,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:45,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:45,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:45,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1416 proven. 552 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-05 12:01:45,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:45,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:46,007 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:01:46,082 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-05 12:01:46,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:46,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 12:01:46,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1403 proven. 900 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-05 12:01:47,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:47,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 66 [2019-09-05 12:01:47,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-05 12:01:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-05 12:01:47,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 12:01:47,109 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 66 states. [2019-09-05 12:01:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:47,435 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2019-09-05 12:01:47,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-05 12:01:47,435 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 133 [2019-09-05 12:01:47,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:47,437 INFO L225 Difference]: With dead ends: 201 [2019-09-05 12:01:47,437 INFO L226 Difference]: Without dead ends: 139 [2019-09-05 12:01:47,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 12:01:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-05 12:01:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-09-05 12:01:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-05 12:01:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-09-05 12:01:47,446 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 133 [2019-09-05 12:01:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:47,447 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-09-05 12:01:47,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-05 12:01:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-09-05 12:01:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-05 12:01:47,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:47,448 INFO L399 BasicCegarLoop]: trace histogram [55, 31, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:47,448 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:47,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash -223978687, now seen corresponding path program 24 times [2019-09-05 12:01:47,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:47,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:47,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1525 proven. 600 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-05 12:01:48,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:48,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:48,145 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:01:48,249 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-05 12:01:48,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:48,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 12:01:48,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1512 proven. 961 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-05 12:01:49,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:49,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 68 [2019-09-05 12:01:49,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-05 12:01:49,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-05 12:01:49,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 12:01:49,457 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 68 states. [2019-09-05 12:01:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:49,792 INFO L93 Difference]: Finished difference Result 207 states and 210 transitions. [2019-09-05 12:01:49,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-05 12:01:49,792 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 137 [2019-09-05 12:01:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:49,793 INFO L225 Difference]: With dead ends: 207 [2019-09-05 12:01:49,794 INFO L226 Difference]: Without dead ends: 143 [2019-09-05 12:01:49,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 12:01:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-05 12:01:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-05 12:01:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-05 12:01:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-09-05 12:01:49,799 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 137 [2019-09-05 12:01:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:49,799 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-09-05 12:01:49,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-05 12:01:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-09-05 12:01:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-05 12:01:49,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:49,801 INFO L399 BasicCegarLoop]: trace histogram [57, 32, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:49,801 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:49,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1341398568, now seen corresponding path program 25 times [2019-09-05 12:01:49,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:49,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:49,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:49,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:49,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1638 proven. 650 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-05 12:01:50,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:50,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:50,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:50,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 12:01:50,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1638 proven. 650 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:01:50,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:50,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-05 12:01:50,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 12:01:50,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 12:01:50,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:01:50,447 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 37 states. [2019-09-05 12:01:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:50,604 INFO L93 Difference]: Finished difference Result 210 states and 212 transitions. [2019-09-05 12:01:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 12:01:50,604 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 141 [2019-09-05 12:01:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:50,605 INFO L225 Difference]: With dead ends: 210 [2019-09-05 12:01:50,605 INFO L226 Difference]: Without dead ends: 144 [2019-09-05 12:01:50,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:01:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-05 12:01:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-05 12:01:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-05 12:01:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-05 12:01:50,611 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-09-05 12:01:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:50,611 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-05 12:01:50,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 12:01:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-05 12:01:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 12:01:50,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:50,612 INFO L399 BasicCegarLoop]: trace histogram [58, 32, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:50,613 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 115200021, now seen corresponding path program 26 times [2019-09-05 12:01:50,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:50,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:50,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1701 proven. 702 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-05 12:01:51,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:51,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:51,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:01:51,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:51,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:51,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 12:01:51,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1701 proven. 702 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-05 12:01:51,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:51,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-05 12:01:51,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 12:01:51,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 12:01:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:01:51,253 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 38 states. [2019-09-05 12:01:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:51,394 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2019-09-05 12:01:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 12:01:51,395 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2019-09-05 12:01:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:51,396 INFO L225 Difference]: With dead ends: 212 [2019-09-05 12:01:51,396 INFO L226 Difference]: Without dead ends: 146 [2019-09-05 12:01:51,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:01:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-05 12:01:51,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-09-05 12:01:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-05 12:01:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-09-05 12:01:51,404 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 143 [2019-09-05 12:01:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:51,404 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-09-05 12:01:51,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 12:01:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-09-05 12:01:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-05 12:01:51,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:51,405 INFO L399 BasicCegarLoop]: trace histogram [59, 32, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:51,405 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash -252894446, now seen corresponding path program 27 times [2019-09-05 12:01:51,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:51,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:51,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1764 proven. 756 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-05 12:01:51,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:51,959 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:51,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:52,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-09-05 12:01:52,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:52,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 12:01:52,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1764 proven. 756 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-05 12:01:52,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:52,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-05 12:01:52,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 12:01:52,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 12:01:52,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:01:52,097 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 39 states. [2019-09-05 12:01:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:52,279 INFO L93 Difference]: Finished difference Result 214 states and 216 transitions. [2019-09-05 12:01:52,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 12:01:52,280 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 145 [2019-09-05 12:01:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:52,282 INFO L225 Difference]: With dead ends: 214 [2019-09-05 12:01:52,282 INFO L226 Difference]: Without dead ends: 148 [2019-09-05 12:01:52,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:01:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-05 12:01:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-09-05 12:01:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-05 12:01:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-09-05 12:01:52,287 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 145 [2019-09-05 12:01:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:52,287 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-09-05 12:01:52,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 12:01:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-09-05 12:01:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-05 12:01:52,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:52,288 INFO L399 BasicCegarLoop]: trace histogram [60, 32, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:52,288 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1804358961, now seen corresponding path program 28 times [2019-09-05 12:01:52,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:52,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:52,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:52,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1827 proven. 812 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-05 12:01:52,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:52,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:53,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:53,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:53,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:53,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 12:01:53,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1827 proven. 812 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-05 12:01:53,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:53,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-05 12:01:53,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 12:01:53,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 12:01:53,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:01:53,090 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 40 states. [2019-09-05 12:01:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:53,335 INFO L93 Difference]: Finished difference Result 216 states and 218 transitions. [2019-09-05 12:01:53,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 12:01:53,336 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 147 [2019-09-05 12:01:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:53,337 INFO L225 Difference]: With dead ends: 216 [2019-09-05 12:01:53,337 INFO L226 Difference]: Without dead ends: 150 [2019-09-05 12:01:53,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:01:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-05 12:01:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-09-05 12:01:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-05 12:01:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-09-05 12:01:53,343 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2019-09-05 12:01:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:53,343 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-09-05 12:01:53,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 12:01:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-09-05 12:01:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-05 12:01:53,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:53,345 INFO L399 BasicCegarLoop]: trace histogram [61, 32, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:53,345 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:53,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1886861132, now seen corresponding path program 29 times [2019-09-05 12:01:53,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:53,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:53,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:53,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:53,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1890 proven. 870 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-05 12:01:54,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:54,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:54,049 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:54,150 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2019-09-05 12:01:54,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:54,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 12:01:54,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1885 proven. 1024 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-05 12:01:55,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:55,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 35] total 74 [2019-09-05 12:01:55,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-05 12:01:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-05 12:01:55,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 12:01:55,554 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 74 states. [2019-09-05 12:01:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:55,906 INFO L93 Difference]: Finished difference Result 221 states and 224 transitions. [2019-09-05 12:01:55,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-05 12:01:55,906 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 149 [2019-09-05 12:01:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:55,908 INFO L225 Difference]: With dead ends: 221 [2019-09-05 12:01:55,908 INFO L226 Difference]: Without dead ends: 155 [2019-09-05 12:01:55,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 12:01:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-05 12:01:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-05 12:01:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-05 12:01:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-05 12:01:55,915 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 149 [2019-09-05 12:01:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:55,915 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-05 12:01:55,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-05 12:01:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-05 12:01:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-05 12:01:55,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:55,916 INFO L399 BasicCegarLoop]: trace histogram [63, 33, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:55,916 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:55,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:55,917 INFO L82 PathProgramCache]: Analyzing trace with hash 223515555, now seen corresponding path program 30 times [2019-09-05 12:01:55,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:55,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:55,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2015 proven. 930 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-05 12:01:56,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:56,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:01:56,577 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:56,694 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 63 check-sat command(s) [2019-09-05 12:01:56,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:56,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 12:01:56,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2010 proven. 1089 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-05 12:01:58,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:58,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 36] total 76 [2019-09-05 12:01:58,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-05 12:01:58,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-05 12:01:58,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 12:01:58,005 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 76 states. [2019-09-05 12:01:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:58,352 INFO L93 Difference]: Finished difference Result 227 states and 230 transitions. [2019-09-05 12:01:58,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-05 12:01:58,353 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 153 [2019-09-05 12:01:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:58,355 INFO L225 Difference]: With dead ends: 227 [2019-09-05 12:01:58,355 INFO L226 Difference]: Without dead ends: 159 [2019-09-05 12:01:58,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 12:01:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-05 12:01:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-05 12:01:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-05 12:01:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-09-05 12:01:58,361 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 153 [2019-09-05 12:01:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:58,362 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-09-05 12:01:58,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-05 12:01:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-09-05 12:01:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-05 12:01:58,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:58,363 INFO L399 BasicCegarLoop]: trace histogram [65, 34, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:58,363 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:58,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash -39129158, now seen corresponding path program 31 times [2019-09-05 12:01:58,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:58,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:58,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2144 proven. 992 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 12:01:59,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:59,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:59,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:59,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 12:01:59,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2144 proven. 992 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:01:59,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:59,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-05 12:01:59,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 12:01:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 12:01:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:01:59,159 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 43 states. [2019-09-05 12:01:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:59,304 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2019-09-05 12:01:59,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 12:01:59,304 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 157 [2019-09-05 12:01:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:59,306 INFO L225 Difference]: With dead ends: 230 [2019-09-05 12:01:59,306 INFO L226 Difference]: Without dead ends: 160 [2019-09-05 12:01:59,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:01:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-05 12:01:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-05 12:01:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-05 12:01:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-05 12:01:59,312 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 157 [2019-09-05 12:01:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:59,312 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-05 12:01:59,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 12:01:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-05 12:01:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-05 12:01:59,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:59,314 INFO L399 BasicCegarLoop]: trace histogram [66, 34, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:59,314 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:59,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:59,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1218788361, now seen corresponding path program 32 times [2019-09-05 12:01:59,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:59,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:59,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:59,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:59,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 1056 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 12:02:00,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:00,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:02:00,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:00,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:02:00,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:00,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 12:02:00,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 1056 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 12:02:00,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:00,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-05 12:02:00,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 12:02:00,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 12:02:00,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:02:00,455 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 44 states. [2019-09-05 12:02:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:00,632 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2019-09-05 12:02:00,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 12:02:00,632 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 159 [2019-09-05 12:02:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:00,634 INFO L225 Difference]: With dead ends: 232 [2019-09-05 12:02:00,634 INFO L226 Difference]: Without dead ends: 162 [2019-09-05 12:02:00,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:02:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-05 12:02:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-09-05 12:02:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-05 12:02:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-09-05 12:02:00,640 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2019-09-05 12:02:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:00,640 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-09-05 12:02:00,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 12:02:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-09-05 12:02:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-05 12:02:00,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:00,642 INFO L399 BasicCegarLoop]: trace histogram [67, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:00,642 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash -999916300, now seen corresponding path program 33 times [2019-09-05 12:02:00,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:00,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:00,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:00,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:00,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 1122 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 12:02:01,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:01,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:01,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:02:01,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-05 12:02:01,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:01,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 12:02:01,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 1122 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 12:02:01,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:01,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-05 12:02:01,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 12:02:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 12:02:01,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:02:01,575 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 45 states. [2019-09-05 12:02:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:01,761 INFO L93 Difference]: Finished difference Result 234 states and 236 transitions. [2019-09-05 12:02:01,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 12:02:01,762 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 161 [2019-09-05 12:02:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:01,764 INFO L225 Difference]: With dead ends: 234 [2019-09-05 12:02:01,764 INFO L226 Difference]: Without dead ends: 164 [2019-09-05 12:02:01,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:02:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-05 12:02:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-09-05 12:02:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-05 12:02:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2019-09-05 12:02:01,771 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 161 [2019-09-05 12:02:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:01,771 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2019-09-05 12:02:01,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 12:02:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2019-09-05 12:02:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-05 12:02:01,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:01,773 INFO L399 BasicCegarLoop]: trace histogram [68, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:01,773 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1117263183, now seen corresponding path program 34 times [2019-09-05 12:02:01,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:01,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:01,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:01,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:01,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2345 proven. 1190 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 12:02:02,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:02,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:02,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:02:02,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:02:02,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:02,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:02:02,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2345 proven. 1190 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 12:02:02,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:02,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-05 12:02:02,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 12:02:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 12:02:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:02:02,707 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 46 states. [2019-09-05 12:02:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:02,937 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2019-09-05 12:02:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 12:02:02,937 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 163 [2019-09-05 12:02:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:02,938 INFO L225 Difference]: With dead ends: 236 [2019-09-05 12:02:02,938 INFO L226 Difference]: Without dead ends: 166 [2019-09-05 12:02:02,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:02:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-05 12:02:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-09-05 12:02:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-05 12:02:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-09-05 12:02:02,944 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 163 [2019-09-05 12:02:02,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:02,944 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-09-05 12:02:02,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 12:02:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-09-05 12:02:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-05 12:02:02,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:02,946 INFO L399 BasicCegarLoop]: trace histogram [69, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:02,946 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:02,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:02,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2076499246, now seen corresponding path program 35 times [2019-09-05 12:02:02,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:02,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:02,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:02,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:02,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2412 proven. 1260 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 12:02:03,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:03,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:02:03,892 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 70 check-sat command(s) [2019-09-05 12:02:03,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:03,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 12:02:03,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 1156 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-05 12:02:05,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:05,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 37] total 82 [2019-09-05 12:02:05,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-05 12:02:05,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-05 12:02:05,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 12:02:05,402 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 82 states. [2019-09-05 12:02:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:05,798 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-09-05 12:02:05,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-05 12:02:05,799 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 165 [2019-09-05 12:02:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:05,800 INFO L225 Difference]: With dead ends: 241 [2019-09-05 12:02:05,800 INFO L226 Difference]: Without dead ends: 171 [2019-09-05 12:02:05,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 12:02:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-05 12:02:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-05 12:02:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-05 12:02:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-05 12:02:05,805 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 165 [2019-09-05 12:02:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:05,806 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-05 12:02:05,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-05 12:02:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-05 12:02:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-05 12:02:05,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:05,807 INFO L399 BasicCegarLoop]: trace histogram [71, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:05,807 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:05,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:05,808 INFO L82 PathProgramCache]: Analyzing trace with hash 654618373, now seen corresponding path program 36 times [2019-09-05 12:02:05,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:05,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:05,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:05,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:05,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2553 proven. 1332 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-05 12:02:06,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:06,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:06,662 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:02:06,758 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 71 check-sat command(s) [2019-09-05 12:02:06,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:06,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 12:02:06,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 1225 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2019-09-05 12:02:08,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:08,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 38] total 84 [2019-09-05 12:02:08,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-05 12:02:08,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-05 12:02:08,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-05 12:02:08,309 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 84 states. [2019-09-05 12:02:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:08,718 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-09-05 12:02:08,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-05 12:02:08,719 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 169 [2019-09-05 12:02:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:08,720 INFO L225 Difference]: With dead ends: 247 [2019-09-05 12:02:08,720 INFO L226 Difference]: Without dead ends: 175 [2019-09-05 12:02:08,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-05 12:02:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-05 12:02:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-05 12:02:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-05 12:02:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2019-09-05 12:02:08,728 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 169 [2019-09-05 12:02:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:08,728 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2019-09-05 12:02:08,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-05 12:02:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2019-09-05 12:02:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-05 12:02:08,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:08,729 INFO L399 BasicCegarLoop]: trace histogram [73, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:08,730 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash 819404956, now seen corresponding path program 37 times [2019-09-05 12:02:08,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:08,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:08,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2698 proven. 1406 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-05 12:02:10,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:10,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:02:10,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:10,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 12:02:10,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2698 proven. 1406 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-05 12:02:10,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:10,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-05 12:02:10,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 12:02:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 12:02:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:02:10,268 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 49 states. [2019-09-05 12:02:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:10,471 INFO L93 Difference]: Finished difference Result 250 states and 252 transitions. [2019-09-05 12:02:10,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 12:02:10,471 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 173 [2019-09-05 12:02:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:10,473 INFO L225 Difference]: With dead ends: 250 [2019-09-05 12:02:10,473 INFO L226 Difference]: Without dead ends: 176 [2019-09-05 12:02:10,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:02:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-05 12:02:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-09-05 12:02:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-05 12:02:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-05 12:02:10,479 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 173 [2019-09-05 12:02:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:10,479 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-05 12:02:10,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 12:02:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-05 12:02:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-05 12:02:10,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:10,481 INFO L399 BasicCegarLoop]: trace histogram [74, 38, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:10,481 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1864836391, now seen corresponding path program 38 times [2019-09-05 12:02:10,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:10,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:10,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2769 proven. 1482 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-05 12:02:11,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:11,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:11,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:02:11,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:02:11,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:11,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 12:02:11,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2769 proven. 1482 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-05 12:02:11,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:11,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-05 12:02:11,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 12:02:11,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 12:02:11,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:02:11,597 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 50 states. [2019-09-05 12:02:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:11,837 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2019-09-05 12:02:11,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-05 12:02:11,837 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 175 [2019-09-05 12:02:11,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:11,839 INFO L225 Difference]: With dead ends: 252 [2019-09-05 12:02:11,839 INFO L226 Difference]: Without dead ends: 178 [2019-09-05 12:02:11,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:02:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-05 12:02:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-09-05 12:02:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-05 12:02:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-05 12:02:11,844 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 175 [2019-09-05 12:02:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:11,844 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-05 12:02:11,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 12:02:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-05 12:02:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-05 12:02:11,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:11,846 INFO L399 BasicCegarLoop]: trace histogram [75, 39, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:11,846 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash -145425962, now seen corresponding path program 39 times [2019-09-05 12:02:11,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:11,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:11,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:11,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:11,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2840 proven. 1560 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-05 12:02:12,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:12,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:12,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:02:12,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-09-05 12:02:12,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:12,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 12:02:12,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2847 proven. 1296 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-09-05 12:02:14,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:14,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 39] total 88 [2019-09-05 12:02:14,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-05 12:02:14,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-05 12:02:14,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:02:14,670 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 88 states. [2019-09-05 12:02:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:15,165 INFO L93 Difference]: Finished difference Result 257 states and 260 transitions. [2019-09-05 12:02:15,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-05 12:02:15,166 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 177 [2019-09-05 12:02:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:15,167 INFO L225 Difference]: With dead ends: 257 [2019-09-05 12:02:15,167 INFO L226 Difference]: Without dead ends: 183 [2019-09-05 12:02:15,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:02:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-05 12:02:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-05 12:02:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-05 12:02:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-09-05 12:02:15,172 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 177 [2019-09-05 12:02:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:15,173 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2019-09-05 12:02:15,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-05 12:02:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2019-09-05 12:02:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-05 12:02:15,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:15,174 INFO L399 BasicCegarLoop]: trace histogram [77, 40, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:15,174 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:15,175 INFO L82 PathProgramCache]: Analyzing trace with hash -223007187, now seen corresponding path program 40 times [2019-09-05 12:02:15,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:15,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:15,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:15,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:15,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2993 proven. 1640 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-05 12:02:16,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:16,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:16,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:02:16,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:02:16,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:16,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 12:02:16,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2993 proven. 1640 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:02:16,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:16,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-05 12:02:16,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 12:02:16,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 12:02:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:02:16,573 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 52 states. [2019-09-05 12:02:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:16,811 INFO L93 Difference]: Finished difference Result 260 states and 262 transitions. [2019-09-05 12:02:16,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 12:02:16,811 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 181 [2019-09-05 12:02:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:16,812 INFO L225 Difference]: With dead ends: 260 [2019-09-05 12:02:16,813 INFO L226 Difference]: Without dead ends: 184 [2019-09-05 12:02:16,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:02:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-05 12:02:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-05 12:02:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-05 12:02:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-05 12:02:16,818 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 181 [2019-09-05 12:02:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:16,819 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-05 12:02:16,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 12:02:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-05 12:02:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-05 12:02:16,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:16,820 INFO L399 BasicCegarLoop]: trace histogram [78, 41, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:16,820 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash -827630742, now seen corresponding path program 41 times [2019-09-05 12:02:16,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:16,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:16,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:16,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:16,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:19,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:19,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:19,681 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:02:19,782 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2019-09-05 12:02:19,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:19,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 12:02:19,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3080 proven. 1444 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-05 12:02:19,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:19,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 41] total 91 [2019-09-05 12:02:19,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-05 12:02:19,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-05 12:02:19,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 12:02:19,884 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 91 states. [2019-09-05 12:02:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:20,350 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2019-09-05 12:02:20,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-05 12:02:20,351 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 183 [2019-09-05 12:02:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:20,352 INFO L225 Difference]: With dead ends: 192 [2019-09-05 12:02:20,353 INFO L226 Difference]: Without dead ends: 189 [2019-09-05 12:02:20,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 12:02:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-05 12:02:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-05 12:02:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-05 12:02:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2019-09-05 12:02:20,359 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 183 [2019-09-05 12:02:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:20,360 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2019-09-05 12:02:20,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-05 12:02:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2019-09-05 12:02:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-05 12:02:20,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:20,361 INFO L399 BasicCegarLoop]: trace histogram [80, 41, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:20,361 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:20,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:20,362 INFO L82 PathProgramCache]: Analyzing trace with hash -652436834, now seen corresponding path program 42 times [2019-09-05 12:02:20,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:20,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:20,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:20,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:20,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:23,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:23,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:23,854 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:02:23,965 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 80 check-sat command(s) [2019-09-05 12:02:23,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:23,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 12:02:23,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:02:24,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:24,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 42] total 92 [2019-09-05 12:02:24,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-05 12:02:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-05 12:02:24,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-05 12:02:24,007 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 92 states. [2019-09-05 12:02:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:24,488 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2019-09-05 12:02:24,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-05 12:02:24,489 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-09-05 12:02:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:24,490 INFO L225 Difference]: With dead ends: 194 [2019-09-05 12:02:24,490 INFO L226 Difference]: Without dead ends: 191 [2019-09-05 12:02:24,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-05 12:02:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-05 12:02:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-05 12:02:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-05 12:02:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-09-05 12:02:24,496 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 187 [2019-09-05 12:02:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:24,496 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-09-05 12:02:24,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-05 12:02:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-09-05 12:02:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-05 12:02:24,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:24,498 INFO L399 BasicCegarLoop]: trace histogram [81, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:24,498 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash 65889400, now seen corresponding path program 43 times [2019-09-05 12:02:24,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:24,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:24,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:27,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:27,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:27,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:27,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-05 12:02:27,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:28,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:28,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-05 12:02:28,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-05 12:02:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-05 12:02:28,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:02:28,032 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 93 states. [2019-09-05 12:02:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:28,507 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2019-09-05 12:02:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 12:02:28,508 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-09-05 12:02:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:28,510 INFO L225 Difference]: With dead ends: 196 [2019-09-05 12:02:28,511 INFO L226 Difference]: Without dead ends: 193 [2019-09-05 12:02:28,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:02:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-05 12:02:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-05 12:02:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-05 12:02:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-05 12:02:28,517 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2019-09-05 12:02:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:28,517 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-05 12:02:28,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-05 12:02:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-05 12:02:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-05 12:02:28,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:28,519 INFO L399 BasicCegarLoop]: trace histogram [82, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:28,519 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:28,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:28,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1112334382, now seen corresponding path program 44 times [2019-09-05 12:02:28,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:28,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:28,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:28,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:28,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:31,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:31,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:31,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:02:31,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:02:31,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:31,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-05 12:02:31,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:02:31,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:31,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-05 12:02:31,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-05 12:02:31,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-05 12:02:31,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-05 12:02:31,988 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 94 states. [2019-09-05 12:02:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:32,451 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2019-09-05 12:02:32,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-05 12:02:32,452 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-09-05 12:02:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:32,454 INFO L225 Difference]: With dead ends: 198 [2019-09-05 12:02:32,454 INFO L226 Difference]: Without dead ends: 195 [2019-09-05 12:02:32,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-05 12:02:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-05 12:02:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-05 12:02:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-05 12:02:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-09-05 12:02:32,458 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 191 [2019-09-05 12:02:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:32,459 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-09-05 12:02:32,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-05 12:02:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-09-05 12:02:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-05 12:02:32,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:32,460 INFO L399 BasicCegarLoop]: trace histogram [83, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:32,460 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:32,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 485977260, now seen corresponding path program 45 times [2019-09-05 12:02:32,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:32,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:35,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:35,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:35,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:02:35,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-05 12:02:35,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:35,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-05 12:02:35,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:02:35,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:35,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-05 12:02:35,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-05 12:02:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-05 12:02:35,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-05 12:02:35,745 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 95 states. [2019-09-05 12:02:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:36,470 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2019-09-05 12:02:36,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-05 12:02:36,470 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-09-05 12:02:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:36,471 INFO L225 Difference]: With dead ends: 200 [2019-09-05 12:02:36,471 INFO L226 Difference]: Without dead ends: 197 [2019-09-05 12:02:36,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-05 12:02:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-05 12:02:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-05 12:02:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-05 12:02:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2019-09-05 12:02:36,477 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 193 [2019-09-05 12:02:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:36,478 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2019-09-05 12:02:36,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-05 12:02:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2019-09-05 12:02:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-05 12:02:36,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:36,479 INFO L399 BasicCegarLoop]: trace histogram [84, 43, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:36,479 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1134826746, now seen corresponding path program 46 times [2019-09-05 12:02:36,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:36,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:36,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:36,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:36,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:39,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:39,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:39,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:02:39,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:02:39,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:39,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 12:02:39,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:39,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:39,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-05 12:02:39,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-05 12:02:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-05 12:02:39,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 12:02:39,685 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 96 states. [2019-09-05 12:02:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:40,237 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2019-09-05 12:02:40,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-05 12:02:40,237 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-09-05 12:02:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:40,239 INFO L225 Difference]: With dead ends: 202 [2019-09-05 12:02:40,239 INFO L226 Difference]: Without dead ends: 199 [2019-09-05 12:02:40,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 12:02:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-05 12:02:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-05 12:02:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-05 12:02:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2019-09-05 12:02:40,247 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2019-09-05 12:02:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:40,247 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2019-09-05 12:02:40,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-05 12:02:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2019-09-05 12:02:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-05 12:02:40,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:40,249 INFO L399 BasicCegarLoop]: trace histogram [85, 44, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:40,249 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:40,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:40,249 INFO L82 PathProgramCache]: Analyzing trace with hash 345651936, now seen corresponding path program 47 times [2019-09-05 12:02:40,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:40,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:40,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:40,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:40,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:43,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:43,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:02:43,433 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:43,551 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 86 check-sat command(s) [2019-09-05 12:02:43,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:43,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 12:02:43,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1936 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-05 12:02:43,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:43,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 47] total 97 [2019-09-05 12:02:43,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-05 12:02:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-05 12:02:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 12:02:43,609 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 97 states. [2019-09-05 12:02:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:44,158 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2019-09-05 12:02:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-05 12:02:44,158 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-09-05 12:02:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:44,160 INFO L225 Difference]: With dead ends: 204 [2019-09-05 12:02:44,160 INFO L226 Difference]: Without dead ends: 201 [2019-09-05 12:02:44,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 12:02:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-05 12:02:44,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-05 12:02:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-05 12:02:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-05 12:02:44,168 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 197 [2019-09-05 12:02:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:44,168 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-05 12:02:44,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-05 12:02:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-05 12:02:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-05 12:02:44,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:44,170 INFO L399 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:44,170 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1451490362, now seen corresponding path program 48 times [2019-09-05 12:02:44,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:44,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:44,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:44,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:44,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:47,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:47,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:02:47,497 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2019-09-05 12:02:47,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:47,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-05 12:02:47,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:47,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:47,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-05 12:02:47,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-05 12:02:47,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-05 12:02:47,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-05 12:02:47,543 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 98 states. [2019-09-05 12:02:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:48,103 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2019-09-05 12:02:48,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-05 12:02:48,103 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-09-05 12:02:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:48,104 INFO L225 Difference]: With dead ends: 206 [2019-09-05 12:02:48,104 INFO L226 Difference]: Without dead ends: 203 [2019-09-05 12:02:48,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-05 12:02:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-05 12:02:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-05 12:02:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-05 12:02:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-09-05 12:02:48,110 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 199 [2019-09-05 12:02:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:48,111 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-09-05 12:02:48,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-05 12:02:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-09-05 12:02:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-05 12:02:48,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:48,112 INFO L399 BasicCegarLoop]: trace histogram [87, 46, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:48,112 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash -989671660, now seen corresponding path program 49 times [2019-09-05 12:02:48,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:48,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:48,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:48,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:53,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:53,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:53,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:53,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-05 12:02:53,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:02:53,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:53,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-05 12:02:53,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-05 12:02:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-05 12:02:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-05 12:02:53,138 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 99 states. [2019-09-05 12:02:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:53,746 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2019-09-05 12:02:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-05 12:02:53,746 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-09-05 12:02:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:53,747 INFO L225 Difference]: With dead ends: 208 [2019-09-05 12:02:53,747 INFO L226 Difference]: Without dead ends: 205 [2019-09-05 12:02:53,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-05 12:02:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-05 12:02:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-05 12:02:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-05 12:02:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2019-09-05 12:02:53,751 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2019-09-05 12:02:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:53,752 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2019-09-05 12:02:53,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-05 12:02:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2019-09-05 12:02:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-05 12:02:53,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:53,753 INFO L399 BasicCegarLoop]: trace histogram [88, 47, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:53,753 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:53,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1894231186, now seen corresponding path program 50 times [2019-09-05 12:02:53,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:53,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:53,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:53,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:53,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:57,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:57,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:57,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:02:57,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:02:57,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:57,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-05 12:02:57,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:57,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:57,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-05 12:02:57,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-05 12:02:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-05 12:02:57,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-05 12:02:57,814 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 100 states. [2019-09-05 12:02:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:58,307 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2019-09-05 12:02:58,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-05 12:02:58,308 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-09-05 12:02:58,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:58,309 INFO L225 Difference]: With dead ends: 210 [2019-09-05 12:02:58,309 INFO L226 Difference]: Without dead ends: 207 [2019-09-05 12:02:58,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-05 12:02:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-05 12:02:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-05 12:02:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-05 12:02:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-09-05 12:02:58,315 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 203 [2019-09-05 12:02:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:58,316 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-09-05 12:02:58,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-05 12:02:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-09-05 12:02:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-05 12:02:58,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:58,318 INFO L399 BasicCegarLoop]: trace histogram [89, 48, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:58,318 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash 702425416, now seen corresponding path program 51 times [2019-09-05 12:02:58,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:58,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:58,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:01,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:01,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:01,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:03:01,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-09-05 12:03:01,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:01,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-05 12:03:01,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:01,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:01,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-05 12:03:01,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-05 12:03:01,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-05 12:03:01,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:03:01,947 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 101 states. [2019-09-05 12:03:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:02,574 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-09-05 12:03:02,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-05 12:03:02,575 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-09-05 12:03:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:02,576 INFO L225 Difference]: With dead ends: 212 [2019-09-05 12:03:02,576 INFO L226 Difference]: Without dead ends: 209 [2019-09-05 12:03:02,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:03:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-05 12:03:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-09-05 12:03:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-05 12:03:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-05 12:03:02,580 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2019-09-05 12:03:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:02,580 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-05 12:03:02,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-05 12:03:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-05 12:03:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-05 12:03:02,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:02,582 INFO L399 BasicCegarLoop]: trace histogram [90, 49, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:02,582 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash 713420962, now seen corresponding path program 52 times [2019-09-05 12:03:02,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:02,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:02,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:02,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:02,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:06,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:06,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:06,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:03:06,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:06,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:06,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-05 12:03:06,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:06,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:06,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-05 12:03:06,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-05 12:03:06,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-05 12:03:06,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 12:03:06,197 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 102 states. [2019-09-05 12:03:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:06,711 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2019-09-05 12:03:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-05 12:03:06,712 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-09-05 12:03:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:06,713 INFO L225 Difference]: With dead ends: 213 [2019-09-05 12:03:06,713 INFO L226 Difference]: Without dead ends: 210 [2019-09-05 12:03:06,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 12:03:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-05 12:03:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-05 12:03:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-05 12:03:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-05 12:03:06,719 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2019-09-05 12:03:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:06,720 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-05 12:03:06,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-05 12:03:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-05 12:03:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-05 12:03:06,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:06,721 INFO L399 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:06,721 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 53 times [2019-09-05 12:03:06,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:06,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:06,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:06,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:06,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-05 12:03:08,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:08,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:08,477 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:03:08,610 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 92 check-sat command(s) [2019-09-05 12:03:08,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:08,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-05 12:03:08,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:08,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-05 12:03:08,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:08,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-05 12:03:08,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 12:03:08,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 12:03:08,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:03:08,788 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 55 states. [2019-09-05 12:03:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:10,470 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2019-09-05 12:03:10,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 12:03:10,471 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-05 12:03:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:10,473 INFO L225 Difference]: With dead ends: 216 [2019-09-05 12:03:10,473 INFO L226 Difference]: Without dead ends: 213 [2019-09-05 12:03:10,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:03:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-05 12:03:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-05 12:03:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-05 12:03:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-09-05 12:03:10,481 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-09-05 12:03:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:10,482 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-09-05 12:03:10,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 12:03:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-09-05 12:03:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-05 12:03:10,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:10,483 INFO L399 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:10,483 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:10,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:10,484 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 54 times [2019-09-05 12:03:10,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:10,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:10,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:10,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:10,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-05 12:03:11,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:03:11,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-05 12:03:11,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 12:03:11,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 12:03:11,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:03:11,793 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2019-09-05 12:03:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:12,005 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-09-05 12:03:12,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 12:03:12,006 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-09-05 12:03:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:12,006 INFO L225 Difference]: With dead ends: 212 [2019-09-05 12:03:12,007 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 12:03:12,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:03:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 12:03:12,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 12:03:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 12:03:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 12:03:12,008 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-05 12:03:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:12,008 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 12:03:12,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 12:03:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 12:03:12,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 12:03:12,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 12:03:13,464 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-09-05 12:03:13,478 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-05 12:03:13,479 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-05 12:03:13,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 12:03:13,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 12:03:13,479 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 12:03:13,479 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 12:03:13,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 12:03:13,479 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-09-05 12:03:13,480 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 98) no Hoare annotation was computed. [2019-09-05 12:03:13,480 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 209) no Hoare annotation was computed. [2019-09-05 12:03:13,480 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 119) no Hoare annotation was computed. [2019-09-05 12:03:13,480 INFO L439 ceAbstractionStarter]: At program point L118(lines 56 119) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 8) (<= 50 main_~main__y~0)) [2019-09-05 12:03:13,480 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 143) no Hoare annotation was computed. [2019-09-05 12:03:13,482 INFO L439 ceAbstractionStarter]: At program point L106(lines 62 107) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= main_~main__x~0 91) (<= 91 main_~main__x~0) (<= main_~main__y~0 91) (<= 91 main_~main__y~0)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__y~0 74) (<= 74 main_~main__y~0) (<= main_~main__x~0 74) (<= 74 main_~main__x~0)) (and (<= 75 main_~main__y~0) (<= main_~main__x~0 75) (<= 75 main_~main__x~0) (<= main_~main__y~0 75)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 72 main_~main__x~0) (<= main_~main__y~0 72) (<= 72 main_~main__y~0) (<= main_~main__x~0 72)) (and (<= main_~main__x~0 82) (<= 82 main_~main__x~0) (<= main_~main__y~0 82) (<= 82 main_~main__y~0)) (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) (<= main_~main__x~0 89) (<= 89 main_~main__x~0)) (and (<= main_~main__y~0 90) (<= 90 main_~main__y~0) (<= 90 main_~main__x~0) (<= main_~main__x~0 90)) (and (<= 87 main_~main__x~0) (<= main_~main__y~0 87) (<= main_~main__x~0 87) (<= 87 main_~main__y~0)) (and (<= main_~main__x~0 78) (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0)) (and (<= main_~main__x~0 95) (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (<= 95 main_~main__y~0)) (and (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (<= main_~main__x~0 77) (<= 77 main_~main__x~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0)) (and (<= 76 main_~main__x~0) (<= main_~main__x~0 76) (<= main_~main__y~0 76) (<= 76 main_~main__y~0)) (and (<= main_~main__y~0 100) (<= 100 main_~main__x~0) (<= 100 main_~main__y~0)) (and (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (<= main_~main__x~0 79) (<= main_~main__y~0 79)) (and (<= main_~main__x~0 80) (<= main_~main__y~0 80) (<= 80 main_~main__x~0) (<= 80 main_~main__y~0)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 73) (<= 73 main_~main__x~0) (<= main_~main__y~0 73) (<= 73 main_~main__y~0)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__x~0 93) (<= main_~main__y~0 93) (<= 93 main_~main__y~0) (<= 93 main_~main__x~0)) (and (<= main_~main__y~0 97) (<= 97 main_~main__x~0) (<= 97 main_~main__y~0) (<= main_~main__x~0 97)) (and (<= main_~main__x~0 94) (<= 94 main_~main__x~0) (<= main_~main__y~0 94) (<= 94 main_~main__y~0)) (and (<= 70 main_~main__x~0) (<= main_~main__y~0 70) (<= main_~main__x~0 70) (<= 70 main_~main__y~0)) (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) (and (<= main_~main__y~0 84) (<= 84 main_~main__y~0) (<= 84 main_~main__x~0) (<= main_~main__x~0 84)) (and (<= main_~main__x~0 66) (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (<= 66 main_~main__x~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__x~0 69) (<= main_~main__y~0 69) (<= 69 main_~main__y~0) (<= 69 main_~main__x~0)) (and (<= main_~main__y~0 71) (<= 71 main_~main__y~0) (<= 71 main_~main__x~0) (<= main_~main__x~0 71)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= main_~main__y~0 68) (<= 68 main_~main__x~0) (<= main_~main__x~0 68) (<= 68 main_~main__y~0)) (and (<= main_~main__x~0 99) (<= 99 main_~main__x~0) (<= main_~main__y~0 99) (<= 99 main_~main__y~0)) (and (<= main_~main__x~0 81) (<= main_~main__y~0 81) (<= 81 main_~main__x~0) (<= 81 main_~main__y~0)) (and (<= main_~main__x~0 96) (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= 96 main_~main__x~0)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= main_~main__x~0 98) (<= 98 main_~main__x~0)) (and (<= 86 main_~main__x~0) (<= main_~main__x~0 86) (<= main_~main__y~0 86) (<= 86 main_~main__y~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= 85 main_~main__y~0) (<= main_~main__x~0 85) (<= 85 main_~main__x~0) (<= main_~main__y~0 85)) (and (<= main_~main__x~0 92) (<= 92 main_~main__x~0) (<= main_~main__y~0 92) (<= 92 main_~main__y~0)) (and (<= main_~main__x~0 67) (<= 67 main_~main__x~0) (<= main_~main__y~0 67) (<= 67 main_~main__y~0)) (and (<= main_~main__x~0 88) (<= 88 main_~main__x~0) (<= main_~main__y~0 88) (<= 88 main_~main__y~0)) (and (<= main_~main__y~0 83) (<= main_~main__x~0 83) (<= 83 main_~main__x~0) (<= 83 main_~main__y~0))) [2019-09-05 12:03:13,482 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 80) no Hoare annotation was computed. [2019-09-05 12:03:13,482 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 167) no Hoare annotation was computed. [2019-09-05 12:03:13,482 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 191) no Hoare annotation was computed. [2019-09-05 12:03:13,482 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 208) no Hoare annotation was computed. [2019-09-05 12:03:13,483 INFO L439 ceAbstractionStarter]: At program point L202(lines 14 203) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 1)) [2019-09-05 12:03:13,483 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 107) no Hoare annotation was computed. [2019-09-05 12:03:13,483 INFO L439 ceAbstractionStarter]: At program point L190(lines 20 191) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2)) [2019-09-05 12:03:13,483 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-05 12:03:13,483 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 131) no Hoare annotation was computed. [2019-09-05 12:03:13,483 INFO L439 ceAbstractionStarter]: At program point L178(lines 26 179) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 3)) [2019-09-05 12:03:13,483 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 209) no Hoare annotation was computed. [2019-09-05 12:03:13,483 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 155) no Hoare annotation was computed. [2019-09-05 12:03:13,484 INFO L439 ceAbstractionStarter]: At program point L166(lines 32 167) the Hoare annotation is: (and (<= main_~main__x~0 4) (<= main_~main__y~0 50) (<= 50 main_~main__y~0)) [2019-09-05 12:03:13,484 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 209) the Hoare annotation is: true [2019-09-05 12:03:13,484 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 179) no Hoare annotation was computed. [2019-09-05 12:03:13,484 INFO L439 ceAbstractionStarter]: At program point L154(lines 38 155) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 5) (<= 50 main_~main__y~0)) [2019-09-05 12:03:13,484 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 203) no Hoare annotation was computed. [2019-09-05 12:03:13,484 INFO L439 ceAbstractionStarter]: At program point L142(lines 44 143) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 6)) [2019-09-05 12:03:13,484 INFO L439 ceAbstractionStarter]: At program point L130(lines 50 131) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 7) (<= 50 main_~main__y~0)) [2019-09-05 12:03:13,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:03:13 BoogieIcfgContainer [2019-09-05 12:03:13,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 12:03:13,531 INFO L168 Benchmark]: Toolchain (without parser) took 107697.56 ms. Allocated memory was 134.7 MB in the beginning and 781.7 MB in the end (delta: 647.0 MB). Free memory was 91.0 MB in the beginning and 75.2 MB in the end (delta: 15.7 MB). Peak memory consumption was 662.7 MB. Max. memory is 7.1 GB. [2019-09-05 12:03:13,532 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-05 12:03:13,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.99 ms. Allocated memory was 134.7 MB in the beginning and 200.3 MB in the end (delta: 65.5 MB). Free memory was 90.8 MB in the beginning and 177.0 MB in the end (delta: -86.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-09-05 12:03:13,537 INFO L168 Benchmark]: Boogie Preprocessor took 37.38 ms. Allocated memory is still 200.3 MB. Free memory was 177.0 MB in the beginning and 175.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-09-05 12:03:13,538 INFO L168 Benchmark]: RCFGBuilder took 352.59 ms. Allocated memory is still 200.3 MB. Free memory was 175.8 MB in the beginning and 159.9 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-09-05 12:03:13,539 INFO L168 Benchmark]: TraceAbstraction took 106889.61 ms. Allocated memory was 200.3 MB in the beginning and 781.7 MB in the end (delta: 581.4 MB). Free memory was 159.3 MB in the beginning and 75.2 MB in the end (delta: 84.0 MB). Peak memory consumption was 665.5 MB. Max. memory is 7.1 GB. [2019-09-05 12:03:13,545 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.46 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 406.99 ms. Allocated memory was 134.7 MB in the beginning and 200.3 MB in the end (delta: 65.5 MB). Free memory was 90.8 MB in the beginning and 177.0 MB in the end (delta: -86.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.38 ms. Allocated memory is still 200.3 MB. Free memory was 177.0 MB in the beginning and 175.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 352.59 ms. Allocated memory is still 200.3 MB. Free memory was 175.8 MB in the beginning and 159.9 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106889.61 ms. Allocated memory was 200.3 MB in the beginning and 781.7 MB in the end (delta: 581.4 MB). Free memory was 159.3 MB in the beginning and 75.2 MB in the end (delta: 84.0 MB). Peak memory consumption was 665.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 8) && 50 <= main__y - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 7) && 50 <= main__y - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 2 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 5) && 50 <= main__y - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((main__x <= 91 && 91 <= main__x) && main__y <= 91) && 91 <= main__y)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__y <= 74 && 74 <= main__y) && main__x <= 74) && 74 <= main__x)) || (((75 <= main__y && main__x <= 75) && 75 <= main__x) && main__y <= 75)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((72 <= main__x && main__y <= 72) && 72 <= main__y) && main__x <= 72)) || (((main__x <= 82 && 82 <= main__x) && main__y <= 82) && 82 <= main__y)) || (((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((89 <= main__y && main__y <= 89) && main__x <= 89) && 89 <= main__x)) || (((main__y <= 90 && 90 <= main__y) && 90 <= main__x) && main__x <= 90)) || (((87 <= main__x && main__y <= 87) && main__x <= 87) && 87 <= main__y)) || (((main__x <= 78 && main__y <= 78) && 78 <= main__x) && 78 <= main__y)) || (((main__x <= 95 && main__y <= 95) && 95 <= main__x) && 95 <= main__y)) || (((main__y <= 77 && 77 <= main__y) && main__x <= 77) && 77 <= main__x)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y)) || (((76 <= main__x && main__x <= 76) && main__y <= 76) && 76 <= main__y)) || ((main__y <= 100 && 100 <= main__x) && 100 <= main__y)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__x <= 80 && main__y <= 80) && 80 <= main__x) && 80 <= main__y)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 73 && 73 <= main__x) && main__y <= 73) && 73 <= main__y)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((main__x <= 93 && main__y <= 93) && 93 <= main__y) && 93 <= main__x)) || (((main__y <= 97 && 97 <= main__x) && 97 <= main__y) && main__x <= 97)) || (((main__x <= 94 && 94 <= main__x) && main__y <= 94) && 94 <= main__y)) || (((70 <= main__x && main__y <= 70) && main__x <= 70) && 70 <= main__y)) || (((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__x <= 69 && main__y <= 69) && 69 <= main__y) && 69 <= main__x)) || (((main__y <= 71 && 71 <= main__y) && 71 <= main__x) && main__x <= 71)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((main__y <= 68 && 68 <= main__x) && main__x <= 68) && 68 <= main__y)) || (((main__x <= 99 && 99 <= main__x) && main__y <= 99) && 99 <= main__y)) || (((main__x <= 81 && main__y <= 81) && 81 <= main__x) && 81 <= main__y)) || (((main__x <= 96 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__y <= 98 && 98 <= main__y) && main__x <= 98) && 98 <= main__x)) || (((86 <= main__x && main__x <= 86) && main__y <= 86) && 86 <= main__y)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((85 <= main__y && main__x <= 85) && 85 <= main__x) && main__y <= 85)) || (((main__x <= 92 && 92 <= main__x) && main__y <= 92) && 92 <= main__y)) || (((main__x <= 67 && 67 <= main__x) && main__y <= 67) && 67 <= main__y)) || (((main__x <= 88 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 83 && main__x <= 83) && 83 <= main__x) && 83 <= main__y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. SAFE Result, 106.7s OverallTime, 61 OverallIterations, 92 TraceHistogramMax, 17.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 2667 SDslu, 14936 SDs, 0 SdLazy, 16833 SolverSat, 2491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9839 GetRequests, 6951 SyntacticMatches, 1 SemanticMatches, 2887 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 61 MinimizatonAttempts, 27 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 113 NumberOfFragments, 742 HoareAnnotationTreeSize, 13 FomulaSimplifications, 533 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 171 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 79.8s InterpolantComputationTime, 14956 NumberOfCodeBlocks, 14894 NumberOfCodeBlocksAsserted, 1566 NumberOfCheckSat, 14842 ConstructedInterpolants, 0 QuantifiedInterpolants, 5778028 SizeOfPredicates, 30 NumberOfNonLiveVariables, 18374 ConjunctsInSsa, 2325 ConjunctsInUnsatCore, 114 InterpolantComputations, 8 PerfectInterpolantSequences, 185406/403759 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...