java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label58_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:47:45,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:47:45,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:47:45,688 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:47:45,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:47:45,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:47:45,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:47:45,694 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:47:45,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:47:45,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:47:45,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:47:45,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:47:45,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:47:45,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:47:45,701 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:47:45,701 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:47:45,702 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:47:45,704 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:47:45,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:47:45,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:47:45,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:47:45,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:47:45,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:47:45,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:47:45,713 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:47:45,714 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:47:45,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:47:45,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:47:45,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:47:45,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:47:45,718 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:47:45,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:47:45,719 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:47:45,719 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:47:45,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:47:45,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:47:45,721 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:47:45,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:47:45,745 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:47:45,746 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:47:45,746 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:47:45,747 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:47:45,747 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:47:45,747 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:47:45,747 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:47:45,748 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:47:45,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:47:45,749 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:47:45,749 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:47:45,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:47:45,749 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:47:45,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:47:45,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:47:45,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:47:45,750 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:47:45,750 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:47:45,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:47:45,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:47:45,751 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:47:45,751 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:47:45,752 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:47:45,752 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:47:45,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:47:45,752 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:47:45,752 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:47:45,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:47:45,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:47:45,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:47:45,836 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:47:45,837 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:47:45,837 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label58_true-unreach-call.c [2018-11-06 21:47:45,898 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e440c979a/ce861dcc13b640a5986cd9f1f9581932/FLAG525962a9e [2018-11-06 21:47:46,569 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:47:46,570 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label58_true-unreach-call.c [2018-11-06 21:47:46,596 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e440c979a/ce861dcc13b640a5986cd9f1f9581932/FLAG525962a9e [2018-11-06 21:47:46,615 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e440c979a/ce861dcc13b640a5986cd9f1f9581932 [2018-11-06 21:47:46,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:47:46,626 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:47:46,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:47:46,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:47:46,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:47:46,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:47:46" (1/1) ... [2018-11-06 21:47:46,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1109e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:46, skipping insertion in model container [2018-11-06 21:47:46,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:47:46" (1/1) ... [2018-11-06 21:47:46,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:47:46,757 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:47:47,731 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:47:47,739 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:47:48,194 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:47:48,217 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:47:48,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48 WrapperNode [2018-11-06 21:47:48,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:47:48,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:47:48,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:47:48,219 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:47:48,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (1/1) ... [2018-11-06 21:47:48,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (1/1) ... [2018-11-06 21:47:48,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:47:48,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:47:48,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:47:48,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:47:48,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (1/1) ... [2018-11-06 21:47:48,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (1/1) ... [2018-11-06 21:47:48,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (1/1) ... [2018-11-06 21:47:48,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (1/1) ... [2018-11-06 21:47:48,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (1/1) ... [2018-11-06 21:47:48,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (1/1) ... [2018-11-06 21:47:48,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (1/1) ... [2018-11-06 21:47:49,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:47:49,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:47:49,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:47:49,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:47:49,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (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 [2018-11-06 21:47:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:47:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:47:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:47:56,926 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:47:56,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:47:56 BoogieIcfgContainer [2018-11-06 21:47:56,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:47:56,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:47:56,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:47:56,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:47:56,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:47:46" (1/3) ... [2018-11-06 21:47:56,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7443f187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:47:56, skipping insertion in model container [2018-11-06 21:47:56,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:48" (2/3) ... [2018-11-06 21:47:56,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7443f187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:47:56, skipping insertion in model container [2018-11-06 21:47:56,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:47:56" (3/3) ... [2018-11-06 21:47:56,936 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label58_true-unreach-call.c [2018-11-06 21:47:56,945 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:47:56,954 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:47:56,967 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:47:57,010 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:47:57,011 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:47:57,011 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:47:57,012 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:47:57,012 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:47:57,012 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:47:57,012 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:47:57,012 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:47:57,012 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:47:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-11-06 21:47:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-06 21:47:57,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:57,055 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:47:57,058 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:57,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash 279835594, now seen corresponding path program 1 times [2018-11-06 21:47:57,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:57,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:57,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:57,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:57,604 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-11-06 21:47:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:47:57,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:47:57,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:47:57,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:47:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:47:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:47:57,657 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-11-06 21:48:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:05,166 INFO L93 Difference]: Finished difference Result 2085 states and 3898 transitions. [2018-11-06 21:48:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:48:05,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-06 21:48:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:05,198 INFO L225 Difference]: With dead ends: 2085 [2018-11-06 21:48:05,198 INFO L226 Difference]: Without dead ends: 1487 [2018-11-06 21:48:05,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:48:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-11-06 21:48:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1023. [2018-11-06 21:48:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-11-06 21:48:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1623 transitions. [2018-11-06 21:48:05,332 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1623 transitions. Word has length 46 [2018-11-06 21:48:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:05,333 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1623 transitions. [2018-11-06 21:48:05,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:48:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1623 transitions. [2018-11-06 21:48:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-06 21:48:05,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:05,339 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:48:05,339 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:05,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:05,339 INFO L82 PathProgramCache]: Analyzing trace with hash -447668766, now seen corresponding path program 1 times [2018-11-06 21:48:05,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:05,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:05,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:05,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:05,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:48:05,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:48:05,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:48:05,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:48:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:48:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:48:05,545 INFO L87 Difference]: Start difference. First operand 1023 states and 1623 transitions. Second operand 4 states. [2018-11-06 21:48:13,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:13,517 INFO L93 Difference]: Finished difference Result 2908 states and 4662 transitions. [2018-11-06 21:48:13,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:48:13,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-11-06 21:48:13,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:13,528 INFO L225 Difference]: With dead ends: 2908 [2018-11-06 21:48:13,528 INFO L226 Difference]: Without dead ends: 1887 [2018-11-06 21:48:13,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:48:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2018-11-06 21:48:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1887. [2018-11-06 21:48:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1887 states. [2018-11-06 21:48:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2573 transitions. [2018-11-06 21:48:13,573 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2573 transitions. Word has length 114 [2018-11-06 21:48:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:13,573 INFO L480 AbstractCegarLoop]: Abstraction has 1887 states and 2573 transitions. [2018-11-06 21:48:13,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:48:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2573 transitions. [2018-11-06 21:48:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-06 21:48:13,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:13,579 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:48:13,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:13,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1997237975, now seen corresponding path program 1 times [2018-11-06 21:48:13,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:13,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:13,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:48:14,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:48:14,038 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:48:14,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:14,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:48:14,745 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 26 [2018-11-06 21:48:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:48:15,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:48:15,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-11-06 21:48:15,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:48:15,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:48:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:48:15,033 INFO L87 Difference]: Start difference. First operand 1887 states and 2573 transitions. Second operand 8 states. [2018-11-06 21:48:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:34,701 INFO L93 Difference]: Finished difference Result 14929 states and 18762 transitions. [2018-11-06 21:48:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 21:48:34,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2018-11-06 21:48:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:34,734 INFO L225 Difference]: With dead ends: 14929 [2018-11-06 21:48:34,734 INFO L226 Difference]: Without dead ends: 6530 [2018-11-06 21:48:34,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-11-06 21:48:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states. [2018-11-06 21:48:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 6102. [2018-11-06 21:48:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6102 states. [2018-11-06 21:48:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6102 states to 6102 states and 7055 transitions. [2018-11-06 21:48:34,867 INFO L78 Accepts]: Start accepts. Automaton has 6102 states and 7055 transitions. Word has length 117 [2018-11-06 21:48:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:34,868 INFO L480 AbstractCegarLoop]: Abstraction has 6102 states and 7055 transitions. [2018-11-06 21:48:34,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:48:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6102 states and 7055 transitions. [2018-11-06 21:48:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-06 21:48:34,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:34,873 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:48:34,874 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:34,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2047166643, now seen corresponding path program 1 times [2018-11-06 21:48:34,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:34,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:34,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:34,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:34,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-06 21:48:35,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:48:35,253 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:48:35,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:35,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:48:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-06 21:48:35,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:48:35,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 21:48:35,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:48:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:48:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:48:35,534 INFO L87 Difference]: Start difference. First operand 6102 states and 7055 transitions. Second operand 5 states. [2018-11-06 21:48:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:39,063 INFO L93 Difference]: Finished difference Result 14331 states and 17023 transitions. [2018-11-06 21:48:39,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:48:39,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2018-11-06 21:48:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:39,105 INFO L225 Difference]: With dead ends: 14331 [2018-11-06 21:48:39,105 INFO L226 Difference]: Without dead ends: 8658 [2018-11-06 21:48:39,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:48:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8658 states. [2018-11-06 21:48:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8658 to 8658. [2018-11-06 21:48:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8658 states. [2018-11-06 21:48:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8658 states to 8658 states and 9933 transitions. [2018-11-06 21:48:39,270 INFO L78 Accepts]: Start accepts. Automaton has 8658 states and 9933 transitions. Word has length 229 [2018-11-06 21:48:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:39,271 INFO L480 AbstractCegarLoop]: Abstraction has 8658 states and 9933 transitions. [2018-11-06 21:48:39,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:48:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 8658 states and 9933 transitions. [2018-11-06 21:48:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-06 21:48:39,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:39,285 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:48:39,286 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:39,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash -578463749, now seen corresponding path program 1 times [2018-11-06 21:48:39,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:39,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:39,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:39,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:39,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 269 proven. 83 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-06 21:48:40,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:48:40,265 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:48:40,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:40,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:48:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 269 proven. 83 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-06 21:48:40,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:48:40,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-06 21:48:40,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:48:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:48:40,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:48:40,842 INFO L87 Difference]: Start difference. First operand 8658 states and 9933 transitions. Second operand 7 states. [2018-11-06 21:48:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:49,193 INFO L93 Difference]: Finished difference Result 25874 states and 30104 transitions. [2018-11-06 21:48:49,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:48:49,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 436 [2018-11-06 21:48:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:49,240 INFO L225 Difference]: With dead ends: 25874 [2018-11-06 21:48:49,240 INFO L226 Difference]: Without dead ends: 14637 [2018-11-06 21:48:49,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:48:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14637 states. [2018-11-06 21:48:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14637 to 13771. [2018-11-06 21:48:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13771 states. [2018-11-06 21:48:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13771 states to 13771 states and 15450 transitions. [2018-11-06 21:48:49,438 INFO L78 Accepts]: Start accepts. Automaton has 13771 states and 15450 transitions. Word has length 436 [2018-11-06 21:48:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:49,439 INFO L480 AbstractCegarLoop]: Abstraction has 13771 states and 15450 transitions. [2018-11-06 21:48:49,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:48:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 13771 states and 15450 transitions. [2018-11-06 21:48:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-11-06 21:48:49,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:49,456 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:48:49,457 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:49,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash -515726558, now seen corresponding path program 1 times [2018-11-06 21:48:49,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:49,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:49,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:49,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:49,957 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-06 21:48:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-06 21:48:50,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:48:50,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:48:50,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:48:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:48:50,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:48:50,226 INFO L87 Difference]: Start difference. First operand 13771 states and 15450 transitions. Second operand 3 states. [2018-11-06 21:48:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:53,376 INFO L93 Difference]: Finished difference Result 30525 states and 34467 transitions. [2018-11-06 21:48:53,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:48:53,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 458 [2018-11-06 21:48:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:53,409 INFO L225 Difference]: With dead ends: 30525 [2018-11-06 21:48:53,409 INFO L226 Difference]: Without dead ends: 17182 [2018-11-06 21:48:53,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:48:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17182 states. [2018-11-06 21:48:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17182 to 16753. [2018-11-06 21:48:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16753 states. [2018-11-06 21:48:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16753 states to 16753 states and 18794 transitions. [2018-11-06 21:48:53,650 INFO L78 Accepts]: Start accepts. Automaton has 16753 states and 18794 transitions. Word has length 458 [2018-11-06 21:48:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:53,651 INFO L480 AbstractCegarLoop]: Abstraction has 16753 states and 18794 transitions. [2018-11-06 21:48:53,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:48:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 16753 states and 18794 transitions. [2018-11-06 21:48:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-06 21:48:53,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:53,667 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:48:53,668 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:53,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:53,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1120688280, now seen corresponding path program 1 times [2018-11-06 21:48:53,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:53,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:53,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-06 21:48:54,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:48:54,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:48:54,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:48:54,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:48:54,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:48:54,356 INFO L87 Difference]: Start difference. First operand 16753 states and 18794 transitions. Second operand 3 states. [2018-11-06 21:48:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:56,689 INFO L93 Difference]: Finished difference Result 38616 states and 43512 transitions. [2018-11-06 21:48:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:48:56,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 483 [2018-11-06 21:48:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:56,729 INFO L225 Difference]: With dead ends: 38616 [2018-11-06 21:48:56,730 INFO L226 Difference]: Without dead ends: 22291 [2018-11-06 21:48:56,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:48:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22291 states. [2018-11-06 21:48:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22291 to 15893. [2018-11-06 21:48:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15893 states. [2018-11-06 21:48:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15893 states to 15893 states and 17888 transitions. [2018-11-06 21:48:56,965 INFO L78 Accepts]: Start accepts. Automaton has 15893 states and 17888 transitions. Word has length 483 [2018-11-06 21:48:56,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:56,966 INFO L480 AbstractCegarLoop]: Abstraction has 15893 states and 17888 transitions. [2018-11-06 21:48:56,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:48:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 15893 states and 17888 transitions. [2018-11-06 21:48:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-11-06 21:48:56,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:56,989 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:48:56,989 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:56,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1888340349, now seen corresponding path program 1 times [2018-11-06 21:48:56,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:56,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:56,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:56,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:56,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-11-06 21:48:57,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:48:57,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:48:57,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:48:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:48:57,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:48:57,653 INFO L87 Difference]: Start difference. First operand 15893 states and 17888 transitions. Second operand 5 states. [2018-11-06 21:49:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:49:03,648 INFO L93 Difference]: Finished difference Result 46730 states and 52561 transitions. [2018-11-06 21:49:03,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:49:03,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 518 [2018-11-06 21:49:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:49:03,691 INFO L225 Difference]: With dead ends: 46730 [2018-11-06 21:49:03,692 INFO L226 Difference]: Without dead ends: 30413 [2018-11-06 21:49:03,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:49:03,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30413 states. [2018-11-06 21:49:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30413 to 24443. [2018-11-06 21:49:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24443 states. [2018-11-06 21:49:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24443 states to 24443 states and 27180 transitions. [2018-11-06 21:49:04,017 INFO L78 Accepts]: Start accepts. Automaton has 24443 states and 27180 transitions. Word has length 518 [2018-11-06 21:49:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:49:04,018 INFO L480 AbstractCegarLoop]: Abstraction has 24443 states and 27180 transitions. [2018-11-06 21:49:04,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:49:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 24443 states and 27180 transitions. [2018-11-06 21:49:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-11-06 21:49:04,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:49:04,040 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:49:04,041 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:49:04,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:49:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash 746374440, now seen corresponding path program 1 times [2018-11-06 21:49:04,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:49:04,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:49:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:04,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:04,851 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-06 21:49:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 292 proven. 344 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-06 21:49:05,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:49:05,587 INFO L225 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 [2018-11-06 21:49:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:05,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:49:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 435 proven. 83 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-06 21:49:06,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:49:06,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-11-06 21:49:06,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:49:06,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:49:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:49:06,260 INFO L87 Difference]: Start difference. First operand 24443 states and 27180 transitions. Second operand 9 states. [2018-11-06 21:49:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:49:15,671 INFO L93 Difference]: Finished difference Result 52474 states and 58124 transitions. [2018-11-06 21:49:15,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:49:15,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 523 [2018-11-06 21:49:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:49:15,701 INFO L225 Difference]: With dead ends: 52474 [2018-11-06 21:49:15,701 INFO L226 Difference]: Without dead ends: 28459 [2018-11-06 21:49:15,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 522 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:49:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28459 states. [2018-11-06 21:49:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28459 to 27425. [2018-11-06 21:49:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27425 states. [2018-11-06 21:49:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27425 states to 27425 states and 30279 transitions. [2018-11-06 21:49:16,041 INFO L78 Accepts]: Start accepts. Automaton has 27425 states and 30279 transitions. Word has length 523 [2018-11-06 21:49:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:49:16,042 INFO L480 AbstractCegarLoop]: Abstraction has 27425 states and 30279 transitions. [2018-11-06 21:49:16,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:49:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 27425 states and 30279 transitions. [2018-11-06 21:49:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2018-11-06 21:49:16,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:49:16,068 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:49:16,068 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:49:16,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:49:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash 216858747, now seen corresponding path program 1 times [2018-11-06 21:49:16,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:49:16,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:49:16,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:16,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:16,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 525 proven. 404 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-06 21:49:16,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:49:16,900 INFO L225 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 [2018-11-06 21:49:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:17,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:49:17,376 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2018-11-06 21:49:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2018-11-06 21:49:17,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:49:17,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 21:49:17,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:49:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:49:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:49:17,863 INFO L87 Difference]: Start difference. First operand 27425 states and 30279 transitions. Second operand 7 states. [2018-11-06 21:50:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:16,725 INFO L93 Difference]: Finished difference Result 96674 states and 107359 transitions. [2018-11-06 21:50:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 21:50:16,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 604 [2018-11-06 21:50:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:16,820 INFO L225 Difference]: With dead ends: 96674 [2018-11-06 21:50:16,821 INFO L226 Difference]: Without dead ends: 70518 [2018-11-06 21:50:16,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 607 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:50:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70518 states. [2018-11-06 21:50:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70518 to 68344. [2018-11-06 21:50:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68344 states. [2018-11-06 21:50:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68344 states to 68344 states and 73989 transitions. [2018-11-06 21:50:17,983 INFO L78 Accepts]: Start accepts. Automaton has 68344 states and 73989 transitions. Word has length 604 [2018-11-06 21:50:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:17,983 INFO L480 AbstractCegarLoop]: Abstraction has 68344 states and 73989 transitions. [2018-11-06 21:50:17,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:50:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 68344 states and 73989 transitions. [2018-11-06 21:50:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2018-11-06 21:50:18,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:18,026 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:50:18,027 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:18,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1808419988, now seen corresponding path program 1 times [2018-11-06 21:50:18,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:18,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:18,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:18,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:18,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2018-11-06 21:50:18,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:18,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:50:18,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:50:18,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:50:18,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:50:18,623 INFO L87 Difference]: Start difference. First operand 68344 states and 73989 transitions. Second operand 3 states. [2018-11-06 21:50:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:21,192 INFO L93 Difference]: Finished difference Result 143081 states and 154858 transitions. [2018-11-06 21:50:21,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:50:21,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 703 [2018-11-06 21:50:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:21,272 INFO L225 Difference]: With dead ends: 143081 [2018-11-06 21:50:21,273 INFO L226 Difference]: Without dead ends: 76443 [2018-11-06 21:50:21,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:50:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76443 states. [2018-11-06 21:50:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76443 to 73031. [2018-11-06 21:50:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73031 states. [2018-11-06 21:50:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73031 states to 73031 states and 78105 transitions. [2018-11-06 21:50:22,005 INFO L78 Accepts]: Start accepts. Automaton has 73031 states and 78105 transitions. Word has length 703 [2018-11-06 21:50:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:22,005 INFO L480 AbstractCegarLoop]: Abstraction has 73031 states and 78105 transitions. [2018-11-06 21:50:22,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:50:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 73031 states and 78105 transitions. [2018-11-06 21:50:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-11-06 21:50:22,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:22,041 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:50:22,042 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:22,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1505395655, now seen corresponding path program 1 times [2018-11-06 21:50:22,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:22,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:22,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:22,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:22,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 1008 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2018-11-06 21:50:23,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:23,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:50:23,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:50:23,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:50:23,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:50:23,532 INFO L87 Difference]: Start difference. First operand 73031 states and 78105 transitions. Second operand 5 states. [2018-11-06 21:50:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:28,975 INFO L93 Difference]: Finished difference Result 170395 states and 182982 transitions. [2018-11-06 21:50:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:50:28,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 807 [2018-11-06 21:50:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:29,091 INFO L225 Difference]: With dead ends: 170395 [2018-11-06 21:50:29,091 INFO L226 Difference]: Without dead ends: 107602 [2018-11-06 21:50:29,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:50:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107602 states. [2018-11-06 21:50:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107602 to 87971. [2018-11-06 21:50:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87971 states. [2018-11-06 21:50:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87971 states to 87971 states and 94138 transitions. [2018-11-06 21:50:30,770 INFO L78 Accepts]: Start accepts. Automaton has 87971 states and 94138 transitions. Word has length 807 [2018-11-06 21:50:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:30,771 INFO L480 AbstractCegarLoop]: Abstraction has 87971 states and 94138 transitions. [2018-11-06 21:50:30,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:50:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 87971 states and 94138 transitions. [2018-11-06 21:50:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2018-11-06 21:50:30,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:30,804 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:50:30,804 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:30,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:30,805 INFO L82 PathProgramCache]: Analyzing trace with hash -668625519, now seen corresponding path program 1 times [2018-11-06 21:50:30,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:30,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:30,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:30,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:30,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 598 proven. 0 refuted. 0 times theorem prover too weak. 938 trivial. 0 not checked. [2018-11-06 21:50:31,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:31,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:50:31,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:50:31,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:50:31,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:50:31,740 INFO L87 Difference]: Start difference. First operand 87971 states and 94138 transitions. Second operand 3 states. [2018-11-06 21:50:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:35,393 INFO L93 Difference]: Finished difference Result 171237 states and 183234 transitions. [2018-11-06 21:50:35,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:50:35,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 827 [2018-11-06 21:50:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:35,486 INFO L225 Difference]: With dead ends: 171237 [2018-11-06 21:50:35,487 INFO L226 Difference]: Without dead ends: 85397 [2018-11-06 21:50:35,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:50:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85397 states. [2018-11-06 21:50:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85397 to 83677. [2018-11-06 21:50:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83677 states. [2018-11-06 21:50:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83677 states to 83677 states and 89476 transitions. [2018-11-06 21:50:36,372 INFO L78 Accepts]: Start accepts. Automaton has 83677 states and 89476 transitions. Word has length 827 [2018-11-06 21:50:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:36,372 INFO L480 AbstractCegarLoop]: Abstraction has 83677 states and 89476 transitions. [2018-11-06 21:50:36,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:50:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83677 states and 89476 transitions. [2018-11-06 21:50:36,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2018-11-06 21:50:36,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:36,405 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:50:36,406 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:36,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:36,406 INFO L82 PathProgramCache]: Analyzing trace with hash -198101528, now seen corresponding path program 1 times [2018-11-06 21:50:36,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:36,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:36,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:36,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:36,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:37,927 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-06 21:50:38,160 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-06 21:50:38,437 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 9 [2018-11-06 21:50:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 998 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-11-06 21:50:39,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:39,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:50:39,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:50:39,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:50:39,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:50:39,069 INFO L87 Difference]: Start difference. First operand 83677 states and 89476 transitions. Second operand 5 states. [2018-11-06 21:50:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:46,798 INFO L93 Difference]: Finished difference Result 179290 states and 191358 transitions. [2018-11-06 21:50:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:50:46,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 842 [2018-11-06 21:50:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:46,930 INFO L225 Difference]: With dead ends: 179290 [2018-11-06 21:50:46,930 INFO L226 Difference]: Without dead ends: 105421 [2018-11-06 21:50:46,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:50:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105421 states. [2018-11-06 21:50:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105421 to 85381. [2018-11-06 21:50:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85381 states. [2018-11-06 21:50:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85381 states to 85381 states and 91078 transitions. [2018-11-06 21:50:47,988 INFO L78 Accepts]: Start accepts. Automaton has 85381 states and 91078 transitions. Word has length 842 [2018-11-06 21:50:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:47,989 INFO L480 AbstractCegarLoop]: Abstraction has 85381 states and 91078 transitions. [2018-11-06 21:50:47,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:50:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 85381 states and 91078 transitions. [2018-11-06 21:50:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2018-11-06 21:50:48,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:48,018 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:50:48,018 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:48,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash 501436196, now seen corresponding path program 1 times [2018-11-06 21:50:48,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:48,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:48,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:48,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:48,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 1076 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-11-06 21:50:50,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:50,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:50:50,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:50:50,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:50:50,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:50:50,110 INFO L87 Difference]: Start difference. First operand 85381 states and 91078 transitions. Second operand 6 states. [2018-11-06 21:50:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:55,917 INFO L93 Difference]: Finished difference Result 186544 states and 199340 transitions. [2018-11-06 21:50:55,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:50:55,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 876 [2018-11-06 21:50:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:56,038 INFO L225 Difference]: With dead ends: 186544 [2018-11-06 21:50:56,038 INFO L226 Difference]: Without dead ends: 110971 [2018-11-06 21:50:56,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:50:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110971 states. [2018-11-06 21:50:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110971 to 72567. [2018-11-06 21:50:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72567 states. [2018-11-06 21:50:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72567 states to 72567 states and 77220 transitions. [2018-11-06 21:50:57,775 INFO L78 Accepts]: Start accepts. Automaton has 72567 states and 77220 transitions. Word has length 876 [2018-11-06 21:50:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:57,776 INFO L480 AbstractCegarLoop]: Abstraction has 72567 states and 77220 transitions. [2018-11-06 21:50:57,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:50:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 72567 states and 77220 transitions. [2018-11-06 21:50:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2018-11-06 21:50:57,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:57,799 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:50:57,799 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:57,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1542023005, now seen corresponding path program 1 times [2018-11-06 21:50:57,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:57,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:57,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:58,632 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-11-06 21:50:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2018-11-06 21:50:59,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:59,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:50:59,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:50:59,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:50:59,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:50:59,089 INFO L87 Difference]: Start difference. First operand 72567 states and 77220 transitions. Second operand 5 states. [2018-11-06 21:51:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:51:04,455 INFO L93 Difference]: Finished difference Result 174996 states and 185743 transitions. [2018-11-06 21:51:04,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:51:04,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 896 [2018-11-06 21:51:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:51:04,565 INFO L225 Difference]: With dead ends: 174996 [2018-11-06 21:51:04,565 INFO L226 Difference]: Without dead ends: 104134 [2018-11-06 21:51:04,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:51:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104134 states. [2018-11-06 21:51:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104134 to 90450. [2018-11-06 21:51:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90450 states. [2018-11-06 21:51:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90450 states to 90450 states and 94941 transitions. [2018-11-06 21:51:05,517 INFO L78 Accepts]: Start accepts. Automaton has 90450 states and 94941 transitions. Word has length 896 [2018-11-06 21:51:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:51:05,518 INFO L480 AbstractCegarLoop]: Abstraction has 90450 states and 94941 transitions. [2018-11-06 21:51:05,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:51:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 90450 states and 94941 transitions. [2018-11-06 21:51:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2018-11-06 21:51:05,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:51:05,558 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:51:05,558 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:51:05,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:51:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1781591907, now seen corresponding path program 1 times [2018-11-06 21:51:05,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:51:05,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:51:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:05,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:51:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:51:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2029 backedges. 1196 proven. 164 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2018-11-06 21:51:07,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:51:07,231 INFO L225 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 [2018-11-06 21:51:07,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:51:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:51:07,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:51:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2029 backedges. 1426 proven. 182 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-11-06 21:51:11,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:51:11,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-06 21:51:11,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:51:11,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:51:11,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:51:11,864 INFO L87 Difference]: Start difference. First operand 90450 states and 94941 transitions. Second operand 12 states. [2018-11-06 21:51:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:51:37,209 INFO L93 Difference]: Finished difference Result 226110 states and 237237 transitions. [2018-11-06 21:51:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-06 21:51:37,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1158 [2018-11-06 21:51:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:51:37,394 INFO L225 Difference]: With dead ends: 226110 [2018-11-06 21:51:37,394 INFO L226 Difference]: Without dead ends: 137792 [2018-11-06 21:51:37,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1175 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 21:51:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137792 states. [2018-11-06 21:51:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137792 to 89584. [2018-11-06 21:51:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89584 states. [2018-11-06 21:51:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89584 states to 89584 states and 93504 transitions. [2018-11-06 21:51:39,061 INFO L78 Accepts]: Start accepts. Automaton has 89584 states and 93504 transitions. Word has length 1158 [2018-11-06 21:51:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:51:39,062 INFO L480 AbstractCegarLoop]: Abstraction has 89584 states and 93504 transitions. [2018-11-06 21:51:39,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:51:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 89584 states and 93504 transitions. [2018-11-06 21:51:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1187 [2018-11-06 21:51:39,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:51:39,103 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:51:39,103 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:51:39,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:51:39,104 INFO L82 PathProgramCache]: Analyzing trace with hash -202295700, now seen corresponding path program 1 times [2018-11-06 21:51:39,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:51:39,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:51:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:39,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:51:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:51:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 1407 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2018-11-06 21:51:40,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:51:40,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:51:40,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:51:40,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:51:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:51:40,547 INFO L87 Difference]: Start difference. First operand 89584 states and 93504 transitions. Second operand 3 states. Received shutdown request... [2018-11-06 21:51:40,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 21:51:40,659 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:51:40,665 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:51:40,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:51:40 BoogieIcfgContainer [2018-11-06 21:51:40,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:51:40,667 INFO L168 Benchmark]: Toolchain (without parser) took 234041.68 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -841.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:51:40,668 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:51:40,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1590.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:40,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 490.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -922.9 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:40,670 INFO L168 Benchmark]: Boogie Preprocessor took 337.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:40,671 INFO L168 Benchmark]: RCFGBuilder took 7880.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 467.0 MB). Peak memory consumption was 467.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:40,672 INFO L168 Benchmark]: TraceAbstraction took 223737.65 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 1.7 GB in the beginning and 2.3 GB in the end (delta: -563.9 MB). Peak memory consumption was 940.2 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:40,677 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1590.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 490.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -922.9 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 337.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7880.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 467.0 MB). Peak memory consumption was 467.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223737.65 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 1.7 GB in the beginning and 2.3 GB in the end (delta: -563.9 MB). Peak memory consumption was 940.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 143). Cancelled while BasicCegarLoop was constructing difference of abstraction (89584states) and FLOYD_HOARE automaton (currently 2 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (80 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 591 locations, 1 error locations. TIMEOUT Result, 223.6s OverallTime, 18 OverallIterations, 7 TraceHistogramMax, 184.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5874 SDtfs, 36644 SDslu, 3384 SDs, 0 SdLazy, 72946 SolverSat, 10868 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 156.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3210 GetRequests, 3104 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90450occurred in iteration=16, 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: 11.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 162862 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 13890 NumberOfCodeBlocks, 13890 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 13866 ConstructedInterpolants, 370 QuantifiedInterpolants, 33550974 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3841 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 20147/21572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown