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_label01_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:35,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:35,268 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:35,286 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:35,286 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:35,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:35,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:35,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:35,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:35,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:35,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:35,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:35,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:35,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:35,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:35,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:35,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:35,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:35,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:35,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:35,305 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:35,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:35,309 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:35,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:35,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:35,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:35,312 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:35,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:35,313 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:35,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:35,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:35,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:35,315 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:35,315 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:35,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:35,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:35,317 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 14:53:35,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:35,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:35,341 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:35,342 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:35,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:35,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:35,345 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:35,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:35,346 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:35,346 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:35,346 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:35,347 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:35,347 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:35,347 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:35,347 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:35,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:35,348 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:35,348 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:35,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:35,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:35,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:35,349 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:35,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:35,350 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:35,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:35,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:35,351 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:35,351 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:35,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:35,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:35,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:35,439 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:35,439 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:35,440 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label01_true-unreach-call.c [2018-10-24 14:53:35,506 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6452fab68/a07392a6d78c4cf6be3eef0736dac48a/FLAGac8956eef [2018-10-24 14:53:36,219 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:36,220 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label01_true-unreach-call.c [2018-10-24 14:53:36,240 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6452fab68/a07392a6d78c4cf6be3eef0736dac48a/FLAGac8956eef [2018-10-24 14:53:36,255 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6452fab68/a07392a6d78c4cf6be3eef0736dac48a [2018-10-24 14:53:36,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:36,270 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:36,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:36,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:36,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:36,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:36" (1/1) ... [2018-10-24 14:53:36,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f4c327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:36, skipping insertion in model container [2018-10-24 14:53:36,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:36" (1/1) ... [2018-10-24 14:53:36,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:36,386 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:37,059 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:37,066 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:37,445 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:37,468 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:37,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37 WrapperNode [2018-10-24 14:53:37,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:37,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:37,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:37,471 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:37,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:37,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:37,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:37,775 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:37,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:37,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:37,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:37,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:37,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (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 14:53:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:37,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:37,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:53:43,391 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:53:43,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:43 BoogieIcfgContainer [2018-10-24 14:53:43,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:53:43,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:53:43,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:53:43,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:53:43,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:36" (1/3) ... [2018-10-24 14:53:43,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b02d0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:43, skipping insertion in model container [2018-10-24 14:53:43,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37" (2/3) ... [2018-10-24 14:53:43,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b02d0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:43, skipping insertion in model container [2018-10-24 14:53:43,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:43" (3/3) ... [2018-10-24 14:53:43,405 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label01_true-unreach-call.c [2018-10-24 14:53:43,417 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:53:43,431 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:53:43,454 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:53:43,508 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:53:43,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:53:43,510 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:53:43,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:53:43,510 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:53:43,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:53:43,510 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:53:43,510 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:53:43,511 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:53:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:53:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-24 14:53:43,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:43,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:43,579 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:43,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 500899498, now seen corresponding path program 1 times [2018-10-24 14:53:43,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:43,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:43,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:43,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:44,520 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 14:53:44,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:44,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:44,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:44,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:44,548 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:53:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:47,876 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-10-24 14:53:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:53:47,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-10-24 14:53:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:47,906 INFO L225 Difference]: With dead ends: 1079 [2018-10-24 14:53:47,906 INFO L226 Difference]: Without dead ends: 769 [2018-10-24 14:53:47,914 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 14:53:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-24 14:53:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-10-24 14:53:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-24 14:53:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-10-24 14:53:48,025 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 187 [2018-10-24 14:53:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:48,027 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-10-24 14:53:48,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:53:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-10-24 14:53:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-24 14:53:48,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:48,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:48,035 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:48,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:48,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1372054603, now seen corresponding path program 1 times [2018-10-24 14:53:48,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:48,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:48,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:48,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:48,193 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 14:53:48,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:48,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:48,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:48,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:48,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:48,199 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-10-24 14:53:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:50,724 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-10-24 14:53:50,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:50,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-10-24 14:53:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:50,731 INFO L225 Difference]: With dead ends: 1449 [2018-10-24 14:53:50,731 INFO L226 Difference]: Without dead ends: 938 [2018-10-24 14:53:50,734 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 14:53:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-24 14:53:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-10-24 14:53:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 14:53:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 14:53:50,765 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 196 [2018-10-24 14:53:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:50,766 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 14:53:50,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 14:53:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-24 14:53:50,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:50,771 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:50,771 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:50,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2059946413, now seen corresponding path program 1 times [2018-10-24 14:53:50,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:50,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:50,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:50,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:50,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:50,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:50,909 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-24 14:53:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:52,767 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-10-24 14:53:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:52,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-10-24 14:53:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:52,773 INFO L225 Difference]: With dead ends: 1823 [2018-10-24 14:53:52,774 INFO L226 Difference]: Without dead ends: 902 [2018-10-24 14:53:52,775 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 14:53:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-10-24 14:53:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-10-24 14:53:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-24 14:53:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-10-24 14:53:52,796 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 201 [2018-10-24 14:53:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:52,796 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-10-24 14:53:52,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-10-24 14:53:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-24 14:53:52,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:52,801 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:52,801 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:52,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:52,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1358130798, now seen corresponding path program 1 times [2018-10-24 14:53:52,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:52,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:52,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:52,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:52,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:53:52,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:52,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:52,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:52,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:52,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:52,909 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-10-24 14:53:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:56,686 INFO L93 Difference]: Finished difference Result 3476 states and 5598 transitions. [2018-10-24 14:53:56,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:53:56,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-10-24 14:53:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:56,701 INFO L225 Difference]: With dead ends: 3476 [2018-10-24 14:53:56,702 INFO L226 Difference]: Without dead ends: 2576 [2018-10-24 14:53:56,704 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 14:53:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-10-24 14:53:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1723. [2018-10-24 14:53:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-10-24 14:53:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-10-24 14:53:56,751 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 203 [2018-10-24 14:53:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:56,751 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-10-24 14:53:56,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:53:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-10-24 14:53:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-24 14:53:56,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:56,758 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:56,758 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:56,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1034487718, now seen corresponding path program 1 times [2018-10-24 14:53:56,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:56,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:56,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:53:56,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:56,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:56,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:56,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:56,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:56,969 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-10-24 14:53:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:57,513 INFO L93 Difference]: Finished difference Result 5159 states and 7797 transitions. [2018-10-24 14:53:57,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:57,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-10-24 14:53:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:57,533 INFO L225 Difference]: With dead ends: 5159 [2018-10-24 14:53:57,533 INFO L226 Difference]: Without dead ends: 3438 [2018-10-24 14:53:57,536 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 14:53:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2018-10-24 14:53:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3436. [2018-10-24 14:53:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-24 14:53:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 5189 transitions. [2018-10-24 14:53:57,608 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 5189 transitions. Word has length 210 [2018-10-24 14:53:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:57,608 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 5189 transitions. [2018-10-24 14:53:57,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5189 transitions. [2018-10-24 14:53:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-24 14:53:57,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:57,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:57,616 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:57,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:57,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1212632274, now seen corresponding path program 1 times [2018-10-24 14:53:57,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:57,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:57,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:57,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:57,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:58,138 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:53:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:58,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:58,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:53:58,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:53:58,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:53:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:53:58,199 INFO L87 Difference]: Start difference. First operand 3436 states and 5189 transitions. Second operand 5 states. [2018-10-24 14:54:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:00,988 INFO L93 Difference]: Finished difference Result 7939 states and 12127 transitions. [2018-10-24 14:54:00,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:00,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2018-10-24 14:54:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:01,009 INFO L225 Difference]: With dead ends: 7939 [2018-10-24 14:54:01,009 INFO L226 Difference]: Without dead ends: 4505 [2018-10-24 14:54:01,015 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 14:54:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2018-10-24 14:54:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3640. [2018-10-24 14:54:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3640 states. [2018-10-24 14:54:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5424 transitions. [2018-10-24 14:54:01,086 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5424 transitions. Word has length 227 [2018-10-24 14:54:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:01,086 INFO L481 AbstractCegarLoop]: Abstraction has 3640 states and 5424 transitions. [2018-10-24 14:54:01,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5424 transitions. [2018-10-24 14:54:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-24 14:54:01,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:01,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:01,094 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:01,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:01,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1055986886, now seen corresponding path program 1 times [2018-10-24 14:54:01,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:01,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:01,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:01,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:01,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:01,341 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 14:54:01,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:01,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:01,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:01,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:01,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:01,343 INFO L87 Difference]: Start difference. First operand 3640 states and 5424 transitions. Second operand 3 states. [2018-10-24 14:54:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:02,765 INFO L93 Difference]: Finished difference Result 8933 states and 13269 transitions. [2018-10-24 14:54:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:02,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-10-24 14:54:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:02,783 INFO L225 Difference]: With dead ends: 8933 [2018-10-24 14:54:02,784 INFO L226 Difference]: Without dead ends: 5295 [2018-10-24 14:54:02,793 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 14:54:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2018-10-24 14:54:02,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5293. [2018-10-24 14:54:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2018-10-24 14:54:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7795 transitions. [2018-10-24 14:54:02,888 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7795 transitions. Word has length 229 [2018-10-24 14:54:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:02,889 INFO L481 AbstractCegarLoop]: Abstraction has 5293 states and 7795 transitions. [2018-10-24 14:54:02,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7795 transitions. [2018-10-24 14:54:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-24 14:54:02,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:02,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:02,901 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:02,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash 150187278, now seen corresponding path program 1 times [2018-10-24 14:54:02,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:02,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:02,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:02,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:03,245 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 14:54:03,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:03,245 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 14:54:03,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:03,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:03,578 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 14:54:03,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:03,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:54:03,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:54:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:54:03,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:54:03,613 INFO L87 Difference]: Start difference. First operand 5293 states and 7795 transitions. Second operand 7 states. [2018-10-24 14:54:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:11,985 INFO L93 Difference]: Finished difference Result 28244 states and 40515 transitions. [2018-10-24 14:54:11,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:54:11,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2018-10-24 14:54:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:12,050 INFO L225 Difference]: With dead ends: 28244 [2018-10-24 14:54:12,050 INFO L226 Difference]: Without dead ends: 22953 [2018-10-24 14:54:12,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:54:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22953 states. [2018-10-24 14:54:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22953 to 22932. [2018-10-24 14:54:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22932 states. [2018-10-24 14:54:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22932 states to 22932 states and 28766 transitions. [2018-10-24 14:54:12,497 INFO L78 Accepts]: Start accepts. Automaton has 22932 states and 28766 transitions. Word has length 237 [2018-10-24 14:54:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:12,498 INFO L481 AbstractCegarLoop]: Abstraction has 22932 states and 28766 transitions. [2018-10-24 14:54:12,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:54:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 22932 states and 28766 transitions. [2018-10-24 14:54:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-24 14:54:12,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:12,531 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:54:12,531 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:12,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1779742464, now seen corresponding path program 1 times [2018-10-24 14:54:12,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:12,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:12,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:12,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 14:54:12,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:12,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:12,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:12,690 INFO L87 Difference]: Start difference. First operand 22932 states and 28766 transitions. Second operand 3 states. [2018-10-24 14:54:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:14,413 INFO L93 Difference]: Finished difference Result 64222 states and 80670 transitions. [2018-10-24 14:54:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:14,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2018-10-24 14:54:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:14,488 INFO L225 Difference]: With dead ends: 64222 [2018-10-24 14:54:14,488 INFO L226 Difference]: Without dead ends: 41292 [2018-10-24 14:54:14,515 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 14:54:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41292 states. [2018-10-24 14:54:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41292 to 41290. [2018-10-24 14:54:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41290 states. [2018-10-24 14:54:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41290 states to 41290 states and 49438 transitions. [2018-10-24 14:54:15,042 INFO L78 Accepts]: Start accepts. Automaton has 41290 states and 49438 transitions. Word has length 266 [2018-10-24 14:54:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:15,043 INFO L481 AbstractCegarLoop]: Abstraction has 41290 states and 49438 transitions. [2018-10-24 14:54:15,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 41290 states and 49438 transitions. [2018-10-24 14:54:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-24 14:54:15,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:15,093 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:15,093 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:15,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1324710129, now seen corresponding path program 1 times [2018-10-24 14:54:15,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:15,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:15,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:15,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:15,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 14:54:15,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:15,473 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 14:54:15,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:15,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 14:54:16,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:16,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 14:54:16,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:16,115 INFO L87 Difference]: Start difference. First operand 41290 states and 49438 transitions. Second operand 5 states. [2018-10-24 14:54:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:18,917 INFO L93 Difference]: Finished difference Result 102770 states and 126322 transitions. [2018-10-24 14:54:18,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:18,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2018-10-24 14:54:18,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:19,027 INFO L225 Difference]: With dead ends: 102770 [2018-10-24 14:54:19,027 INFO L226 Difference]: Without dead ends: 61482 [2018-10-24 14:54:19,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 2 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 14:54:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61482 states. [2018-10-24 14:54:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61482 to 60662. [2018-10-24 14:54:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60662 states. [2018-10-24 14:54:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60662 states to 60662 states and 71368 transitions. [2018-10-24 14:54:19,725 INFO L78 Accepts]: Start accepts. Automaton has 60662 states and 71368 transitions. Word has length 279 [2018-10-24 14:54:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:19,725 INFO L481 AbstractCegarLoop]: Abstraction has 60662 states and 71368 transitions. [2018-10-24 14:54:19,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 60662 states and 71368 transitions. [2018-10-24 14:54:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-24 14:54:19,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:19,776 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:54:19,777 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:19,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2030925982, now seen corresponding path program 1 times [2018-10-24 14:54:19,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:19,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:19,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 14:54:20,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:20,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:20,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:20,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:20,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:20,289 INFO L87 Difference]: Start difference. First operand 60662 states and 71368 transitions. Second operand 3 states. [2018-10-24 14:54:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:22,944 INFO L93 Difference]: Finished difference Result 118871 states and 139766 transitions. [2018-10-24 14:54:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:22,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-10-24 14:54:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:23,006 INFO L225 Difference]: With dead ends: 118871 [2018-10-24 14:54:23,007 INFO L226 Difference]: Without dead ends: 58211 [2018-10-24 14:54:23,042 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 14:54:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58211 states. [2018-10-24 14:54:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58211 to 58003. [2018-10-24 14:54:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58003 states. [2018-10-24 14:54:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58003 states to 58003 states and 65745 transitions. [2018-10-24 14:54:23,566 INFO L78 Accepts]: Start accepts. Automaton has 58003 states and 65745 transitions. Word has length 381 [2018-10-24 14:54:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:23,566 INFO L481 AbstractCegarLoop]: Abstraction has 58003 states and 65745 transitions. [2018-10-24 14:54:23,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 58003 states and 65745 transitions. [2018-10-24 14:54:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-24 14:54:23,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:23,610 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:23,611 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:23,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash 781152955, now seen corresponding path program 1 times [2018-10-24 14:54:23,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:23,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:23,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-10-24 14:54:23,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:23,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:23,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:23,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:23,855 INFO L87 Difference]: Start difference. First operand 58003 states and 65745 transitions. Second operand 3 states. [2018-10-24 14:54:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:24,819 INFO L93 Difference]: Finished difference Result 116000 states and 131484 transitions. [2018-10-24 14:54:24,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:24,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 390 [2018-10-24 14:54:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:24,880 INFO L225 Difference]: With dead ends: 116000 [2018-10-24 14:54:24,881 INFO L226 Difference]: Without dead ends: 57999 [2018-10-24 14:54:24,917 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 14:54:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57999 states. [2018-10-24 14:54:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57999 to 57999. [2018-10-24 14:54:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57999 states. [2018-10-24 14:54:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57999 states to 57999 states and 65737 transitions. [2018-10-24 14:54:25,994 INFO L78 Accepts]: Start accepts. Automaton has 57999 states and 65737 transitions. Word has length 390 [2018-10-24 14:54:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:25,994 INFO L481 AbstractCegarLoop]: Abstraction has 57999 states and 65737 transitions. [2018-10-24 14:54:25,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 57999 states and 65737 transitions. [2018-10-24 14:54:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-24 14:54:26,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:26,034 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:54:26,034 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:26,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1847331319, now seen corresponding path program 1 times [2018-10-24 14:54:26,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:26,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:26,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:26,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:26,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:26,698 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-24 14:54:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-24 14:54:26,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:26,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:26,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:26,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:26,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:26,880 INFO L87 Difference]: Start difference. First operand 57999 states and 65737 transitions. Second operand 5 states. [2018-10-24 14:54:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:31,826 INFO L93 Difference]: Finished difference Result 265586 states and 299056 transitions. [2018-10-24 14:54:31,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:31,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 394 [2018-10-24 14:54:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:32,043 INFO L225 Difference]: With dead ends: 265586 [2018-10-24 14:54:32,043 INFO L226 Difference]: Without dead ends: 207589 [2018-10-24 14:54:32,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207589 states. [2018-10-24 14:54:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207589 to 153279. [2018-10-24 14:54:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153279 states. [2018-10-24 14:54:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153279 states to 153279 states and 171918 transitions. [2018-10-24 14:54:34,532 INFO L78 Accepts]: Start accepts. Automaton has 153279 states and 171918 transitions. Word has length 394 [2018-10-24 14:54:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:34,533 INFO L481 AbstractCegarLoop]: Abstraction has 153279 states and 171918 transitions. [2018-10-24 14:54:34,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 153279 states and 171918 transitions. [2018-10-24 14:54:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-24 14:54:34,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:34,564 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:34,564 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:34,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:34,565 INFO L82 PathProgramCache]: Analyzing trace with hash -501369268, now seen corresponding path program 1 times [2018-10-24 14:54:34,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:34,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:34,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:34,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:34,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-24 14:54:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:34,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:34,876 INFO L87 Difference]: Start difference. First operand 153279 states and 171918 transitions. Second operand 3 states. [2018-10-24 14:54:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:36,718 INFO L93 Difference]: Finished difference Result 381854 states and 427464 transitions. [2018-10-24 14:54:36,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:36,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 395 [2018-10-24 14:54:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:36,989 INFO L225 Difference]: With dead ends: 381854 [2018-10-24 14:54:36,989 INFO L226 Difference]: Without dead ends: 228577 [2018-10-24 14:54:37,094 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 14:54:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228577 states. [2018-10-24 14:54:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228577 to 228575. [2018-10-24 14:54:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228575 states. [2018-10-24 14:54:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228575 states to 228575 states and 255483 transitions. [2018-10-24 14:54:40,630 INFO L78 Accepts]: Start accepts. Automaton has 228575 states and 255483 transitions. Word has length 395 [2018-10-24 14:54:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:40,631 INFO L481 AbstractCegarLoop]: Abstraction has 228575 states and 255483 transitions. [2018-10-24 14:54:40,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 228575 states and 255483 transitions. [2018-10-24 14:54:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-24 14:54:40,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:40,673 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:40,673 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:40,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash 30718225, now seen corresponding path program 1 times [2018-10-24 14:54:40,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:40,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:40,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:40,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-24 14:54:40,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:40,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:40,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:40,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:40,993 INFO L87 Difference]: Start difference. First operand 228575 states and 255483 transitions. Second operand 4 states. [2018-10-24 14:54:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:45,388 INFO L93 Difference]: Finished difference Result 845950 states and 946108 transitions. [2018-10-24 14:54:45,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:45,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 416 [2018-10-24 14:54:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:46,007 INFO L225 Difference]: With dead ends: 845950 [2018-10-24 14:54:46,008 INFO L226 Difference]: Without dead ends: 617377 [2018-10-24 14:54:46,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 14:54:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617377 states. [2018-10-24 14:54:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617377 to 422748. [2018-10-24 14:54:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422748 states. [2018-10-24 14:54:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422748 states to 422748 states and 472620 transitions. [2018-10-24 14:54:59,580 INFO L78 Accepts]: Start accepts. Automaton has 422748 states and 472620 transitions. Word has length 416 [2018-10-24 14:54:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:59,580 INFO L481 AbstractCegarLoop]: Abstraction has 422748 states and 472620 transitions. [2018-10-24 14:54:59,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 422748 states and 472620 transitions. [2018-10-24 14:54:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-10-24 14:54:59,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:59,655 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:54:59,656 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:59,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash -269807956, now seen corresponding path program 1 times [2018-10-24 14:54:59,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:59,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:59,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:59,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:59,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:55:01,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:01,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:55:01,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:55:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:55:01,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:55:01,487 INFO L87 Difference]: Start difference. First operand 422748 states and 472620 transitions. Second operand 7 states. [2018-10-24 14:55:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:12,348 INFO L93 Difference]: Finished difference Result 1416601 states and 1580439 transitions. [2018-10-24 14:55:12,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:55:12,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 470 [2018-10-24 14:55:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:13,854 INFO L225 Difference]: With dead ends: 1416601 [2018-10-24 14:55:13,854 INFO L226 Difference]: Without dead ends: 993855 [2018-10-24 14:55:14,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:55:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993855 states. [2018-10-24 14:55:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993855 to 852814. [2018-10-24 14:55:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852814 states. [2018-10-24 14:55:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852814 states to 852814 states and 952474 transitions. [2018-10-24 14:55:37,322 INFO L78 Accepts]: Start accepts. Automaton has 852814 states and 952474 transitions. Word has length 470 [2018-10-24 14:55:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:37,322 INFO L481 AbstractCegarLoop]: Abstraction has 852814 states and 952474 transitions. [2018-10-24 14:55:37,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:55:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 852814 states and 952474 transitions. [2018-10-24 14:55:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-10-24 14:55:37,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:37,487 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:55:37,487 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:37,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1856714610, now seen corresponding path program 1 times [2018-10-24 14:55:37,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:37,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:37,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:37,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:37,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:37,853 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:55:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-10-24 14:55:37,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:55:37,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:37,952 INFO L87 Difference]: Start difference. First operand 852814 states and 952474 transitions. Second operand 4 states. [2018-10-24 14:55:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:48,934 INFO L93 Difference]: Finished difference Result 1696397 states and 1893685 transitions. [2018-10-24 14:55:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:55:48,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 473 [2018-10-24 14:55:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:50,085 INFO L225 Difference]: With dead ends: 1696397 [2018-10-24 14:55:50,086 INFO L226 Difference]: Without dead ends: 843585 [2018-10-24 14:55:50,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843585 states. [2018-10-24 14:56:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843585 to 812055. [2018-10-24 14:56:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812055 states. [2018-10-24 14:56:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812055 states to 812055 states and 904101 transitions. [2018-10-24 14:56:16,262 INFO L78 Accepts]: Start accepts. Automaton has 812055 states and 904101 transitions. Word has length 473 [2018-10-24 14:56:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:16,262 INFO L481 AbstractCegarLoop]: Abstraction has 812055 states and 904101 transitions. [2018-10-24 14:56:16,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 812055 states and 904101 transitions. [2018-10-24 14:56:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-24 14:56:16,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:16,381 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:16,382 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:16,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:16,382 INFO L82 PathProgramCache]: Analyzing trace with hash 888829770, now seen corresponding path program 1 times [2018-10-24 14:56:16,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:16,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:16,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:16,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:16,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-10-24 14:56:16,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:16,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:16,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:16,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:16,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:16,737 INFO L87 Difference]: Start difference. First operand 812055 states and 904101 transitions. Second operand 4 states. [2018-10-24 14:56:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:28,833 INFO L93 Difference]: Finished difference Result 2168111 states and 2407768 transitions. [2018-10-24 14:56:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:28,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 479 [2018-10-24 14:56:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:32,119 INFO L225 Difference]: With dead ends: 2168111 [2018-10-24 14:56:32,120 INFO L226 Difference]: Without dead ends: 1356058 [2018-10-24 14:56:32,389 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 14:56:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356058 states. Received shutdown request... [2018-10-24 14:56:49,648 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:56:49,652 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:56:49,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:56:49 BoogieIcfgContainer [2018-10-24 14:56:49,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:56:49,653 INFO L168 Benchmark]: Toolchain (without parser) took 193384.95 ms. Allocated memory was 1.5 GB in the beginning and 6.8 GB in the end (delta: 5.2 GB). Free memory was 1.4 GB in the beginning and 4.2 GB in the end (delta: -2.8 GB). Peak memory consumption was 6.2 GB. Max. memory is 7.1 GB. [2018-10-24 14:56:49,655 INFO L168 Benchmark]: CDTParser took 0.23 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 14:56:49,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1199.06 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:49,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 304.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -890.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:49,659 INFO L168 Benchmark]: Boogie Preprocessor took 132.18 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:49,660 INFO L168 Benchmark]: RCFGBuilder took 5484.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 258.0 MB). Peak memory consumption was 258.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:49,661 INFO L168 Benchmark]: TraceAbstraction took 186256.74 ms. Allocated memory was 2.3 GB in the beginning and 6.8 GB in the end (delta: 4.5 GB). Free memory was 2.0 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 6.0 GB. Max. memory is 7.1 GB. [2018-10-24 14:56:49,669 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.23 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 1199.06 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 304.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -890.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.18 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5484.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 258.0 MB). Peak memory consumption was 258.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186256.74 ms. Allocated memory was 2.3 GB in the beginning and 6.8 GB in the end (delta: 4.5 GB). Free memory was 2.0 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 6.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1593]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1593). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 186.1s OverallTime, 18 OverallIterations, 9 TraceHistogramMax, 86.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4842 SDtfs, 12630 SDslu, 5065 SDs, 0 SdLazy, 20508 SolverSat, 3800 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 540 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=852814occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 89.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 424556 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 6149 NumberOfCodeBlocks, 6149 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 6129 ConstructedInterpolants, 0 QuantifiedInterpolants, 5034721 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1004 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 4489/4501 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown