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/Problem15_label52_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:37:57,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:37:57,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:37:57,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:37:57,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:37:57,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:37:57,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:37:57,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:37:57,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:37:57,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:37:57,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:37:57,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:37:57,323 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:37:57,324 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:37:57,325 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:37:57,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:37:57,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:37:57,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:37:57,336 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:37:57,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:37:57,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:37:57,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:37:57,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:37:57,348 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:37:57,348 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:37:57,349 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:37:57,350 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:37:57,351 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:37:57,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:37:57,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:37:57,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:37:57,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:37:57,356 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:37:57,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:37:57,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:37:57,359 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:37:57,359 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 16:37:57,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:37:57,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:37:57,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:37:57,391 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:37:57,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:37:57,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:37:57,392 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:37:57,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:37:57,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:37:57,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:37:57,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:37:57,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:37:57,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:37:57,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:37:57,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:37:57,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:37:57,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:37:57,397 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:37:57,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:37:57,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:37:57,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:37:57,399 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:37:57,399 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:37:57,399 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:37:57,400 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:37:57,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:37:57,400 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:37:57,400 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:37:57,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:37:57,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:37:57,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:37:57,491 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:37:57,492 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:37:57,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label52_true-unreach-call.c [2018-10-24 16:37:57,552 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1fe8404f5/3870fe1d34954a4f9e1523f3c9d80268/FLAG76263d488 [2018-10-24 16:37:58,211 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:37:58,212 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label52_true-unreach-call.c [2018-10-24 16:37:58,235 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1fe8404f5/3870fe1d34954a4f9e1523f3c9d80268/FLAG76263d488 [2018-10-24 16:37:58,252 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1fe8404f5/3870fe1d34954a4f9e1523f3c9d80268 [2018-10-24 16:37:58,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:37:58,267 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:37:58,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:37:58,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:37:58,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:37:58,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:37:58" (1/1) ... [2018-10-24 16:37:58,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540df47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:58, skipping insertion in model container [2018-10-24 16:37:58,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:37:58" (1/1) ... [2018-10-24 16:37:58,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:37:58,387 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:37:59,170 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:37:59,174 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:37:59,464 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:37:59,487 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:37:59,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59 WrapperNode [2018-10-24 16:37:59,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:37:59,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:37:59,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:37:59,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:37:59,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (1/1) ... [2018-10-24 16:37:59,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (1/1) ... [2018-10-24 16:37:59,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:37:59,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:37:59,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:37:59,879 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:37:59,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (1/1) ... [2018-10-24 16:37:59,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (1/1) ... [2018-10-24 16:37:59,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (1/1) ... [2018-10-24 16:37:59,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (1/1) ... [2018-10-24 16:38:00,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (1/1) ... [2018-10-24 16:38:00,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (1/1) ... [2018-10-24 16:38:00,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (1/1) ... [2018-10-24 16:38:00,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:38:00,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:38:00,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:38:00,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:38:00,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (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 16:38:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:38:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:38:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:38:09,449 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:38:09,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:38:09 BoogieIcfgContainer [2018-10-24 16:38:09,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:38:09,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:38:09,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:38:09,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:38:09,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:37:58" (1/3) ... [2018-10-24 16:38:09,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ef158f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:38:09, skipping insertion in model container [2018-10-24 16:38:09,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:37:59" (2/3) ... [2018-10-24 16:38:09,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ef158f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:38:09, skipping insertion in model container [2018-10-24 16:38:09,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:38:09" (3/3) ... [2018-10-24 16:38:09,459 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label52_true-unreach-call.c [2018-10-24 16:38:09,472 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:38:09,483 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:38:09,502 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:38:09,555 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:38:09,556 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:38:09,556 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:38:09,556 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:38:09,556 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:38:09,556 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:38:09,557 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:38:09,557 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:38:09,557 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:38:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-10-24 16:38:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 16:38:09,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:09,611 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] [2018-10-24 16:38:09,613 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:09,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:09,618 INFO L82 PathProgramCache]: Analyzing trace with hash 935177138, now seen corresponding path program 1 times [2018-10-24 16:38:09,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:09,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:09,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:09,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:09,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:10,111 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 16:38:10,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:38:10,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:38:10,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:38:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:38:10,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:38:10,141 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-10-24 16:38:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:19,694 INFO L93 Difference]: Finished difference Result 1470 states and 2718 transitions. [2018-10-24 16:38:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:38:19,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-10-24 16:38:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:19,725 INFO L225 Difference]: With dead ends: 1470 [2018-10-24 16:38:19,725 INFO L226 Difference]: Without dead ends: 1038 [2018-10-24 16:38:19,731 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 16:38:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-10-24 16:38:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1036. [2018-10-24 16:38:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-10-24 16:38:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1670 transitions. [2018-10-24 16:38:19,844 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1670 transitions. Word has length 40 [2018-10-24 16:38:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:19,845 INFO L481 AbstractCegarLoop]: Abstraction has 1036 states and 1670 transitions. [2018-10-24 16:38:19,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:38:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1670 transitions. [2018-10-24 16:38:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 16:38:19,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:19,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:38:19,851 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:19,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1738752297, now seen corresponding path program 1 times [2018-10-24 16:38:19,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:19,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:19,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:19,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:38:20,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:38:20,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:38:20,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:38:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:38:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:38:20,148 INFO L87 Difference]: Start difference. First operand 1036 states and 1670 transitions. Second operand 4 states. [2018-10-24 16:38:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:26,018 INFO L93 Difference]: Finished difference Result 3937 states and 6425 transitions. [2018-10-24 16:38:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:38:26,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-10-24 16:38:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:26,046 INFO L225 Difference]: With dead ends: 3937 [2018-10-24 16:38:26,046 INFO L226 Difference]: Without dead ends: 2903 [2018-10-24 16:38:26,058 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 16:38:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2018-10-24 16:38:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1937. [2018-10-24 16:38:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2018-10-24 16:38:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2808 transitions. [2018-10-24 16:38:26,125 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2808 transitions. Word has length 129 [2018-10-24 16:38:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:26,126 INFO L481 AbstractCegarLoop]: Abstraction has 1937 states and 2808 transitions. [2018-10-24 16:38:26,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:38:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2808 transitions. [2018-10-24 16:38:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-24 16:38:26,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:26,142 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:38:26,142 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:26,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:26,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1861564259, now seen corresponding path program 1 times [2018-10-24 16:38:26,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:26,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:26,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:26,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:26,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-24 16:38:27,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:38:27,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:38:27,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:38:27,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:38:27,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:38:27,215 INFO L87 Difference]: Start difference. First operand 1937 states and 2808 transitions. Second operand 5 states. [2018-10-24 16:38:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:38:37,852 INFO L93 Difference]: Finished difference Result 4777 states and 6638 transitions. [2018-10-24 16:38:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:38:37,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 314 [2018-10-24 16:38:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:38:37,868 INFO L225 Difference]: With dead ends: 4777 [2018-10-24 16:38:37,868 INFO L226 Difference]: Without dead ends: 2842 [2018-10-24 16:38:37,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:38:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-10-24 16:38:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2841. [2018-10-24 16:38:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2841 states. [2018-10-24 16:38:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3775 transitions. [2018-10-24 16:38:37,924 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3775 transitions. Word has length 314 [2018-10-24 16:38:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:38:37,925 INFO L481 AbstractCegarLoop]: Abstraction has 2841 states and 3775 transitions. [2018-10-24 16:38:37,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:38:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3775 transitions. [2018-10-24 16:38:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-24 16:38:37,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:38:37,933 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:38:37,934 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:38:37,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:38:37,934 INFO L82 PathProgramCache]: Analyzing trace with hash 636620843, now seen corresponding path program 1 times [2018-10-24 16:38:37,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:38:37,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:38:37,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:37,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:38:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:38,552 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 16:38:39,170 WARN L179 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-24 16:38:39,410 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-10-24 16:38:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 79 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:38:40,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:38:40,429 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 16:38:40,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:38:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:38:40,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:38:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:38:40,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:38:40,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2018-10-24 16:38:40,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 16:38:40,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 16:38:40,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:38:40,945 INFO L87 Difference]: Start difference. First operand 2841 states and 3775 transitions. Second operand 12 states. [2018-10-24 16:38:43,431 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-24 16:39:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:02,628 INFO L93 Difference]: Finished difference Result 9859 states and 12868 transitions. [2018-10-24 16:39:02,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 16:39:02,637 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 388 [2018-10-24 16:39:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:02,668 INFO L225 Difference]: With dead ends: 9859 [2018-10-24 16:39:02,668 INFO L226 Difference]: Without dead ends: 7020 [2018-10-24 16:39:02,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 392 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-10-24 16:39:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7020 states. [2018-10-24 16:39:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7020 to 5199. [2018-10-24 16:39:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5199 states. [2018-10-24 16:39:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 6574 transitions. [2018-10-24 16:39:02,783 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 6574 transitions. Word has length 388 [2018-10-24 16:39:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:02,784 INFO L481 AbstractCegarLoop]: Abstraction has 5199 states and 6574 transitions. [2018-10-24 16:39:02,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 16:39:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 6574 transitions. [2018-10-24 16:39:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-24 16:39:02,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:02,794 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:39:02,795 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:02,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash -816750615, now seen corresponding path program 1 times [2018-10-24 16:39:02,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:02,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:02,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:02,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:02,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:03,582 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-24 16:39:03,923 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-24 16:39:04,427 WARN L179 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2018-10-24 16:39:04,671 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-10-24 16:39:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 315 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-24 16:39:05,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:39:05,039 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 16:39:05,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:05,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:39:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-24 16:39:05,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:39:05,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 16:39:05,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:39:05,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:39:05,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:39:05,295 INFO L87 Difference]: Start difference. First operand 5199 states and 6574 transitions. Second operand 8 states. [2018-10-24 16:39:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:15,840 INFO L93 Difference]: Finished difference Result 14766 states and 18159 transitions. [2018-10-24 16:39:15,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:39:15,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 406 [2018-10-24 16:39:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:15,866 INFO L225 Difference]: With dead ends: 14766 [2018-10-24 16:39:15,867 INFO L226 Difference]: Without dead ends: 6095 [2018-10-24 16:39:15,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:39:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2018-10-24 16:39:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 5755. [2018-10-24 16:39:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5755 states. [2018-10-24 16:39:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5755 states to 5755 states and 6941 transitions. [2018-10-24 16:39:15,976 INFO L78 Accepts]: Start accepts. Automaton has 5755 states and 6941 transitions. Word has length 406 [2018-10-24 16:39:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:15,977 INFO L481 AbstractCegarLoop]: Abstraction has 5755 states and 6941 transitions. [2018-10-24 16:39:15,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:39:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5755 states and 6941 transitions. [2018-10-24 16:39:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-10-24 16:39:15,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:15,991 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:39:15,991 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:15,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1496499592, now seen corresponding path program 1 times [2018-10-24 16:39:15,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:15,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:15,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:15,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:15,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-10-24 16:39:16,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:39:16,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:39:16,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:39:16,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:39:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:39:16,561 INFO L87 Difference]: Start difference. First operand 5755 states and 6941 transitions. Second operand 3 states. [2018-10-24 16:39:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:19,373 INFO L93 Difference]: Finished difference Result 15627 states and 19091 transitions. [2018-10-24 16:39:19,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:39:19,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 517 [2018-10-24 16:39:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:19,416 INFO L225 Difference]: With dead ends: 15627 [2018-10-24 16:39:19,417 INFO L226 Difference]: Without dead ends: 9874 [2018-10-24 16:39:19,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 16:39:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9874 states. [2018-10-24 16:39:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9874 to 9423. [2018-10-24 16:39:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9423 states. [2018-10-24 16:39:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9423 states to 9423 states and 10994 transitions. [2018-10-24 16:39:19,590 INFO L78 Accepts]: Start accepts. Automaton has 9423 states and 10994 transitions. Word has length 517 [2018-10-24 16:39:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:19,591 INFO L481 AbstractCegarLoop]: Abstraction has 9423 states and 10994 transitions. [2018-10-24 16:39:19,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:39:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 9423 states and 10994 transitions. [2018-10-24 16:39:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-10-24 16:39:19,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:19,601 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:39:19,602 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:19,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash -755033643, now seen corresponding path program 1 times [2018-10-24 16:39:19,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:19,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:19,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:19,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:19,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:20,286 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 16:39:20,877 WARN L179 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-24 16:39:21,556 WARN L179 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-10-24 16:39:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 271 proven. 136 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 16:39:22,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:39:22,034 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:39:22,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:22,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:39:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-24 16:39:22,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:39:22,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-10-24 16:39:22,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:39:22,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:39:22,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:39:22,334 INFO L87 Difference]: Start difference. First operand 9423 states and 10994 transitions. Second operand 9 states. [2018-10-24 16:39:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:31,606 INFO L93 Difference]: Finished difference Result 19251 states and 22398 transitions. [2018-10-24 16:39:31,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:39:31,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 540 [2018-10-24 16:39:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:31,627 INFO L225 Difference]: With dead ends: 19251 [2018-10-24 16:39:31,628 INFO L226 Difference]: Without dead ends: 9830 [2018-10-24 16:39:31,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 544 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:39:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9830 states. [2018-10-24 16:39:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9830 to 9420. [2018-10-24 16:39:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9420 states. [2018-10-24 16:39:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9420 states to 9420 states and 10491 transitions. [2018-10-24 16:39:31,781 INFO L78 Accepts]: Start accepts. Automaton has 9420 states and 10491 transitions. Word has length 540 [2018-10-24 16:39:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:31,782 INFO L481 AbstractCegarLoop]: Abstraction has 9420 states and 10491 transitions. [2018-10-24 16:39:31,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:39:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 9420 states and 10491 transitions. [2018-10-24 16:39:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-24 16:39:31,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:31,794 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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 16:39:31,794 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:31,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:31,795 INFO L82 PathProgramCache]: Analyzing trace with hash 638222884, now seen corresponding path program 1 times [2018-10-24 16:39:31,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:31,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:31,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:31,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:31,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-24 16:39:32,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:39:32,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:39:32,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:39:32,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:39:32,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:39:32,382 INFO L87 Difference]: Start difference. First operand 9420 states and 10491 transitions. Second operand 3 states. [2018-10-24 16:39:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:38,690 INFO L93 Difference]: Finished difference Result 24429 states and 27345 transitions. [2018-10-24 16:39:38,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:39:38,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 570 [2018-10-24 16:39:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:38,716 INFO L225 Difference]: With dead ends: 24429 [2018-10-24 16:39:38,716 INFO L226 Difference]: Without dead ends: 15011 [2018-10-24 16:39:38,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 16:39:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15011 states. [2018-10-24 16:39:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15011 to 15011. [2018-10-24 16:39:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15011 states. [2018-10-24 16:39:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15011 states to 15011 states and 16626 transitions. [2018-10-24 16:39:38,937 INFO L78 Accepts]: Start accepts. Automaton has 15011 states and 16626 transitions. Word has length 570 [2018-10-24 16:39:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:38,938 INFO L481 AbstractCegarLoop]: Abstraction has 15011 states and 16626 transitions. [2018-10-24 16:39:38,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:39:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 15011 states and 16626 transitions. [2018-10-24 16:39:38,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2018-10-24 16:39:38,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:38,951 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:39:38,951 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:38,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash 469499223, now seen corresponding path program 1 times [2018-10-24 16:39:38,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:38,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:38,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:38,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:38,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-24 16:39:39,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:39:39,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:39:39,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:39:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:39:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:39:39,779 INFO L87 Difference]: Start difference. First operand 15011 states and 16626 transitions. Second operand 5 states. [2018-10-24 16:39:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:46,425 INFO L93 Difference]: Finished difference Result 44098 states and 49253 transitions. [2018-10-24 16:39:46,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:39:46,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 578 [2018-10-24 16:39:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:46,474 INFO L225 Difference]: With dead ends: 44098 [2018-10-24 16:39:46,474 INFO L226 Difference]: Without dead ends: 29089 [2018-10-24 16:39:46,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:39:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29089 states. [2018-10-24 16:39:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29089 to 23619. [2018-10-24 16:39:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23619 states. [2018-10-24 16:39:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23619 states to 23619 states and 25731 transitions. [2018-10-24 16:39:47,084 INFO L78 Accepts]: Start accepts. Automaton has 23619 states and 25731 transitions. Word has length 578 [2018-10-24 16:39:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:47,084 INFO L481 AbstractCegarLoop]: Abstraction has 23619 states and 25731 transitions. [2018-10-24 16:39:47,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:39:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 23619 states and 25731 transitions. [2018-10-24 16:39:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-10-24 16:39:47,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:47,101 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:39:47,101 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:47,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:47,102 INFO L82 PathProgramCache]: Analyzing trace with hash 484713971, now seen corresponding path program 1 times [2018-10-24 16:39:47,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:47,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:47,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2018-10-24 16:39:47,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:39:47,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:39:47,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:39:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:39:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:39:47,569 INFO L87 Difference]: Start difference. First operand 23619 states and 25731 transitions. Second operand 3 states. [2018-10-24 16:39:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:49,818 INFO L93 Difference]: Finished difference Result 50259 states and 54388 transitions. [2018-10-24 16:39:49,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:39:49,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 581 [2018-10-24 16:39:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:49,836 INFO L225 Difference]: With dead ends: 50259 [2018-10-24 16:39:49,836 INFO L226 Difference]: Without dead ends: 15204 [2018-10-24 16:39:49,857 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 16:39:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2018-10-24 16:39:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 10178. [2018-10-24 16:39:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10178 states. [2018-10-24 16:39:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10178 states to 10178 states and 10606 transitions. [2018-10-24 16:39:50,009 INFO L78 Accepts]: Start accepts. Automaton has 10178 states and 10606 transitions. Word has length 581 [2018-10-24 16:39:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:50,010 INFO L481 AbstractCegarLoop]: Abstraction has 10178 states and 10606 transitions. [2018-10-24 16:39:50,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:39:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 10178 states and 10606 transitions. [2018-10-24 16:39:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-24 16:39:50,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:50,023 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:39:50,023 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:50,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:50,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1311033631, now seen corresponding path program 1 times [2018-10-24 16:39:50,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:50,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:50,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:50,645 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-24 16:39:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-24 16:39:51,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:39:51,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 16:39:51,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:39:51,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:39:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:39:51,205 INFO L87 Difference]: Start difference. First operand 10178 states and 10606 transitions. Second operand 6 states. [2018-10-24 16:39:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:39:54,528 INFO L93 Difference]: Finished difference Result 21998 states and 22907 transitions. [2018-10-24 16:39:54,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:39:54,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 729 [2018-10-24 16:39:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:39:54,540 INFO L225 Difference]: With dead ends: 21998 [2018-10-24 16:39:54,540 INFO L226 Difference]: Without dead ends: 12122 [2018-10-24 16:39:54,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:39:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12122 states. [2018-10-24 16:39:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12122 to 10362. [2018-10-24 16:39:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10362 states. [2018-10-24 16:39:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10362 states to 10362 states and 10705 transitions. [2018-10-24 16:39:54,680 INFO L78 Accepts]: Start accepts. Automaton has 10362 states and 10705 transitions. Word has length 729 [2018-10-24 16:39:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:39:54,681 INFO L481 AbstractCegarLoop]: Abstraction has 10362 states and 10705 transitions. [2018-10-24 16:39:54,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:39:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 10362 states and 10705 transitions. [2018-10-24 16:39:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-10-24 16:39:54,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:39:54,697 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:39:54,698 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:39:54,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:39:54,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1761273195, now seen corresponding path program 1 times [2018-10-24 16:39:54,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:39:54,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:39:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:54,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:39:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 38 proven. 495 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-24 16:39:56,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:39:56,283 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:39:56,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:39:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:39:56,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:39:58,276 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (and (<= (mod v_prenex_1 299926) (+ c_~a0~0 300072)) (<= (+ v_prenex_1 44) 0) (<= 0 v_prenex_1))) (exists ((v_~a0~0_825 Int)) (let ((.cse0 (mod v_~a0~0_825 299926))) (and (<= (+ v_~a0~0_825 44) 0) (<= .cse0 (+ c_~a0~0 300072)) (= .cse0 0)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (<= .cse1 (+ c_~a0~0 599998)) (not (= .cse1 0)))))) is different from true [2018-10-24 16:40:01,117 WARN L179 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 164 DAG size of output: 23 [2018-10-24 16:40:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 350 trivial. 420 not checked. [2018-10-24 16:40:03,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:40:03,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-24 16:40:03,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:40:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:40:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2018-10-24 16:40:03,103 INFO L87 Difference]: Start difference. First operand 10362 states and 10705 transitions. Second operand 9 states. [2018-10-24 16:40:33,696 WARN L179 SmtUtils]: Spent 5.61 s on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2018-10-24 16:40:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:40:44,288 INFO L93 Difference]: Finished difference Result 30204 states and 31254 transitions. [2018-10-24 16:40:44,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 16:40:44,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 735 [2018-10-24 16:40:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:40:44,316 INFO L225 Difference]: With dead ends: 30204 [2018-10-24 16:40:44,316 INFO L226 Difference]: Without dead ends: 20144 [2018-10-24 16:40:44,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 732 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=42, Invalid=70, Unknown=2, NotChecked=18, Total=132 [2018-10-24 16:40:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20144 states. [2018-10-24 16:40:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20144 to 17735. [2018-10-24 16:40:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17735 states. [2018-10-24 16:40:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17735 states to 17735 states and 18345 transitions. [2018-10-24 16:40:44,559 INFO L78 Accepts]: Start accepts. Automaton has 17735 states and 18345 transitions. Word has length 735 [2018-10-24 16:40:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:40:44,560 INFO L481 AbstractCegarLoop]: Abstraction has 17735 states and 18345 transitions. [2018-10-24 16:40:44,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:40:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 17735 states and 18345 transitions. [2018-10-24 16:40:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2018-10-24 16:40:44,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:40:44,584 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:40:44,585 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:40:44,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:40:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1000230224, now seen corresponding path program 1 times [2018-10-24 16:40:44,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:40:44,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:40:44,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:40:44,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:40:44,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:40:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:40:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 699 proven. 175 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-10-24 16:40:45,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:40:45,690 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:40:45,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:40:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:40:45,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:40:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 733 proven. 141 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-10-24 16:40:46,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:40:46,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 10 [2018-10-24 16:40:46,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 16:40:46,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 16:40:46,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:40:46,375 INFO L87 Difference]: Start difference. First operand 17735 states and 18345 transitions. Second operand 10 states. [2018-10-24 16:40:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:40:56,481 INFO L93 Difference]: Finished difference Result 51386 states and 53268 transitions. [2018-10-24 16:40:56,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 16:40:56,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 793 [2018-10-24 16:40:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:40:56,515 INFO L225 Difference]: With dead ends: 51386 [2018-10-24 16:40:56,515 INFO L226 Difference]: Without dead ends: 33953 [2018-10-24 16:40:56,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 800 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-10-24 16:40:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33953 states. [2018-10-24 16:40:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33953 to 25376. [2018-10-24 16:40:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25376 states. [2018-10-24 16:40:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25376 states to 25376 states and 26035 transitions. [2018-10-24 16:40:56,957 INFO L78 Accepts]: Start accepts. Automaton has 25376 states and 26035 transitions. Word has length 793 [2018-10-24 16:40:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:40:56,958 INFO L481 AbstractCegarLoop]: Abstraction has 25376 states and 26035 transitions. [2018-10-24 16:40:56,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 16:40:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 25376 states and 26035 transitions. [2018-10-24 16:40:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2018-10-24 16:40:56,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:40:56,979 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:40:56,979 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:40:56,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:40:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash -611986148, now seen corresponding path program 1 times [2018-10-24 16:40:56,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:40:56,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:40:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:40:56,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:40:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:40:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:40:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 852 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-24 16:40:58,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:40:58,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:40:58,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:40:58,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:40:58,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:40:58,142 INFO L87 Difference]: Start difference. First operand 25376 states and 26035 transitions. Second operand 5 states. [2018-10-24 16:41:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:41:01,460 INFO L93 Difference]: Finished difference Result 56506 states and 58017 transitions. [2018-10-24 16:41:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:41:01,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 826 [2018-10-24 16:41:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:41:01,496 INFO L225 Difference]: With dead ends: 56506 [2018-10-24 16:41:01,496 INFO L226 Difference]: Without dead ends: 33234 [2018-10-24 16:41:01,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:41:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33234 states. [2018-10-24 16:41:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33234 to 17712. [2018-10-24 16:41:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17712 states. [2018-10-24 16:41:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17712 states to 17712 states and 18192 transitions. [2018-10-24 16:41:01,748 INFO L78 Accepts]: Start accepts. Automaton has 17712 states and 18192 transitions. Word has length 826 [2018-10-24 16:41:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:41:01,749 INFO L481 AbstractCegarLoop]: Abstraction has 17712 states and 18192 transitions. [2018-10-24 16:41:01,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:41:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 17712 states and 18192 transitions. [2018-10-24 16:41:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2018-10-24 16:41:01,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:41:01,774 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:41:01,774 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:41:01,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:41:01,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1368484188, now seen corresponding path program 1 times [2018-10-24 16:41:01,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:41:01,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:41:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:01,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 1036 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2018-10-24 16:41:02,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:41:02,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:41:02,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:41:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:41:02,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:41:02,839 INFO L87 Difference]: Start difference. First operand 17712 states and 18192 transitions. Second operand 3 states. [2018-10-24 16:41:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:41:04,710 INFO L93 Difference]: Finished difference Result 36927 states and 37987 transitions. [2018-10-24 16:41:04,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:41:04,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1028 [2018-10-24 16:41:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:41:04,729 INFO L225 Difference]: With dead ends: 36927 [2018-10-24 16:41:04,729 INFO L226 Difference]: Without dead ends: 19517 [2018-10-24 16:41:04,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:41:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19517 states. [2018-10-24 16:41:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19517 to 17597. [2018-10-24 16:41:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17597 states. [2018-10-24 16:41:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17597 states to 17597 states and 18065 transitions. [2018-10-24 16:41:04,938 INFO L78 Accepts]: Start accepts. Automaton has 17597 states and 18065 transitions. Word has length 1028 [2018-10-24 16:41:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:41:04,939 INFO L481 AbstractCegarLoop]: Abstraction has 17597 states and 18065 transitions. [2018-10-24 16:41:04,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:41:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 17597 states and 18065 transitions. [2018-10-24 16:41:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1042 [2018-10-24 16:41:04,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:41:04,959 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:41:04,959 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:41:04,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:41:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash 437339455, now seen corresponding path program 1 times [2018-10-24 16:41:04,960 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:41:04,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:41:04,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:04,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:04,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 699 proven. 556 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-24 16:41:07,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:41:07,257 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:41:07,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:07,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:41:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 737 proven. 0 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2018-10-24 16:41:08,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:41:08,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2018-10-24 16:41:08,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:41:08,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:41:08,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:41:08,693 INFO L87 Difference]: Start difference. First operand 17597 states and 18065 transitions. Second operand 8 states. [2018-10-24 16:41:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:41:16,797 INFO L93 Difference]: Finished difference Result 51779 states and 53246 transitions. [2018-10-24 16:41:16,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 16:41:16,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1041 [2018-10-24 16:41:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:41:16,830 INFO L225 Difference]: With dead ends: 51779 [2018-10-24 16:41:16,830 INFO L226 Difference]: Without dead ends: 34484 [2018-10-24 16:41:16,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1048 GetRequests, 1040 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:41:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34484 states. [2018-10-24 16:41:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34484 to 19096. [2018-10-24 16:41:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19096 states. [2018-10-24 16:41:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19096 states to 19096 states and 19479 transitions. [2018-10-24 16:41:17,102 INFO L78 Accepts]: Start accepts. Automaton has 19096 states and 19479 transitions. Word has length 1041 [2018-10-24 16:41:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:41:17,103 INFO L481 AbstractCegarLoop]: Abstraction has 19096 states and 19479 transitions. [2018-10-24 16:41:17,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:41:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 19096 states and 19479 transitions. [2018-10-24 16:41:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1346 [2018-10-24 16:41:17,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:41:17,123 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:41:17,123 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:41:17,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:41:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1143307057, now seen corresponding path program 1 times [2018-10-24 16:41:17,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:41:17,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:41:17,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:17,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:17,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3773 backedges. 2480 proven. 0 refuted. 0 times theorem prover too weak. 1293 trivial. 0 not checked. [2018-10-24 16:41:18,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:41:18,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:41:18,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:41:18,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:41:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:41:18,946 INFO L87 Difference]: Start difference. First operand 19096 states and 19479 transitions. Second operand 5 states. [2018-10-24 16:41:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:41:21,946 INFO L93 Difference]: Finished difference Result 39705 states and 40510 transitions. [2018-10-24 16:41:21,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:41:21,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1345 [2018-10-24 16:41:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:41:21,966 INFO L225 Difference]: With dead ends: 39705 [2018-10-24 16:41:21,966 INFO L226 Difference]: Without dead ends: 22411 [2018-10-24 16:41:21,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:41:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22411 states. [2018-10-24 16:41:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22411 to 18196. [2018-10-24 16:41:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18196 states. [2018-10-24 16:41:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18196 states to 18196 states and 18552 transitions. [2018-10-24 16:41:22,187 INFO L78 Accepts]: Start accepts. Automaton has 18196 states and 18552 transitions. Word has length 1345 [2018-10-24 16:41:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:41:22,188 INFO L481 AbstractCegarLoop]: Abstraction has 18196 states and 18552 transitions. [2018-10-24 16:41:22,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:41:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 18196 states and 18552 transitions. [2018-10-24 16:41:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1366 [2018-10-24 16:41:22,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:41:22,215 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:41:22,215 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:41:22,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:41:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 194785411, now seen corresponding path program 1 times [2018-10-24 16:41:22,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:41:22,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:41:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:22,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3912 backedges. 2131 proven. 822 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-10-24 16:41:25,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:41:25,251 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:41:25,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:25,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:41:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3912 backedges. 2131 proven. 822 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-10-24 16:41:30,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:41:30,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-10-24 16:41:30,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:41:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:41:30,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:41:30,716 INFO L87 Difference]: Start difference. First operand 18196 states and 18552 transitions. Second operand 7 states. [2018-10-24 16:41:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:41:36,201 INFO L93 Difference]: Finished difference Result 45751 states and 46645 transitions. [2018-10-24 16:41:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 16:41:36,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1365 [2018-10-24 16:41:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:41:36,235 INFO L225 Difference]: With dead ends: 45751 [2018-10-24 16:41:36,235 INFO L226 Difference]: Without dead ends: 29357 [2018-10-24 16:41:36,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1370 GetRequests, 1363 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:41:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29357 states. [2018-10-24 16:41:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29357 to 19096. [2018-10-24 16:41:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19096 states. [2018-10-24 16:41:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19096 states to 19096 states and 19467 transitions. [2018-10-24 16:41:36,514 INFO L78 Accepts]: Start accepts. Automaton has 19096 states and 19467 transitions. Word has length 1365 [2018-10-24 16:41:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:41:36,515 INFO L481 AbstractCegarLoop]: Abstraction has 19096 states and 19467 transitions. [2018-10-24 16:41:36,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:41:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 19096 states and 19467 transitions. [2018-10-24 16:41:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1383 [2018-10-24 16:41:36,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:41:36,544 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:41:36,545 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:41:36,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:41:36,545 INFO L82 PathProgramCache]: Analyzing trace with hash -327492949, now seen corresponding path program 1 times [2018-10-24 16:41:36,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:41:36,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:41:36,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:36,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:36,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3968 backedges. 2143 proven. 587 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2018-10-24 16:41:40,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:41:40,111 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:41:40,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:40,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:41:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3968 backedges. 2730 proven. 0 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2018-10-24 16:41:42,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:41:42,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 16:41:42,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:41:42,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:41:42,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:41:42,156 INFO L87 Difference]: Start difference. First operand 19096 states and 19467 transitions. Second operand 6 states. [2018-10-24 16:41:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:41:47,475 INFO L93 Difference]: Finished difference Result 40600 states and 41402 transitions. [2018-10-24 16:41:47,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:41:47,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1382 [2018-10-24 16:41:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:41:47,491 INFO L225 Difference]: With dead ends: 40600 [2018-10-24 16:41:47,491 INFO L226 Difference]: Without dead ends: 16592 [2018-10-24 16:41:47,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1386 GetRequests, 1380 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:41:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16592 states. [2018-10-24 16:41:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16592 to 13885. [2018-10-24 16:41:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13885 states. [2018-10-24 16:41:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13885 states to 13885 states and 14111 transitions. [2018-10-24 16:41:47,668 INFO L78 Accepts]: Start accepts. Automaton has 13885 states and 14111 transitions. Word has length 1382 [2018-10-24 16:41:47,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:41:47,669 INFO L481 AbstractCegarLoop]: Abstraction has 13885 states and 14111 transitions. [2018-10-24 16:41:47,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:41:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 13885 states and 14111 transitions. [2018-10-24 16:41:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1450 [2018-10-24 16:41:47,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:41:47,691 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:41:47,691 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:41:47,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:41:47,692 INFO L82 PathProgramCache]: Analyzing trace with hash 491218878, now seen corresponding path program 1 times [2018-10-24 16:41:47,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:41:47,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:41:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:47,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:41:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:48,875 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 16:41:49,085 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 Received shutdown request... [2018-10-24 16:41:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3734 backedges. 1620 proven. 340 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2018-10-24 16:41:50,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:41:50,533 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:41:50,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:41:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:41:50,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:41:51,025 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 16:41:51,227 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:41:51,227 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 16:41:51,233 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 16:41:51,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:41:51 BoogieIcfgContainer [2018-10-24 16:41:51,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:41:51,234 INFO L168 Benchmark]: Toolchain (without parser) took 232968.88 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 172.3 MB. Max. memory is 7.1 GB. [2018-10-24 16:41:51,238 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 16:41:51,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1220.42 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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:41:51,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 389.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -901.9 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-24 16:41:51,242 INFO L168 Benchmark]: Boogie Preprocessor took 264.50 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2018-10-24 16:41:51,243 INFO L168 Benchmark]: RCFGBuilder took 9306.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 323.0 MB). Peak memory consumption was 323.0 MB. Max. memory is 7.1 GB. [2018-10-24 16:41:51,243 INFO L168 Benchmark]: TraceAbstraction took 221781.73 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.9 GB in the end (delta: -2.0 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:41:51,258 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 1220.42 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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 389.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -901.9 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 264.50 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9306.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 323.0 MB). Peak memory consumption was 323.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 221781.73 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.9 GB in the end (delta: -2.0 GB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 124]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 124). Cancelled while BasicCegarLoop was analyzing trace of length 1450 with TraceHistMax 8,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. TIMEOUT Result, 221.6s OverallTime, 20 OverallIterations, 9 TraceHistogramMax, 168.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4883 SDtfs, 23732 SDslu, 3484 SDs, 0 SdLazy, 64070 SolverSat, 6536 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 141.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6807 GetRequests, 6681 SyntacticMatches, 24 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 21.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25376occurred in iteration=13, 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: 3.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 77246 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 19957 NumberOfCodeBlocks, 19957 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 19930 ConstructedInterpolants, 805 QuantifiedInterpolants, 93252695 SizeOfPredicates, 5 NumberOfNonLiveVariables, 7798 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 30167/34510 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown