java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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_label44_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 15:00:26,129 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 15:00:26,131 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 15:00:26,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 15:00:26,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 15:00:26,144 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 15:00:26,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 15:00:26,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 15:00:26,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 15:00:26,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 15:00:26,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 15:00:26,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 15:00:26,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 15:00:26,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 15:00:26,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 15:00:26,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 15:00:26,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 15:00:26,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 15:00:26,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 15:00:26,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 15:00:26,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 15:00:26,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 15:00:26,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 15:00:26,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 15:00:26,167 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 15:00:26,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 15:00:26,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 15:00:26,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 15:00:26,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 15:00:26,172 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 15:00:26,172 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 15:00:26,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 15:00:26,173 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 15:00:26,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 15:00:26,175 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 15:00:26,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 15:00:26,176 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 15:00:26,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 15:00:26,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 15:00:26,192 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 15:00:26,193 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 15:00:26,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 15:00:26,194 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 15:00:26,194 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 15:00:26,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 15:00:26,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 15:00:26,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 15:00:26,195 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 15:00:26,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 15:00:26,195 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 15:00:26,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 15:00:26,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 15:00:26,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 15:00:26,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 15:00:26,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 15:00:26,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 15:00:26,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:00:26,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 15:00:26,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 15:00:26,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 15:00:26,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 15:00:26,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 15:00:26,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 15:00:26,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 15:00:26,198 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 15:00:26,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 15:00:26,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 15:00:26,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 15:00:26,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 15:00:26,280 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 15:00:26,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label44_true-unreach-call.c [2018-10-24 15:00:26,343 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6b2722a24/5313b871336749afa686573cc9c9ad85/FLAG81509134f [2018-10-24 15:00:26,985 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 15:00:26,986 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label44_true-unreach-call.c [2018-10-24 15:00:27,011 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6b2722a24/5313b871336749afa686573cc9c9ad85/FLAG81509134f [2018-10-24 15:00:27,032 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6b2722a24/5313b871336749afa686573cc9c9ad85 [2018-10-24 15:00:27,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 15:00:27,046 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 15:00:27,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:27,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 15:00:27,055 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 15:00:27,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:27" (1/1) ... [2018-10-24 15:00:27,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e73589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:27, skipping insertion in model container [2018-10-24 15:00:27,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:27" (1/1) ... [2018-10-24 15:00:27,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 15:00:27,176 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 15:00:27,870 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:27,876 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 15:00:28,199 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:28,221 INFO L193 MainTranslator]: Completed translation [2018-10-24 15:00:28,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28 WrapperNode [2018-10-24 15:00:28,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:28,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:28,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 15:00:28,223 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 15:00:28,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... [2018-10-24 15:00:28,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... [2018-10-24 15:00:28,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:28,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 15:00:28,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 15:00:28,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 15:00:28,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... [2018-10-24 15:00:28,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... [2018-10-24 15:00:28,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... [2018-10-24 15:00:28,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... [2018-10-24 15:00:28,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... [2018-10-24 15:00:28,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... [2018-10-24 15:00:28,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... [2018-10-24 15:00:28,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 15:00:28,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 15:00:28,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 15:00:28,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 15:00:28,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:00:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 15:00:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 15:00:28,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 15:00:34,029 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 15:00:34,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:34 BoogieIcfgContainer [2018-10-24 15:00:34,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 15:00:34,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 15:00:34,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 15:00:34,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 15:00:34,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:00:27" (1/3) ... [2018-10-24 15:00:34,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f61016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:34, skipping insertion in model container [2018-10-24 15:00:34,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:28" (2/3) ... [2018-10-24 15:00:34,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f61016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:34, skipping insertion in model container [2018-10-24 15:00:34,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:34" (3/3) ... [2018-10-24 15:00:34,044 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label44_true-unreach-call.c [2018-10-24 15:00:34,053 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 15:00:34,063 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 15:00:34,081 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 15:00:34,121 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 15:00:34,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 15:00:34,122 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 15:00:34,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 15:00:34,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 15:00:34,122 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 15:00:34,123 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 15:00:34,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 15:00:34,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 15:00:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 15:00:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-24 15:00:34,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:34,171 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, 1, 1, 1, 1, 1] [2018-10-24 15:00:34,174 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:34,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:34,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2027933188, now seen corresponding path program 1 times [2018-10-24 15:00:34,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:34,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:34,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:34,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:34,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:35,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:35,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:35,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:35,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:35,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:35,264 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 15:00:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:38,576 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-24 15:00:38,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:38,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-10-24 15:00:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:38,607 INFO L225 Difference]: With dead ends: 1072 [2018-10-24 15:00:38,608 INFO L226 Difference]: Without dead ends: 762 [2018-10-24 15:00:38,613 INFO L605 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-10-24 15:00:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-24 15:00:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-24 15:00:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-24 15:00:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-24 15:00:38,767 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 178 [2018-10-24 15:00:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:38,768 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-24 15:00:38,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-24 15:00:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-24 15:00:38,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:38,780 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:38,781 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:38,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:38,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1939659693, now seen corresponding path program 1 times [2018-10-24 15:00:38,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:38,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:38,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:38,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:38,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:39,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:39,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:39,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:39,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:39,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:39,088 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-24 15:00:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:42,103 INFO L93 Difference]: Finished difference Result 1918 states and 3253 transitions. [2018-10-24 15:00:42,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:42,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-24 15:00:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:42,113 INFO L225 Difference]: With dead ends: 1918 [2018-10-24 15:00:42,113 INFO L226 Difference]: Without dead ends: 1402 [2018-10-24 15:00:42,117 INFO L605 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-10-24 15:00:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-10-24 15:00:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 933. [2018-10-24 15:00:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-24 15:00:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-24 15:00:42,178 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 184 [2018-10-24 15:00:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:42,179 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-24 15:00:42,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-24 15:00:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-24 15:00:42,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:42,183 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, 1, 1, 1, 1, 1] [2018-10-24 15:00:42,184 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:42,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:42,184 INFO L82 PathProgramCache]: Analyzing trace with hash 177038139, now seen corresponding path program 1 times [2018-10-24 15:00:42,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:42,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:42,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:42,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:42,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:42,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:42,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:42,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:42,324 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-24 15:00:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:45,480 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-24 15:00:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:45,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-10-24 15:00:45,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:45,491 INFO L225 Difference]: With dead ends: 2699 [2018-10-24 15:00:45,491 INFO L226 Difference]: Without dead ends: 1768 [2018-10-24 15:00:45,493 INFO L605 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-10-24 15:00:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-24 15:00:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-24 15:00:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-24 15:00:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-24 15:00:45,530 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 187 [2018-10-24 15:00:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:45,530 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-24 15:00:45,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-24 15:00:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-24 15:00:45,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:45,536 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:45,536 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:45,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1558635668, now seen corresponding path program 1 times [2018-10-24 15:00:45,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:45,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:45,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:45,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:45,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:45,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:45,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:45,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:45,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:45,665 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 4 states. [2018-10-24 15:00:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:48,939 INFO L93 Difference]: Finished difference Result 6814 states and 10581 transitions. [2018-10-24 15:00:48,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:48,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-10-24 15:00:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:48,963 INFO L225 Difference]: With dead ends: 6814 [2018-10-24 15:00:48,963 INFO L226 Difference]: Without dead ends: 5065 [2018-10-24 15:00:48,967 INFO L605 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-10-24 15:00:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2018-10-24 15:00:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 3388. [2018-10-24 15:00:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-10-24 15:00:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4947 transitions. [2018-10-24 15:00:49,039 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4947 transitions. Word has length 194 [2018-10-24 15:00:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:49,039 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 4947 transitions. [2018-10-24 15:00:49,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4947 transitions. [2018-10-24 15:00:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-24 15:00:49,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:49,047 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, 1, 1, 1, 1, 1] [2018-10-24 15:00:49,048 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:49,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1406070287, now seen corresponding path program 1 times [2018-10-24 15:00:49,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:49,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:00:49,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:49,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:49,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:49,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:49,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:49,374 INFO L87 Difference]: Start difference. First operand 3388 states and 4947 transitions. Second operand 3 states. [2018-10-24 15:00:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:50,934 INFO L93 Difference]: Finished difference Result 10057 states and 14733 transitions. [2018-10-24 15:00:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:50,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-10-24 15:00:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:50,960 INFO L225 Difference]: With dead ends: 10057 [2018-10-24 15:00:50,960 INFO L226 Difference]: Without dead ends: 6671 [2018-10-24 15:00:50,966 INFO L605 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-10-24 15:00:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2018-10-24 15:00:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6652. [2018-10-24 15:00:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6652 states. [2018-10-24 15:00:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 9399 transitions. [2018-10-24 15:00:51,082 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 9399 transitions. Word has length 195 [2018-10-24 15:00:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:51,083 INFO L481 AbstractCegarLoop]: Abstraction has 6652 states and 9399 transitions. [2018-10-24 15:00:51,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 9399 transitions. [2018-10-24 15:00:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-24 15:00:51,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:51,097 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:51,097 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:51,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash 995862124, now seen corresponding path program 1 times [2018-10-24 15:00:51,098 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:51,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:51,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:51,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:51,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 15:00:51,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:51,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:51,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:51,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:51,237 INFO L87 Difference]: Start difference. First operand 6652 states and 9399 transitions. Second operand 3 states. [2018-10-24 15:00:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:52,234 INFO L93 Difference]: Finished difference Result 13270 states and 18753 transitions. [2018-10-24 15:00:52,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:52,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-10-24 15:00:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:52,261 INFO L225 Difference]: With dead ends: 13270 [2018-10-24 15:00:52,261 INFO L226 Difference]: Without dead ends: 6620 [2018-10-24 15:00:52,269 INFO L605 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-10-24 15:00:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2018-10-24 15:00:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2018-10-24 15:00:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-10-24 15:00:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 9200 transitions. [2018-10-24 15:00:52,370 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 9200 transitions. Word has length 209 [2018-10-24 15:00:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:52,371 INFO L481 AbstractCegarLoop]: Abstraction has 6620 states and 9200 transitions. [2018-10-24 15:00:52,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 9200 transitions. [2018-10-24 15:00:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-24 15:00:52,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:52,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:00:52,384 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:52,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:52,385 INFO L82 PathProgramCache]: Analyzing trace with hash -362216596, now seen corresponding path program 1 times [2018-10-24 15:00:52,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:52,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:52,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:52,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:52,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:52,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:52,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:52,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:52,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:52,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:52,632 INFO L87 Difference]: Start difference. First operand 6620 states and 9200 transitions. Second operand 3 states. [2018-10-24 15:00:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:54,633 INFO L93 Difference]: Finished difference Result 15495 states and 21391 transitions. [2018-10-24 15:00:54,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:54,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-24 15:00:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:54,672 INFO L225 Difference]: With dead ends: 15495 [2018-10-24 15:00:54,672 INFO L226 Difference]: Without dead ends: 8877 [2018-10-24 15:00:54,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2018-10-24 15:00:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 8876. [2018-10-24 15:00:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8876 states. [2018-10-24 15:00:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8876 states to 8876 states and 12095 transitions. [2018-10-24 15:00:54,934 INFO L78 Accepts]: Start accepts. Automaton has 8876 states and 12095 transitions. Word has length 220 [2018-10-24 15:00:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:54,934 INFO L481 AbstractCegarLoop]: Abstraction has 8876 states and 12095 transitions. [2018-10-24 15:00:54,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 8876 states and 12095 transitions. [2018-10-24 15:00:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-24 15:00:54,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:54,956 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:00:54,956 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:54,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:54,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1263477528, now seen corresponding path program 1 times [2018-10-24 15:00:54,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:54,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:54,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:54,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:54,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:55,330 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 15:00:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:55,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:00:55,448 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:00:55,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:55,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:00:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:00:55,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:00:55,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 15:00:55,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 15:00:55,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 15:00:55,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:00:55,758 INFO L87 Difference]: Start difference. First operand 8876 states and 12095 transitions. Second operand 7 states. [2018-10-24 15:01:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:01,681 INFO L93 Difference]: Finished difference Result 29599 states and 39653 transitions. [2018-10-24 15:01:01,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 15:01:01,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2018-10-24 15:01:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:01,717 INFO L225 Difference]: With dead ends: 29599 [2018-10-24 15:01:01,717 INFO L226 Difference]: Without dead ends: 20725 [2018-10-24 15:01:01,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-24 15:01:01,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20725 states. [2018-10-24 15:01:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20725 to 20719. [2018-10-24 15:01:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20719 states. [2018-10-24 15:01:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 23650 transitions. [2018-10-24 15:01:01,966 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 23650 transitions. Word has length 228 [2018-10-24 15:01:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:01,967 INFO L481 AbstractCegarLoop]: Abstraction has 20719 states and 23650 transitions. [2018-10-24 15:01:01,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 15:01:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 23650 transitions. [2018-10-24 15:01:01,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-24 15:01:01,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:01,996 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, 1, 1, 1, 1, 1] [2018-10-24 15:01:01,996 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:01,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash -162429184, now seen corresponding path program 1 times [2018-10-24 15:01:01,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:01,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:01,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:01:02,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:02,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:02,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:02,152 INFO L87 Difference]: Start difference. First operand 20719 states and 23650 transitions. Second operand 3 states. [2018-10-24 15:01:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:03,826 INFO L93 Difference]: Finished difference Result 40008 states and 45800 transitions. [2018-10-24 15:01:03,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:03,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-24 15:01:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:03,868 INFO L225 Difference]: With dead ends: 40008 [2018-10-24 15:01:03,868 INFO L226 Difference]: Without dead ends: 19291 [2018-10-24 15:01:03,886 INFO L605 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-10-24 15:01:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19291 states. [2018-10-24 15:01:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19291 to 19286. [2018-10-24 15:01:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19286 states. [2018-10-24 15:01:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19286 states to 19286 states and 21819 transitions. [2018-10-24 15:01:04,107 INFO L78 Accepts]: Start accepts. Automaton has 19286 states and 21819 transitions. Word has length 230 [2018-10-24 15:01:04,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:04,107 INFO L481 AbstractCegarLoop]: Abstraction has 19286 states and 21819 transitions. [2018-10-24 15:01:04,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 19286 states and 21819 transitions. [2018-10-24 15:01:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-24 15:01:04,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:04,136 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:01:04,136 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:04,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash -68785608, now seen corresponding path program 1 times [2018-10-24 15:01:04,136 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:04,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:04,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:04,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 15:01:04,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:04,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:04,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:04,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:04,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:04,270 INFO L87 Difference]: Start difference. First operand 19286 states and 21819 transitions. Second operand 3 states. [2018-10-24 15:01:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:05,780 INFO L93 Difference]: Finished difference Result 43672 states and 49854 transitions. [2018-10-24 15:01:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:05,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-24 15:01:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:05,806 INFO L225 Difference]: With dead ends: 43672 [2018-10-24 15:01:05,806 INFO L226 Difference]: Without dead ends: 24388 [2018-10-24 15:01:05,823 INFO L605 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-10-24 15:01:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24388 states. [2018-10-24 15:01:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24388 to 24385. [2018-10-24 15:01:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24385 states. [2018-10-24 15:01:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24385 states to 24385 states and 26949 transitions. [2018-10-24 15:01:06,089 INFO L78 Accepts]: Start accepts. Automaton has 24385 states and 26949 transitions. Word has length 237 [2018-10-24 15:01:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:06,089 INFO L481 AbstractCegarLoop]: Abstraction has 24385 states and 26949 transitions. [2018-10-24 15:01:06,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 24385 states and 26949 transitions. [2018-10-24 15:01:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-24 15:01:06,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:06,115 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:06,115 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:06,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1345461011, now seen corresponding path program 1 times [2018-10-24 15:01:06,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:06,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:06,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:06,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:06,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 15:01:06,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:06,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:06,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:06,559 INFO L87 Difference]: Start difference. First operand 24385 states and 26949 transitions. Second operand 4 states. [2018-10-24 15:01:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:07,704 INFO L93 Difference]: Finished difference Result 48164 states and 53270 transitions. [2018-10-24 15:01:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:07,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2018-10-24 15:01:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:07,725 INFO L225 Difference]: With dead ends: 48164 [2018-10-24 15:01:07,725 INFO L226 Difference]: Without dead ends: 23781 [2018-10-24 15:01:07,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23781 states. [2018-10-24 15:01:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23781 to 23770. [2018-10-24 15:01:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23770 states. [2018-10-24 15:01:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23770 states to 23770 states and 26127 transitions. [2018-10-24 15:01:07,958 INFO L78 Accepts]: Start accepts. Automaton has 23770 states and 26127 transitions. Word has length 289 [2018-10-24 15:01:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:07,958 INFO L481 AbstractCegarLoop]: Abstraction has 23770 states and 26127 transitions. [2018-10-24 15:01:07,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 23770 states and 26127 transitions. [2018-10-24 15:01:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-24 15:01:07,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:07,975 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:07,975 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:07,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:07,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2113406810, now seen corresponding path program 1 times [2018-10-24 15:01:07,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:07,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:07,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:07,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:07,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 15:01:08,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:08,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:08,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:08,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:08,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:08,203 INFO L87 Difference]: Start difference. First operand 23770 states and 26127 transitions. Second operand 3 states. [2018-10-24 15:01:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:09,135 INFO L93 Difference]: Finished difference Result 47536 states and 52250 transitions. [2018-10-24 15:01:09,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:09,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-10-24 15:01:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:09,154 INFO L225 Difference]: With dead ends: 47536 [2018-10-24 15:01:09,154 INFO L226 Difference]: Without dead ends: 23768 [2018-10-24 15:01:09,167 INFO L605 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-10-24 15:01:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23768 states. [2018-10-24 15:01:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23768 to 23768. [2018-10-24 15:01:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23768 states. [2018-10-24 15:01:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23768 states to 23768 states and 26123 transitions. [2018-10-24 15:01:09,366 INFO L78 Accepts]: Start accepts. Automaton has 23768 states and 26123 transitions. Word has length 317 [2018-10-24 15:01:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:09,366 INFO L481 AbstractCegarLoop]: Abstraction has 23768 states and 26123 transitions. [2018-10-24 15:01:09,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 23768 states and 26123 transitions. [2018-10-24 15:01:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-24 15:01:09,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:09,380 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:01:09,381 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:09,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1833264674, now seen corresponding path program 1 times [2018-10-24 15:01:09,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:09,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:09,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:09,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:09,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:09,878 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 15:01:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 15:01:09,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:09,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:09,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:01:09,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:01:09,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:09,983 INFO L87 Difference]: Start difference. First operand 23768 states and 26123 transitions. Second operand 5 states. [2018-10-24 15:01:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:12,253 INFO L93 Difference]: Finished difference Result 66805 states and 73669 transitions. [2018-10-24 15:01:12,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:01:12,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2018-10-24 15:01:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:12,290 INFO L225 Difference]: With dead ends: 66805 [2018-10-24 15:01:12,291 INFO L226 Difference]: Without dead ends: 43039 [2018-10-24 15:01:12,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43039 states. [2018-10-24 15:01:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43039 to 41383. [2018-10-24 15:01:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41383 states. [2018-10-24 15:01:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41383 states to 41383 states and 45570 transitions. [2018-10-24 15:01:12,638 INFO L78 Accepts]: Start accepts. Automaton has 41383 states and 45570 transitions. Word has length 327 [2018-10-24 15:01:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:12,638 INFO L481 AbstractCegarLoop]: Abstraction has 41383 states and 45570 transitions. [2018-10-24 15:01:12,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:01:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 41383 states and 45570 transitions. [2018-10-24 15:01:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-24 15:01:12,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:12,657 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:12,657 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:12,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash -153782652, now seen corresponding path program 1 times [2018-10-24 15:01:12,658 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:12,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:12,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-24 15:01:13,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:13,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:13,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:13,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:13,006 INFO L87 Difference]: Start difference. First operand 41383 states and 45570 transitions. Second operand 4 states. [2018-10-24 15:01:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:15,187 INFO L93 Difference]: Finished difference Result 86252 states and 95150 transitions. [2018-10-24 15:01:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:15,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-10-24 15:01:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:15,229 INFO L225 Difference]: With dead ends: 86252 [2018-10-24 15:01:15,230 INFO L226 Difference]: Without dead ends: 44871 [2018-10-24 15:01:15,250 INFO L605 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-10-24 15:01:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44871 states. [2018-10-24 15:01:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44871 to 44860. [2018-10-24 15:01:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44860 states. [2018-10-24 15:01:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44860 states to 44860 states and 49424 transitions. [2018-10-24 15:01:15,632 INFO L78 Accepts]: Start accepts. Automaton has 44860 states and 49424 transitions. Word has length 333 [2018-10-24 15:01:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:15,632 INFO L481 AbstractCegarLoop]: Abstraction has 44860 states and 49424 transitions. [2018-10-24 15:01:15,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 44860 states and 49424 transitions. [2018-10-24 15:01:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-24 15:01:15,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:15,656 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:01:15,657 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:15,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1951369640, now seen corresponding path program 1 times [2018-10-24 15:01:15,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:15,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:15,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:15,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:16,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:16,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:16,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:16,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:16,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:16,125 INFO L87 Difference]: Start difference. First operand 44860 states and 49424 transitions. Second operand 3 states. [2018-10-24 15:01:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:17,548 INFO L93 Difference]: Finished difference Result 92984 states and 102537 transitions. [2018-10-24 15:01:17,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:17,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-24 15:01:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:17,594 INFO L225 Difference]: With dead ends: 92984 [2018-10-24 15:01:17,595 INFO L226 Difference]: Without dead ends: 48126 [2018-10-24 15:01:17,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:17,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48126 states. [2018-10-24 15:01:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48126 to 48124. [2018-10-24 15:01:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48124 states. [2018-10-24 15:01:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48124 states to 48124 states and 52868 transitions. [2018-10-24 15:01:18,045 INFO L78 Accepts]: Start accepts. Automaton has 48124 states and 52868 transitions. Word has length 348 [2018-10-24 15:01:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:18,045 INFO L481 AbstractCegarLoop]: Abstraction has 48124 states and 52868 transitions. [2018-10-24 15:01:18,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 48124 states and 52868 transitions. [2018-10-24 15:01:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-24 15:01:18,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:18,065 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:18,066 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:18,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1820103627, now seen corresponding path program 1 times [2018-10-24 15:01:18,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:18,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:18,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-24 15:01:18,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:18,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:18,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:18,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:18,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:18,463 INFO L87 Difference]: Start difference. First operand 48124 states and 52868 transitions. Second operand 4 states. [2018-10-24 15:01:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:19,497 INFO L93 Difference]: Finished difference Result 182061 states and 200055 transitions. [2018-10-24 15:01:19,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:19,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2018-10-24 15:01:19,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:19,624 INFO L225 Difference]: With dead ends: 182061 [2018-10-24 15:01:19,624 INFO L226 Difference]: Without dead ends: 133939 [2018-10-24 15:01:19,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133939 states. [2018-10-24 15:01:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133939 to 87246. [2018-10-24 15:01:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87246 states. [2018-10-24 15:01:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87246 states to 87246 states and 95790 transitions. [2018-10-24 15:01:21,075 INFO L78 Accepts]: Start accepts. Automaton has 87246 states and 95790 transitions. Word has length 361 [2018-10-24 15:01:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:21,075 INFO L481 AbstractCegarLoop]: Abstraction has 87246 states and 95790 transitions. [2018-10-24 15:01:21,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 87246 states and 95790 transitions. [2018-10-24 15:01:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-24 15:01:21,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:21,092 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:21,093 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:21,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash 582272980, now seen corresponding path program 1 times [2018-10-24 15:01:21,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:21,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:21,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:21,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:21,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 190 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-24 15:01:21,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:21,613 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:01:21,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:21,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 15:01:21,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:21,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 15:01:21,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:01:21,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:01:21,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:21,953 INFO L87 Difference]: Start difference. First operand 87246 states and 95790 transitions. Second operand 5 states. [2018-10-24 15:01:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:26,099 INFO L93 Difference]: Finished difference Result 166273 states and 182877 transitions. [2018-10-24 15:01:26,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:26,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 362 [2018-10-24 15:01:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:26,241 INFO L225 Difference]: With dead ends: 166273 [2018-10-24 15:01:26,241 INFO L226 Difference]: Without dead ends: 79029 [2018-10-24 15:01:26,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79029 states. [2018-10-24 15:01:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79029 to 77387. [2018-10-24 15:01:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77387 states. [2018-10-24 15:01:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77387 states to 77387 states and 84603 transitions. [2018-10-24 15:01:28,634 INFO L78 Accepts]: Start accepts. Automaton has 77387 states and 84603 transitions. Word has length 362 [2018-10-24 15:01:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:28,635 INFO L481 AbstractCegarLoop]: Abstraction has 77387 states and 84603 transitions. [2018-10-24 15:01:28,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:01:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 77387 states and 84603 transitions. [2018-10-24 15:01:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-24 15:01:28,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:28,710 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:01:28,710 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:28,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:28,712 INFO L82 PathProgramCache]: Analyzing trace with hash 160490144, now seen corresponding path program 1 times [2018-10-24 15:01:28,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:28,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:28,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:28,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:28,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:29,268 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 15:01:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-10-24 15:01:29,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:29,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:29,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:29,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:29,403 INFO L87 Difference]: Start difference. First operand 77387 states and 84603 transitions. Second operand 4 states. [2018-10-24 15:01:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:32,566 INFO L93 Difference]: Finished difference Result 155194 states and 169699 transitions. [2018-10-24 15:01:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:32,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2018-10-24 15:01:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:32,649 INFO L225 Difference]: With dead ends: 155194 [2018-10-24 15:01:32,650 INFO L226 Difference]: Without dead ends: 77809 [2018-10-24 15:01:32,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77809 states. [2018-10-24 15:01:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77809 to 77180. [2018-10-24 15:01:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77180 states. [2018-10-24 15:01:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77180 states to 77180 states and 84249 transitions. [2018-10-24 15:01:33,678 INFO L78 Accepts]: Start accepts. Automaton has 77180 states and 84249 transitions. Word has length 398 [2018-10-24 15:01:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:33,679 INFO L481 AbstractCegarLoop]: Abstraction has 77180 states and 84249 transitions. [2018-10-24 15:01:33,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 77180 states and 84249 transitions. [2018-10-24 15:01:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-24 15:01:33,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:33,710 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:01:33,710 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:33,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash -90678840, now seen corresponding path program 1 times [2018-10-24 15:01:33,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:33,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:33,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:33,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:33,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-24 15:01:34,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:34,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:34,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:34,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:34,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:34,092 INFO L87 Difference]: Start difference. First operand 77180 states and 84249 transitions. Second operand 4 states. [2018-10-24 15:01:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:37,372 INFO L93 Difference]: Finished difference Result 219412 states and 238730 transitions. [2018-10-24 15:01:37,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:37,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 404 [2018-10-24 15:01:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:37,544 INFO L225 Difference]: With dead ends: 219412 [2018-10-24 15:01:37,544 INFO L226 Difference]: Without dead ends: 142234 [2018-10-24 15:01:37,606 INFO L605 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-10-24 15:01:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142234 states. [2018-10-24 15:01:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142234 to 140382. [2018-10-24 15:01:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140382 states. [2018-10-24 15:01:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140382 states to 140382 states and 152503 transitions. [2018-10-24 15:01:39,054 INFO L78 Accepts]: Start accepts. Automaton has 140382 states and 152503 transitions. Word has length 404 [2018-10-24 15:01:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:39,055 INFO L481 AbstractCegarLoop]: Abstraction has 140382 states and 152503 transitions. [2018-10-24 15:01:39,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 140382 states and 152503 transitions. [2018-10-24 15:01:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-24 15:01:39,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:39,086 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:01:39,086 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:39,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1911073964, now seen corresponding path program 1 times [2018-10-24 15:01:39,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:39,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:39,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:39,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-10-24 15:01:39,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:39,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:39,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:01:39,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:01:39,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:39,388 INFO L87 Difference]: Start difference. First operand 140382 states and 152503 transitions. Second operand 5 states. [2018-10-24 15:01:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:43,193 INFO L93 Difference]: Finished difference Result 370715 states and 401650 transitions. [2018-10-24 15:01:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:01:43,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 416 [2018-10-24 15:01:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:43,446 INFO L225 Difference]: With dead ends: 370715 [2018-10-24 15:01:43,447 INFO L226 Difference]: Without dead ends: 230539 [2018-10-24 15:01:43,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230539 states. [2018-10-24 15:01:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230539 to 222349. [2018-10-24 15:01:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222349 states. [2018-10-24 15:01:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222349 states to 222349 states and 240055 transitions. [2018-10-24 15:01:47,380 INFO L78 Accepts]: Start accepts. Automaton has 222349 states and 240055 transitions. Word has length 416 [2018-10-24 15:01:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:47,380 INFO L481 AbstractCegarLoop]: Abstraction has 222349 states and 240055 transitions. [2018-10-24 15:01:47,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:01:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 222349 states and 240055 transitions. [2018-10-24 15:01:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-24 15:01:47,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:47,409 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:47,410 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:47,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash -202726217, now seen corresponding path program 1 times [2018-10-24 15:01:47,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:47,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:47,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:47,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:47,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:47,862 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 15:01:48,151 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 15:01:48,377 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 15:01:49,008 WARN L179 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-24 15:01:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 267 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:49,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:49,875 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:01:49,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:50,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-24 15:01:50,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:50,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2018-10-24 15:01:50,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 15:01:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 15:01:50,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-24 15:01:50,397 INFO L87 Difference]: Start difference. First operand 222349 states and 240055 transitions. Second operand 16 states. [2018-10-24 15:01:50,726 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 15:01:51,903 WARN L179 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2018-10-24 15:02:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:24,443 INFO L93 Difference]: Finished difference Result 847090 states and 914358 transitions. [2018-10-24 15:02:24,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-24 15:02:24,443 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 421 [2018-10-24 15:02:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:25,105 INFO L225 Difference]: With dead ends: 847090 [2018-10-24 15:02:25,105 INFO L226 Difference]: Without dead ends: 624947 [2018-10-24 15:02:25,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3196 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1646, Invalid=6726, Unknown=0, NotChecked=0, Total=8372 [2018-10-24 15:02:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624947 states. [2018-10-24 15:02:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624947 to 458440. [2018-10-24 15:02:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458440 states. [2018-10-24 15:02:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458440 states to 458440 states and 493938 transitions. [2018-10-24 15:02:33,141 INFO L78 Accepts]: Start accepts. Automaton has 458440 states and 493938 transitions. Word has length 421 [2018-10-24 15:02:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:33,142 INFO L481 AbstractCegarLoop]: Abstraction has 458440 states and 493938 transitions. [2018-10-24 15:02:33,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 15:02:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 458440 states and 493938 transitions. [2018-10-24 15:02:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-10-24 15:02:33,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:33,208 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:02:33,208 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:33,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:33,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1819457701, now seen corresponding path program 1 times [2018-10-24 15:02:33,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:33,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:33,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:33,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:33,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-24 15:02:33,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:33,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:02:33,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:33,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:33,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:33,615 INFO L87 Difference]: Start difference. First operand 458440 states and 493938 transitions. Second operand 4 states. [2018-10-24 15:02:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:39,431 INFO L93 Difference]: Finished difference Result 920163 states and 991305 transitions. [2018-10-24 15:02:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:39,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 461 [2018-10-24 15:02:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:39,947 INFO L225 Difference]: With dead ends: 920163 [2018-10-24 15:02:39,947 INFO L226 Difference]: Without dead ends: 461929 [2018-10-24 15:02:40,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461929 states. [2018-10-24 15:02:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461929 to 456399. [2018-10-24 15:02:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456399 states. [2018-10-24 15:02:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456399 states to 456399 states and 490645 transitions. [2018-10-24 15:02:54,491 INFO L78 Accepts]: Start accepts. Automaton has 456399 states and 490645 transitions. Word has length 461 [2018-10-24 15:02:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:54,491 INFO L481 AbstractCegarLoop]: Abstraction has 456399 states and 490645 transitions. [2018-10-24 15:02:54,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 456399 states and 490645 transitions. [2018-10-24 15:02:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-10-24 15:02:54,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:54,550 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:02:54,550 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:54,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash 873961078, now seen corresponding path program 1 times [2018-10-24 15:02:54,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:54,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:54,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:54,980 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 15:02:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 392 proven. 36 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-24 15:02:55,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:02:55,876 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:02:55,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:56,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:02:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-24 15:02:57,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:02:57,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 15:02:57,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 15:02:57,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 15:02:57,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-24 15:02:57,219 INFO L87 Difference]: Start difference. First operand 456399 states and 490645 transitions. Second operand 11 states. [2018-10-24 15:03:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:17,267 INFO L93 Difference]: Finished difference Result 2033014 states and 2186882 transitions. [2018-10-24 15:03:17,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 15:03:17,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 485 [2018-10-24 15:03:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:21,164 INFO L225 Difference]: With dead ends: 2033014 [2018-10-24 15:03:21,164 INFO L226 Difference]: Without dead ends: 1576817 [2018-10-24 15:03:21,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2018-10-24 15:03:22,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576817 states. Received shutdown request... [2018-10-24 15:03:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576817 to 1394916. [2018-10-24 15:03:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394916 states. [2018-10-24 15:03:55,467 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:03:55,472 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:03:55,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:03:55 BoogieIcfgContainer [2018-10-24 15:03:55,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:03:55,473 INFO L168 Benchmark]: Toolchain (without parser) took 208428.03 ms. Allocated memory was 1.5 GB in the beginning and 6.4 GB in the end (delta: 4.8 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -986.1 MB). Peak memory consumption was 5.3 GB. Max. memory is 7.1 GB. [2018-10-24 15:03:55,474 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:03:55,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1172.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:55,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 313.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.4 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:55,476 INFO L168 Benchmark]: Boogie Preprocessor took 147.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:55,476 INFO L168 Benchmark]: RCFGBuilder took 5346.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.8 MB). Peak memory consumption was 253.8 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:55,477 INFO L168 Benchmark]: TraceAbstraction took 201439.86 ms. Allocated memory was 2.3 GB in the beginning and 6.4 GB in the end (delta: 4.1 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -462.7 MB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. [2018-10-24 15:03:55,482 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1172.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 313.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.4 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5346.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.8 MB). Peak memory consumption was 253.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 201439.86 ms. Allocated memory was 2.3 GB in the beginning and 6.4 GB in the end (delta: 4.1 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -462.7 MB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1566]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1566). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 201.3s OverallTime, 23 OverallIterations, 6 TraceHistogramMax, 116.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5678 SDtfs, 30679 SDslu, 5398 SDs, 0 SdLazy, 42912 SolverSat, 7134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1693 GetRequests, 1533 SyntacticMatches, 6 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3300 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458440occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 69.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 235164 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 8480 NumberOfCodeBlocks, 8480 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 8453 ConstructedInterpolants, 0 QuantifiedInterpolants, 9697552 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2496 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 5714/5942 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown