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/Problem03_label07_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:52:40,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:52:40,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:52:40,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:52:40,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:52:40,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:52:40,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:52:40,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:52:40,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:52:40,197 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:52:40,198 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:52:40,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:52:40,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:52:40,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:52:40,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:52:40,203 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:52:40,204 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:52:40,206 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:52:40,208 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:52:40,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:52:40,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:52:40,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:52:40,215 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:52:40,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:52:40,216 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:52:40,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:52:40,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:52:40,219 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:52:40,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:52:40,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:52:40,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:52:40,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:52:40,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:52:40,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:52:40,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:52:40,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:52:40,229 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 19:52:40,251 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:52:40,251 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:52:40,252 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:52:40,252 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:52:40,253 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:52:40,253 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:52:40,253 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:52:40,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:52:40,254 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:52:40,254 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:52:40,254 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:52:40,255 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:52:40,255 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:52:40,255 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:52:40,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:52:40,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:52:40,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:52:40,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:52:40,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:52:40,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:40,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:52:40,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:52:40,257 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:52:40,257 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:52:40,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:52:40,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:52:40,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:52:40,258 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:52:40,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:52:40,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:52:40,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:52:40,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:52:40,324 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:52:40,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c [2018-11-06 19:52:40,390 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee0a13577/abeb0aa2e7314a9a9a0774cdeebb043b/FLAGe64791593 [2018-11-06 19:52:41,056 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:52:41,057 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c [2018-11-06 19:52:41,077 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee0a13577/abeb0aa2e7314a9a9a0774cdeebb043b/FLAGe64791593 [2018-11-06 19:52:41,098 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee0a13577/abeb0aa2e7314a9a9a0774cdeebb043b [2018-11-06 19:52:41,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:52:41,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:52:41,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:41,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:52:41,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:52:41,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:41" (1/1) ... [2018-11-06 19:52:41,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42844b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:41, skipping insertion in model container [2018-11-06 19:52:41,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:41" (1/1) ... [2018-11-06 19:52:41,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:52:41,220 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:52:41,901 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:41,906 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:52:42,163 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:42,188 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:52:42,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42 WrapperNode [2018-11-06 19:52:42,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:42,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:42,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:52:42,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:52:42,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:42,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:52:42,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:52:42,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:52:42,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:52:42,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:52:42,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:52:42,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:52:42,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (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 19:52:42,668 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:52:42,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:52:42,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:52:47,969 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:52:47,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:47 BoogieIcfgContainer [2018-11-06 19:52:47,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:52:47,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:52:47,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:52:47,975 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:52:47,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:52:41" (1/3) ... [2018-11-06 19:52:47,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f900359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:47, skipping insertion in model container [2018-11-06 19:52:47,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (2/3) ... [2018-11-06 19:52:47,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f900359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:47, skipping insertion in model container [2018-11-06 19:52:47,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:47" (3/3) ... [2018-11-06 19:52:47,979 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label07_true-unreach-call.c [2018-11-06 19:52:47,990 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:52:48,001 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:52:48,020 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:52:48,059 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:52:48,060 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:52:48,060 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:52:48,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:52:48,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:52:48,066 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:52:48,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:52:48,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:52:48,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:52:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:52:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-06 19:52:48,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:48,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:48,115 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:48,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash 418458546, now seen corresponding path program 1 times [2018-11-06 19:52:48,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:48,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:48,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:49,043 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 19:52:49,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:49,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:49,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:49,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:49,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:49,073 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:52:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:52,827 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-11-06 19:52:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:52,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-11-06 19:52:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:52,854 INFO L225 Difference]: With dead ends: 1027 [2018-11-06 19:52:52,855 INFO L226 Difference]: Without dead ends: 717 [2018-11-06 19:52:52,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-11-06 19:52:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-11-06 19:52:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-06 19:52:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-11-06 19:52:53,011 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 173 [2018-11-06 19:52:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:53,013 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-11-06 19:52:53,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-11-06 19:52:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-06 19:52:53,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:53,026 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:52:53,026 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:53,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:53,030 INFO L82 PathProgramCache]: Analyzing trace with hash 72085267, now seen corresponding path program 1 times [2018-11-06 19:52:53,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:53,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:53,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:53,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:53,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:53,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:53,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:53,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:53,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:53,199 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-11-06 19:52:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:55,145 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-11-06 19:52:55,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:55,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-11-06 19:52:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:55,155 INFO L225 Difference]: With dead ends: 2058 [2018-11-06 19:52:55,156 INFO L226 Difference]: Without dead ends: 1345 [2018-11-06 19:52:55,161 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 19:52:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-11-06 19:52:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-11-06 19:52:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-11-06 19:52:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-11-06 19:52:55,198 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 182 [2018-11-06 19:52:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:55,198 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-11-06 19:52:55,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-11-06 19:52:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-06 19:52:55,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:55,203 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:52:55,203 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:55,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:55,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2004095041, now seen corresponding path program 1 times [2018-11-06 19:52:55,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:55,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:55,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:55,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:55,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:52:55,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:55,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:55,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:55,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:55,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:55,461 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-11-06 19:52:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:59,290 INFO L93 Difference]: Finished difference Result 3896 states and 6120 transitions. [2018-11-06 19:52:59,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:59,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-11-06 19:52:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:59,306 INFO L225 Difference]: With dead ends: 3896 [2018-11-06 19:52:59,307 INFO L226 Difference]: Without dead ends: 2567 [2018-11-06 19:52:59,310 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 19:52:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2018-11-06 19:52:59,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2565. [2018-11-06 19:52:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2018-11-06 19:52:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3748 transitions. [2018-11-06 19:52:59,363 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3748 transitions. Word has length 190 [2018-11-06 19:52:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:59,364 INFO L480 AbstractCegarLoop]: Abstraction has 2565 states and 3748 transitions. [2018-11-06 19:52:59,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3748 transitions. [2018-11-06 19:52:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-06 19:52:59,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:59,370 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2018-11-06 19:52:59,371 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:59,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash 704749675, now seen corresponding path program 1 times [2018-11-06 19:52:59,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:59,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:59,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:52:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:59,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:59,568 INFO L87 Difference]: Start difference. First operand 2565 states and 3748 transitions. Second operand 4 states. [2018-11-06 19:53:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:01,047 INFO L93 Difference]: Finished difference Result 5099 states and 7455 transitions. [2018-11-06 19:53:01,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:01,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-11-06 19:53:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:01,059 INFO L225 Difference]: With dead ends: 5099 [2018-11-06 19:53:01,060 INFO L226 Difference]: Without dead ends: 2536 [2018-11-06 19:53:01,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2018-11-06 19:53:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2018-11-06 19:53:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2018-11-06 19:53:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3609 transitions. [2018-11-06 19:53:01,108 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3609 transitions. Word has length 201 [2018-11-06 19:53:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:01,109 INFO L480 AbstractCegarLoop]: Abstraction has 2536 states and 3609 transitions. [2018-11-06 19:53:01,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3609 transitions. [2018-11-06 19:53:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-06 19:53:01,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:01,116 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-06 19:53:01,116 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:01,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1273453360, now seen corresponding path program 1 times [2018-11-06 19:53:01,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:01,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:01,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:01,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:01,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:01,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:01,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:01,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:01,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:01,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:01,263 INFO L87 Difference]: Start difference. First operand 2536 states and 3609 transitions. Second operand 4 states. [2018-11-06 19:53:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:03,324 INFO L93 Difference]: Finished difference Result 10131 states and 14422 transitions. [2018-11-06 19:53:03,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:03,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-11-06 19:53:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:03,357 INFO L225 Difference]: With dead ends: 10131 [2018-11-06 19:53:03,358 INFO L226 Difference]: Without dead ends: 7597 [2018-11-06 19:53:03,363 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 19:53:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2018-11-06 19:53:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 7593. [2018-11-06 19:53:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-11-06 19:53:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 10758 transitions. [2018-11-06 19:53:03,507 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 10758 transitions. Word has length 203 [2018-11-06 19:53:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:03,508 INFO L480 AbstractCegarLoop]: Abstraction has 7593 states and 10758 transitions. [2018-11-06 19:53:03,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 10758 transitions. [2018-11-06 19:53:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-06 19:53:03,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:03,518 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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] [2018-11-06 19:53:03,519 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:03,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2049995315, now seen corresponding path program 1 times [2018-11-06 19:53:03,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:03,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:03,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:03,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:03,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:53:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:03,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:03,659 INFO L87 Difference]: Start difference. First operand 7593 states and 10758 transitions. Second operand 3 states. [2018-11-06 19:53:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:05,011 INFO L93 Difference]: Finished difference Result 15190 states and 21526 transitions. [2018-11-06 19:53:05,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:05,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-11-06 19:53:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:05,041 INFO L225 Difference]: With dead ends: 15190 [2018-11-06 19:53:05,041 INFO L226 Difference]: Without dead ends: 7599 [2018-11-06 19:53:05,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 19:53:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-11-06 19:53:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 7593. [2018-11-06 19:53:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-11-06 19:53:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 9699 transitions. [2018-11-06 19:53:05,171 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 9699 transitions. Word has length 208 [2018-11-06 19:53:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:05,171 INFO L480 AbstractCegarLoop]: Abstraction has 7593 states and 9699 transitions. [2018-11-06 19:53:05,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 9699 transitions. [2018-11-06 19:53:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-06 19:53:05,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:05,178 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2018-11-06 19:53:05,178 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:05,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1773650990, now seen corresponding path program 1 times [2018-11-06 19:53:05,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:05,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:05,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:05,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:05,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:05,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:05,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:05,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:05,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:05,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:05,366 INFO L87 Difference]: Start difference. First operand 7593 states and 9699 transitions. Second operand 3 states. [2018-11-06 19:53:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:07,335 INFO L93 Difference]: Finished difference Result 22543 states and 28853 transitions. [2018-11-06 19:53:07,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:07,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-11-06 19:53:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:07,401 INFO L225 Difference]: With dead ends: 22543 [2018-11-06 19:53:07,401 INFO L226 Difference]: Without dead ends: 14952 [2018-11-06 19:53:07,411 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 19:53:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14952 states. [2018-11-06 19:53:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14952 to 14943. [2018-11-06 19:53:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-11-06 19:53:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 18430 transitions. [2018-11-06 19:53:07,594 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 18430 transitions. Word has length 225 [2018-11-06 19:53:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:07,594 INFO L480 AbstractCegarLoop]: Abstraction has 14943 states and 18430 transitions. [2018-11-06 19:53:07,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 18430 transitions. [2018-11-06 19:53:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-06 19:53:07,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:07,605 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, 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] [2018-11-06 19:53:07,605 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:07,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1682463316, now seen corresponding path program 1 times [2018-11-06 19:53:07,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:07,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:07,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:07,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:07,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:07,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:07,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:07,792 INFO L87 Difference]: Start difference. First operand 14943 states and 18430 transitions. Second operand 4 states. [2018-11-06 19:53:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:09,016 INFO L93 Difference]: Finished difference Result 29884 states and 36858 transitions. [2018-11-06 19:53:09,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:09,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-11-06 19:53:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:09,045 INFO L225 Difference]: With dead ends: 29884 [2018-11-06 19:53:09,046 INFO L226 Difference]: Without dead ends: 14943 [2018-11-06 19:53:09,060 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 19:53:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14943 states. [2018-11-06 19:53:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14943 to 14943. [2018-11-06 19:53:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-11-06 19:53:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 17684 transitions. [2018-11-06 19:53:09,232 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 17684 transitions. Word has length 228 [2018-11-06 19:53:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:09,233 INFO L480 AbstractCegarLoop]: Abstraction has 14943 states and 17684 transitions. [2018-11-06 19:53:09,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 17684 transitions. [2018-11-06 19:53:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-06 19:53:09,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:09,242 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, 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] [2018-11-06 19:53:09,242 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:09,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1318810977, now seen corresponding path program 1 times [2018-11-06 19:53:09,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:09,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:09,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-06 19:53:09,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:09,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:09,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:09,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:09,430 INFO L87 Difference]: Start difference. First operand 14943 states and 17684 transitions. Second operand 3 states. [2018-11-06 19:53:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:10,737 INFO L93 Difference]: Finished difference Result 37363 states and 44044 transitions. [2018-11-06 19:53:10,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:10,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-11-06 19:53:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:10,778 INFO L225 Difference]: With dead ends: 37363 [2018-11-06 19:53:10,779 INFO L226 Difference]: Without dead ends: 22422 [2018-11-06 19:53:10,796 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 19:53:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22422 states. [2018-11-06 19:53:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22422 to 22417. [2018-11-06 19:53:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22417 states. [2018-11-06 19:53:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22417 states to 22417 states and 26323 transitions. [2018-11-06 19:53:11,186 INFO L78 Accepts]: Start accepts. Automaton has 22417 states and 26323 transitions. Word has length 237 [2018-11-06 19:53:11,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:11,186 INFO L480 AbstractCegarLoop]: Abstraction has 22417 states and 26323 transitions. [2018-11-06 19:53:11,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 22417 states and 26323 transitions. [2018-11-06 19:53:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-06 19:53:11,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:11,199 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-06 19:53:11,199 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:11,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:11,200 INFO L82 PathProgramCache]: Analyzing trace with hash -757390539, now seen corresponding path program 1 times [2018-11-06 19:53:11,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:11,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:11,511 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:53:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-06 19:53:11,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:53:11,575 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 19:53:11,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:11,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:53:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-06 19:53:11,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:53:11,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-11-06 19:53:11,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:53:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:53:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:53:11,927 INFO L87 Difference]: Start difference. First operand 22417 states and 26323 transitions. Second operand 6 states. [2018-11-06 19:53:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:19,072 INFO L93 Difference]: Finished difference Result 130790 states and 153530 transitions. [2018-11-06 19:53:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:53:19,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2018-11-06 19:53:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:19,608 INFO L225 Difference]: With dead ends: 130790 [2018-11-06 19:53:19,608 INFO L226 Difference]: Without dead ends: 108375 [2018-11-06 19:53:19,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:53:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108375 states. [2018-11-06 19:53:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108375 to 106497. [2018-11-06 19:53:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106497 states. [2018-11-06 19:53:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106497 states to 106497 states and 119844 transitions. [2018-11-06 19:53:21,062 INFO L78 Accepts]: Start accepts. Automaton has 106497 states and 119844 transitions. Word has length 245 [2018-11-06 19:53:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:21,062 INFO L480 AbstractCegarLoop]: Abstraction has 106497 states and 119844 transitions. [2018-11-06 19:53:21,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:53:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 106497 states and 119844 transitions. [2018-11-06 19:53:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-11-06 19:53:21,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:21,106 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:21,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:21,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash 778143398, now seen corresponding path program 1 times [2018-11-06 19:53:21,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:21,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:21,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:21,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:21,476 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:53:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 19:53:21,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:21,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:21,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:21,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:21,566 INFO L87 Difference]: Start difference. First operand 106497 states and 119844 transitions. Second operand 4 states. [2018-11-06 19:53:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:25,019 INFO L93 Difference]: Finished difference Result 352610 states and 394075 transitions. [2018-11-06 19:53:25,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:25,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-11-06 19:53:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:25,423 INFO L225 Difference]: With dead ends: 352610 [2018-11-06 19:53:25,423 INFO L226 Difference]: Without dead ends: 246115 [2018-11-06 19:53:25,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 19:53:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246115 states. [2018-11-06 19:53:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246115 to 184592. [2018-11-06 19:53:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184592 states. [2018-11-06 19:53:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184592 states to 184592 states and 204846 transitions. [2018-11-06 19:53:28,509 INFO L78 Accepts]: Start accepts. Automaton has 184592 states and 204846 transitions. Word has length 315 [2018-11-06 19:53:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:28,510 INFO L480 AbstractCegarLoop]: Abstraction has 184592 states and 204846 transitions. [2018-11-06 19:53:28,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 184592 states and 204846 transitions. [2018-11-06 19:53:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-06 19:53:28,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:28,546 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:28,546 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:28,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1158786570, now seen corresponding path program 1 times [2018-11-06 19:53:28,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:28,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:28,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:28,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:28,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-06 19:53:29,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:29,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:29,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:29,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:29,042 INFO L87 Difference]: Start difference. First operand 184592 states and 204846 transitions. Second operand 3 states. [2018-11-06 19:53:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:31,580 INFO L93 Difference]: Finished difference Result 430750 states and 479158 transitions. [2018-11-06 19:53:31,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:31,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-06 19:53:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:33,583 INFO L225 Difference]: With dead ends: 430750 [2018-11-06 19:53:33,583 INFO L226 Difference]: Without dead ends: 246160 [2018-11-06 19:53:33,714 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 19:53:33,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246160 states. [2018-11-06 19:53:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246160 to 234843. [2018-11-06 19:53:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234843 states. [2018-11-06 19:53:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234843 states to 234843 states and 262264 transitions. [2018-11-06 19:53:38,548 INFO L78 Accepts]: Start accepts. Automaton has 234843 states and 262264 transitions. Word has length 330 [2018-11-06 19:53:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:38,549 INFO L480 AbstractCegarLoop]: Abstraction has 234843 states and 262264 transitions. [2018-11-06 19:53:38,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 234843 states and 262264 transitions. [2018-11-06 19:53:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-11-06 19:53:38,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:38,590 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:38,590 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:38,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:38,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1828150633, now seen corresponding path program 1 times [2018-11-06 19:53:38,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:38,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:38,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:38,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:38,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-06 19:53:38,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:38,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:38,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:38,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:38,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:38,822 INFO L87 Difference]: Start difference. First operand 234843 states and 262264 transitions. Second operand 3 states. [2018-11-06 19:53:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:40,673 INFO L93 Difference]: Finished difference Result 469669 states and 524511 transitions. [2018-11-06 19:53:40,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:40,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2018-11-06 19:53:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:40,979 INFO L225 Difference]: With dead ends: 469669 [2018-11-06 19:53:40,979 INFO L226 Difference]: Without dead ends: 234828 [2018-11-06 19:53:41,097 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 19:53:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234828 states. [2018-11-06 19:53:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234828 to 234828. [2018-11-06 19:53:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234828 states. [2018-11-06 19:53:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234828 states to 234828 states and 262234 transitions. [2018-11-06 19:53:45,117 INFO L78 Accepts]: Start accepts. Automaton has 234828 states and 262234 transitions. Word has length 336 [2018-11-06 19:53:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:45,117 INFO L480 AbstractCegarLoop]: Abstraction has 234828 states and 262234 transitions. [2018-11-06 19:53:45,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 234828 states and 262234 transitions. [2018-11-06 19:53:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-06 19:53:45,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:45,162 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:45,162 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:45,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash 312285425, now seen corresponding path program 1 times [2018-11-06 19:53:45,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:45,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:45,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-06 19:53:50,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:50,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:50,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:50,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:50,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:50,376 INFO L87 Difference]: Start difference. First operand 234828 states and 262234 transitions. Second operand 3 states. [2018-11-06 19:53:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:53,649 INFO L93 Difference]: Finished difference Result 457996 states and 511131 transitions. [2018-11-06 19:53:53,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:53,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-11-06 19:53:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:53,969 INFO L225 Difference]: With dead ends: 457996 [2018-11-06 19:53:53,969 INFO L226 Difference]: Without dead ends: 223170 [2018-11-06 19:53:54,131 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 19:53:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223170 states. [2018-11-06 19:53:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223170 to 213295. [2018-11-06 19:53:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213295 states. [2018-11-06 19:53:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213295 states to 213295 states and 231973 transitions. [2018-11-06 19:53:58,175 INFO L78 Accepts]: Start accepts. Automaton has 213295 states and 231973 transitions. Word has length 347 [2018-11-06 19:53:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:58,175 INFO L480 AbstractCegarLoop]: Abstraction has 213295 states and 231973 transitions. [2018-11-06 19:53:58,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 213295 states and 231973 transitions. [2018-11-06 19:53:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-11-06 19:53:58,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:58,202 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:58,202 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:58,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:58,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1408009665, now seen corresponding path program 1 times [2018-11-06 19:53:58,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:58,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:58,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:58,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:58,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-06 19:53:58,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:53:58,819 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 19:53:58,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:58,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:53:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-06 19:53:59,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:53:59,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 19:53:59,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:53:59,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:53:59,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:53:59,353 INFO L87 Difference]: Start difference. First operand 213295 states and 231973 transitions. Second operand 6 states. [2018-11-06 19:54:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:07,067 INFO L93 Difference]: Finished difference Result 902872 states and 981569 transitions. [2018-11-06 19:54:07,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:54:07,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2018-11-06 19:54:07,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:07,856 INFO L225 Difference]: With dead ends: 902872 [2018-11-06 19:54:07,856 INFO L226 Difference]: Without dead ends: 689579 [2018-11-06 19:54:07,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:54:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689579 states. [2018-11-06 19:54:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689579 to 432775. [2018-11-06 19:54:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432775 states. [2018-11-06 19:54:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432775 states to 432775 states and 470790 transitions. [2018-11-06 19:54:16,219 INFO L78 Accepts]: Start accepts. Automaton has 432775 states and 470790 transitions. Word has length 362 [2018-11-06 19:54:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:16,219 INFO L480 AbstractCegarLoop]: Abstraction has 432775 states and 470790 transitions. [2018-11-06 19:54:16,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:54:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 432775 states and 470790 transitions. [2018-11-06 19:54:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-11-06 19:54:16,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:16,255 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 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] [2018-11-06 19:54:16,255 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:16,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:16,255 INFO L82 PathProgramCache]: Analyzing trace with hash -185387452, now seen corresponding path program 1 times [2018-11-06 19:54:16,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:16,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:16,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:16,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:16,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-06 19:54:16,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:16,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:16,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:16,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:16,648 INFO L87 Difference]: Start difference. First operand 432775 states and 470790 transitions. Second operand 4 states. [2018-11-06 19:54:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:26,503 INFO L93 Difference]: Finished difference Result 874644 states and 951201 transitions. [2018-11-06 19:54:26,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:54:26,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-11-06 19:54:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:27,174 INFO L225 Difference]: With dead ends: 874644 [2018-11-06 19:54:27,174 INFO L226 Difference]: Without dead ends: 441871 [2018-11-06 19:54:27,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441871 states. [2018-11-06 19:54:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441871 to 441362. [2018-11-06 19:54:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441362 states. [2018-11-06 19:54:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441362 states to 441362 states and 478308 transitions. [2018-11-06 19:54:34,519 INFO L78 Accepts]: Start accepts. Automaton has 441362 states and 478308 transitions. Word has length 374 [2018-11-06 19:54:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:34,519 INFO L480 AbstractCegarLoop]: Abstraction has 441362 states and 478308 transitions. [2018-11-06 19:54:34,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 441362 states and 478308 transitions. [2018-11-06 19:54:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-11-06 19:54:34,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:34,582 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, 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, 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] [2018-11-06 19:54:34,582 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:34,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:34,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1184387920, now seen corresponding path program 1 times [2018-11-06 19:54:34,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:34,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:34,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:34,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:34,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-06 19:54:35,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:35,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:35,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:35,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:35,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:35,020 INFO L87 Difference]: Start difference. First operand 441362 states and 478308 transitions. Second operand 3 states. [2018-11-06 19:54:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:39,987 INFO L93 Difference]: Finished difference Result 912615 states and 988718 transitions. [2018-11-06 19:54:39,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:39,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 407 [2018-11-06 19:54:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:40,510 INFO L225 Difference]: With dead ends: 912615 [2018-11-06 19:54:40,510 INFO L226 Difference]: Without dead ends: 471255 [2018-11-06 19:54:40,712 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 19:54:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471255 states. [2018-11-06 19:54:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471255 to 457308. [2018-11-06 19:54:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457308 states. [2018-11-06 19:54:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457308 states to 457308 states and 495106 transitions. [2018-11-06 19:54:48,850 INFO L78 Accepts]: Start accepts. Automaton has 457308 states and 495106 transitions. Word has length 407 [2018-11-06 19:54:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:48,850 INFO L480 AbstractCegarLoop]: Abstraction has 457308 states and 495106 transitions. [2018-11-06 19:54:48,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 457308 states and 495106 transitions. [2018-11-06 19:54:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-11-06 19:54:48,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:48,898 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:54:48,898 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:48,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1886071870, now seen corresponding path program 1 times [2018-11-06 19:54:48,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:48,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:48,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:49,492 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 19:54:49,760 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-06 19:54:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 391 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-06 19:54:56,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:54:56,844 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 19:54:56,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:57,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:54:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 35 proven. 225 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-06 19:54:57,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:54:57,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-06 19:54:57,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:54:57,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:54:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:54:57,243 INFO L87 Difference]: Start difference. First operand 457308 states and 495106 transitions. Second operand 8 states. [2018-11-06 19:55:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:12,396 INFO L93 Difference]: Finished difference Result 1402132 states and 1509921 transitions. [2018-11-06 19:55:12,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-06 19:55:12,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 410 [2018-11-06 19:55:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:15,425 INFO L225 Difference]: With dead ends: 1402132 [2018-11-06 19:55:15,425 INFO L226 Difference]: Without dead ends: 944826 [2018-11-06 19:55:15,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-11-06 19:55:16,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944826 states. [2018-11-06 19:55:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944826 to 806296. [2018-11-06 19:55:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806296 states. [2018-11-06 19:55:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806296 states to 806296 states and 867766 transitions. [2018-11-06 19:55:29,711 INFO L78 Accepts]: Start accepts. Automaton has 806296 states and 867766 transitions. Word has length 410 [2018-11-06 19:55:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:29,711 INFO L480 AbstractCegarLoop]: Abstraction has 806296 states and 867766 transitions. [2018-11-06 19:55:29,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:55:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 806296 states and 867766 transitions. [2018-11-06 19:55:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-11-06 19:55:29,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:29,771 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:55:29,771 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:29,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:29,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1765344062, now seen corresponding path program 1 times [2018-11-06 19:55:29,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:29,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:29,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-06 19:55:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:32,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:32,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:32,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:32,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:32,068 INFO L87 Difference]: Start difference. First operand 806296 states and 867766 transitions. Second operand 4 states. [2018-11-06 19:55:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:49,713 INFO L93 Difference]: Finished difference Result 2048527 states and 2204815 transitions. [2018-11-06 19:55:49,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:55:49,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 424 [2018-11-06 19:55:49,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:51,334 INFO L225 Difference]: With dead ends: 2048527 [2018-11-06 19:55:51,334 INFO L226 Difference]: Without dead ends: 1242233 [2018-11-06 19:55:51,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242233 states. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown