java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem19_label40_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:01:52,316 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:01:52,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:01:52,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:01:52,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:01:52,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:01:52,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:01:52,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:01:52,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:01:52,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:01:52,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:01:52,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:01:52,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:01:52,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:01:52,343 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:01:52,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:01:52,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:01:52,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:01:52,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:01:52,351 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:01:52,352 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:01:52,353 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:01:52,355 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:01:52,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:01:52,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:01:52,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:01:52,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:01:52,359 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:01:52,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:01:52,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:01:52,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:01:52,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:01:52,362 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:01:52,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:01:52,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:01:52,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:01:52,365 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:01:52,387 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:01:52,388 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:01:52,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:01:52,389 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:01:52,389 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:01:52,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:01:52,390 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:01:52,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:01:52,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:01:52,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:01:52,391 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:01:52,391 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:01:52,391 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:01:52,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:01:52,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:01:52,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:01:52,392 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:01:52,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:01:52,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:01:52,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:01:52,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:01:52,393 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:01:52,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:01:52,393 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:01:52,393 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:01:52,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:01:52,394 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:01:52,394 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:01:52,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:01:52,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:01:52,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:01:52,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:01:52,469 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:01:52,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem19_label40_true-unreach-call.c [2018-11-06 22:01:52,538 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7920811c5/37da65822d1b404b95109148fa99b242/FLAGe25af37c3 [2018-11-06 22:01:53,488 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:01:53,490 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem19_label40_true-unreach-call.c [2018-11-06 22:01:53,541 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7920811c5/37da65822d1b404b95109148fa99b242/FLAGe25af37c3 [2018-11-06 22:01:53,565 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7920811c5/37da65822d1b404b95109148fa99b242 [2018-11-06 22:01:53,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:01:53,581 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:01:53,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:01:53,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:01:53,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:01:53,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:53" (1/1) ... [2018-11-06 22:01:53,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb86d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:53, skipping insertion in model container [2018-11-06 22:01:53,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:53" (1/1) ... [2018-11-06 22:01:53,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:01:53,890 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:01:55,717 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:01:55,726 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:01:56,833 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:01:56,884 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:01:56,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56 WrapperNode [2018-11-06 22:01:56,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:01:56,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:01:56,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:01:56,886 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:01:56,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... [2018-11-06 22:01:57,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... [2018-11-06 22:01:57,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:01:57,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:01:57,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:01:57,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:01:57,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... [2018-11-06 22:01:57,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... [2018-11-06 22:01:57,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... [2018-11-06 22:01:57,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... [2018-11-06 22:01:58,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... [2018-11-06 22:01:58,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... [2018-11-06 22:01:58,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... [2018-11-06 22:01:58,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:01:58,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:01:58,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:01:58,794 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:01:58,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:01:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 22:01:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:01:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:02:14,451 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:02:14,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:14 BoogieIcfgContainer [2018-11-06 22:02:14,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:02:14,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:02:14,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:02:14,457 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:02:14,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:01:53" (1/3) ... [2018-11-06 22:02:14,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b4ec8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:14, skipping insertion in model container [2018-11-06 22:02:14,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:56" (2/3) ... [2018-11-06 22:02:14,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b4ec8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:14, skipping insertion in model container [2018-11-06 22:02:14,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:14" (3/3) ... [2018-11-06 22:02:14,462 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label40_true-unreach-call.c [2018-11-06 22:02:14,472 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:02:14,482 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:02:14,500 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:02:14,550 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:02:14,550 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:02:14,550 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:02:14,550 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:02:14,551 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:02:14,551 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:02:14,551 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:02:14,551 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:02:14,551 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:02:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states. [2018-11-06 22:02:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-06 22:02:14,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:02:14,614 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:02:14,616 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:02:14,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:02:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash 84973194, now seen corresponding path program 1 times [2018-11-06 22:02:14,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:02:14,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:02:14,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:02:14,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:02:14,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:02:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:02:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:02:15,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:02:15,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:02:15,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:02:15,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:02:15,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:02:15,080 INFO L87 Difference]: Start difference. First operand 1749 states. Second operand 4 states. [2018-11-06 22:02:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:02:34,618 INFO L93 Difference]: Finished difference Result 6321 states and 12079 transitions. [2018-11-06 22:02:34,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:02:34,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-06 22:02:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:02:34,692 INFO L225 Difference]: With dead ends: 6321 [2018-11-06 22:02:34,692 INFO L226 Difference]: Without dead ends: 4565 [2018-11-06 22:02:34,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:02:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4565 states. [2018-11-06 22:02:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4565 to 4560. [2018-11-06 22:02:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4560 states. [2018-11-06 22:02:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 7503 transitions. [2018-11-06 22:02:34,938 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 7503 transitions. Word has length 47 [2018-11-06 22:02:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:02:34,939 INFO L480 AbstractCegarLoop]: Abstraction has 4560 states and 7503 transitions. [2018-11-06 22:02:34,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:02:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 7503 transitions. [2018-11-06 22:02:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-06 22:02:34,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:02:34,946 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:02:34,946 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:02:34,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:02:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1978417967, now seen corresponding path program 1 times [2018-11-06 22:02:34,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:02:34,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:02:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:02:34,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:02:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:02:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:02:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:02:35,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:02:35,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:02:35,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:02:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:02:35,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:02:35,330 INFO L87 Difference]: Start difference. First operand 4560 states and 7503 transitions. Second operand 4 states. [2018-11-06 22:02:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:02:55,391 INFO L93 Difference]: Finished difference Result 17539 states and 29072 transitions. [2018-11-06 22:02:55,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:02:55,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-11-06 22:02:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:02:55,462 INFO L225 Difference]: With dead ends: 17539 [2018-11-06 22:02:55,463 INFO L226 Difference]: Without dead ends: 12981 [2018-11-06 22:02:55,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:02:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2018-11-06 22:02:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 8660. [2018-11-06 22:02:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8660 states. [2018-11-06 22:02:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 13864 transitions. [2018-11-06 22:02:55,683 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 13864 transitions. Word has length 117 [2018-11-06 22:02:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:02:55,684 INFO L480 AbstractCegarLoop]: Abstraction has 8660 states and 13864 transitions. [2018-11-06 22:02:55,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:02:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 13864 transitions. [2018-11-06 22:02:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-06 22:02:55,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:02:55,688 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:02:55,688 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:02:55,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:02:55,689 INFO L82 PathProgramCache]: Analyzing trace with hash -942819234, now seen corresponding path program 1 times [2018-11-06 22:02:55,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:02:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:02:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:02:55,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:02:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:02:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:02:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:02:56,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:02:56,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:02:56,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:02:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:02:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:02:56,090 INFO L87 Difference]: Start difference. First operand 8660 states and 13864 transitions. Second operand 4 states. [2018-11-06 22:03:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:03:13,853 INFO L93 Difference]: Finished difference Result 33825 states and 54421 transitions. [2018-11-06 22:03:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:03:13,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-11-06 22:03:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:03:13,947 INFO L225 Difference]: With dead ends: 33825 [2018-11-06 22:03:13,947 INFO L226 Difference]: Without dead ends: 25167 [2018-11-06 22:03:13,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:03:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25167 states. [2018-11-06 22:03:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25167 to 16872. [2018-11-06 22:03:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16872 states. [2018-11-06 22:03:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16872 states to 16872 states and 23661 transitions. [2018-11-06 22:03:14,294 INFO L78 Accepts]: Start accepts. Automaton has 16872 states and 23661 transitions. Word has length 139 [2018-11-06 22:03:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:03:14,295 INFO L480 AbstractCegarLoop]: Abstraction has 16872 states and 23661 transitions. [2018-11-06 22:03:14,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:03:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 16872 states and 23661 transitions. [2018-11-06 22:03:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-06 22:03:14,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:03:14,299 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:03:14,300 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:03:14,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:03:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1717913076, now seen corresponding path program 1 times [2018-11-06 22:03:14,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:03:14,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:03:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:03:14,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:03:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:03:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:03:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:03:14,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:03:14,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:03:14,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:03:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:03:14,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:03:14,547 INFO L87 Difference]: Start difference. First operand 16872 states and 23661 transitions. Second operand 4 states. [2018-11-06 22:03:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:03:29,867 INFO L93 Difference]: Finished difference Result 65437 states and 92309 transitions. [2018-11-06 22:03:29,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:03:29,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-11-06 22:03:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:03:29,947 INFO L225 Difference]: With dead ends: 65437 [2018-11-06 22:03:29,947 INFO L226 Difference]: Without dead ends: 48567 [2018-11-06 22:03:29,972 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:03:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48567 states. [2018-11-06 22:03:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48567 to 48556. [2018-11-06 22:03:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48556 states. [2018-11-06 22:03:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48556 states to 48556 states and 60402 transitions. [2018-11-06 22:03:30,586 INFO L78 Accepts]: Start accepts. Automaton has 48556 states and 60402 transitions. Word has length 164 [2018-11-06 22:03:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:03:30,587 INFO L480 AbstractCegarLoop]: Abstraction has 48556 states and 60402 transitions. [2018-11-06 22:03:30,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:03:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 48556 states and 60402 transitions. [2018-11-06 22:03:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-11-06 22:03:30,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:03:30,603 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 22:03:30,603 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:03:30,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:03:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash -807048280, now seen corresponding path program 1 times [2018-11-06 22:03:30,604 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:03:30,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:03:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:03:30,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:03:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:03:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:03:31,133 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 22:03:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-06 22:03:31,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:03:31,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:03:31,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:03:31,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:03:31,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:03:31,827 INFO L87 Difference]: Start difference. First operand 48556 states and 60402 transitions. Second operand 7 states. [2018-11-06 22:03:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:03:57,789 INFO L93 Difference]: Finished difference Result 118982 states and 144120 transitions. [2018-11-06 22:03:57,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:03:57,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 475 [2018-11-06 22:03:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:03:57,883 INFO L225 Difference]: With dead ends: 118982 [2018-11-06 22:03:57,884 INFO L226 Difference]: Without dead ends: 70428 [2018-11-06 22:03:57,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:03:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70428 states. [2018-11-06 22:03:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70428 to 66324. [2018-11-06 22:03:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66324 states. [2018-11-06 22:03:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66324 states to 66324 states and 79036 transitions. [2018-11-06 22:03:58,773 INFO L78 Accepts]: Start accepts. Automaton has 66324 states and 79036 transitions. Word has length 475 [2018-11-06 22:03:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:03:58,774 INFO L480 AbstractCegarLoop]: Abstraction has 66324 states and 79036 transitions. [2018-11-06 22:03:58,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:03:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 66324 states and 79036 transitions. [2018-11-06 22:03:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-11-06 22:03:58,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:03:58,789 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 22:03:58,790 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:03:58,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:03:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1314290610, now seen corresponding path program 1 times [2018-11-06 22:03:58,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:03:58,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:03:58,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:03:58,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:03:58,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:03:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:03:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-06 22:03:59,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:03:59,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:03:59,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:03:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:03:59,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:03:59,422 INFO L87 Difference]: Start difference. First operand 66324 states and 79036 transitions. Second operand 4 states. [2018-11-06 22:04:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:17,204 INFO L93 Difference]: Finished difference Result 229808 states and 277722 transitions. [2018-11-06 22:04:17,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:04:17,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 503 [2018-11-06 22:04:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:17,426 INFO L225 Difference]: With dead ends: 229808 [2018-11-06 22:04:17,427 INFO L226 Difference]: Without dead ends: 163486 [2018-11-06 22:04:17,484 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:04:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163486 states. [2018-11-06 22:04:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163486 to 160600. [2018-11-06 22:04:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160600 states. [2018-11-06 22:04:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160600 states to 160600 states and 187473 transitions. [2018-11-06 22:04:18,996 INFO L78 Accepts]: Start accepts. Automaton has 160600 states and 187473 transitions. Word has length 503 [2018-11-06 22:04:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:18,996 INFO L480 AbstractCegarLoop]: Abstraction has 160600 states and 187473 transitions. [2018-11-06 22:04:18,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:04:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 160600 states and 187473 transitions. [2018-11-06 22:04:19,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2018-11-06 22:04:19,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:19,037 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:19,038 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:19,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:19,038 INFO L82 PathProgramCache]: Analyzing trace with hash -777559246, now seen corresponding path program 1 times [2018-11-06 22:04:19,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:19,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:19,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:19,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:19,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 794 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-06 22:04:19,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:19,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:04:19,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:04:19,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:04:19,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:04:19,959 INFO L87 Difference]: Start difference. First operand 160600 states and 187473 transitions. Second operand 4 states. [2018-11-06 22:04:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:37,367 INFO L93 Difference]: Finished difference Result 389502 states and 459227 transitions. [2018-11-06 22:04:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:04:37,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 751 [2018-11-06 22:04:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:37,619 INFO L225 Difference]: With dead ends: 389502 [2018-11-06 22:04:37,619 INFO L226 Difference]: Without dead ends: 230270 [2018-11-06 22:04:37,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:04:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230270 states. [2018-11-06 22:04:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230270 to 230259. [2018-11-06 22:04:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230259 states. [2018-11-06 22:04:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230259 states to 230259 states and 261185 transitions. [2018-11-06 22:04:40,494 INFO L78 Accepts]: Start accepts. Automaton has 230259 states and 261185 transitions. Word has length 751 [2018-11-06 22:04:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:40,494 INFO L480 AbstractCegarLoop]: Abstraction has 230259 states and 261185 transitions. [2018-11-06 22:04:40,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:04:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 230259 states and 261185 transitions. [2018-11-06 22:04:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-11-06 22:04:40,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:40,528 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:40,529 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:40,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:40,529 INFO L82 PathProgramCache]: Analyzing trace with hash -962202982, now seen corresponding path program 1 times [2018-11-06 22:04:40,529 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:40,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:40,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:40,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-06 22:04:42,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:42,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:04:42,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:04:42,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:04:42,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:04:42,788 INFO L87 Difference]: Start difference. First operand 230259 states and 261185 transitions. Second operand 4 states. [2018-11-06 22:04:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:56,984 INFO L93 Difference]: Finished difference Result 459149 states and 520991 transitions. [2018-11-06 22:04:56,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:04:56,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1062 [2018-11-06 22:04:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:57,263 INFO L225 Difference]: With dead ends: 459149 [2018-11-06 22:04:57,264 INFO L226 Difference]: Without dead ends: 230258 [2018-11-06 22:04:57,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:04:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230258 states. [2018-11-06 22:05:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230258 to 220689. [2018-11-06 22:05:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220689 states. [2018-11-06 22:05:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220689 states to 220689 states and 240229 transitions. [2018-11-06 22:05:00,557 INFO L78 Accepts]: Start accepts. Automaton has 220689 states and 240229 transitions. Word has length 1062 [2018-11-06 22:05:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:00,558 INFO L480 AbstractCegarLoop]: Abstraction has 220689 states and 240229 transitions. [2018-11-06 22:05:00,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:05:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 220689 states and 240229 transitions. [2018-11-06 22:05:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2018-11-06 22:05:00,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:00,599 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:00,599 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:00,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1295666853, now seen corresponding path program 1 times [2018-11-06 22:05:00,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:00,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:00,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 826 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-06 22:05:03,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:05:03,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:05:03,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:05:03,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:05:03,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:05:03,400 INFO L87 Difference]: Start difference. First operand 220689 states and 240229 transitions. Second operand 4 states. [2018-11-06 22:05:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:24,399 INFO L93 Difference]: Finished difference Result 552183 states and 602340 transitions. [2018-11-06 22:05:24,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:05:24,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1141 [2018-11-06 22:05:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:24,771 INFO L225 Difference]: With dead ends: 552183 [2018-11-06 22:05:24,771 INFO L226 Difference]: Without dead ends: 324652 [2018-11-06 22:05:24,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:05:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324652 states. [2018-11-06 22:05:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324652 to 320399. [2018-11-06 22:05:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320399 states. [2018-11-06 22:05:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320399 states to 320399 states and 345229 transitions. [2018-11-06 22:05:35,009 INFO L78 Accepts]: Start accepts. Automaton has 320399 states and 345229 transitions. Word has length 1141 [2018-11-06 22:05:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:35,010 INFO L480 AbstractCegarLoop]: Abstraction has 320399 states and 345229 transitions. [2018-11-06 22:05:35,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:05:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 320399 states and 345229 transitions. [2018-11-06 22:05:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1151 [2018-11-06 22:05:35,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:35,043 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:35,043 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:35,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash -860539882, now seen corresponding path program 1 times [2018-11-06 22:05:35,044 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:35,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:35,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:35,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 917 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-11-06 22:05:37,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:05:37,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:05:37,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:05:37,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:05:37,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:05:37,280 INFO L87 Difference]: Start difference. First operand 320399 states and 345229 transitions. Second operand 5 states. Received shutdown request... [2018-11-06 22:05:41,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:05:41,722 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 22:05:41,728 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 22:05:41,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:05:41 BoogieIcfgContainer [2018-11-06 22:05:41,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:05:41,729 INFO L168 Benchmark]: Toolchain (without parser) took 228149.62 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-06 22:05:41,730 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:05:41,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3302.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 991.9 MB in the end (delta: 381.3 MB). Peak memory consumption was 381.3 MB. Max. memory is 7.1 GB. [2018-11-06 22:05:41,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 988.33 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 846.7 MB). Free memory was 991.9 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 98.9 MB. Max. memory is 7.1 GB. [2018-11-06 22:05:41,732 INFO L168 Benchmark]: Boogie Preprocessor took 919.82 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 98.7 MB). Peak memory consumption was 98.7 MB. Max. memory is 7.1 GB. [2018-11-06 22:05:41,733 INFO L168 Benchmark]: RCFGBuilder took 15658.53 ms. Allocated memory was 2.4 GB in the beginning and 2.7 GB in the end (delta: 291.0 MB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -415.0 MB). Peak memory consumption was 848.4 MB. Max. memory is 7.1 GB. [2018-11-06 22:05:41,734 INFO L168 Benchmark]: TraceAbstraction took 207274.96 ms. Allocated memory was 2.7 GB in the beginning and 4.7 GB in the end (delta: 2.0 GB). Free memory was 2.4 GB in the beginning and 2.8 GB in the end (delta: -411.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-06 22:05:41,740 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3302.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 991.9 MB in the end (delta: 381.3 MB). Peak memory consumption was 381.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 988.33 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 846.7 MB). Free memory was 991.9 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 98.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 919.82 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 98.7 MB). Peak memory consumption was 98.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 15658.53 ms. Allocated memory was 2.4 GB in the beginning and 2.7 GB in the end (delta: 291.0 MB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -415.0 MB). Peak memory consumption was 848.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 207274.96 ms. Allocated memory was 2.7 GB in the beginning and 4.7 GB in the end (delta: 2.0 GB). Free memory was 2.4 GB in the beginning and 2.8 GB in the end (delta: -411.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (320399states) and FLOYD_HOARE automaton (currently 5 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (33407 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1749 locations, 1 error locations. TIMEOUT Result, 207.1s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 175.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14432 SDtfs, 39326 SDslu, 3616 SDs, 0 SdLazy, 89445 SolverSat, 21236 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 140.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320399occurred in iteration=9, 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: 19.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 33455 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 5549 NumberOfCodeBlocks, 5549 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 5539 ConstructedInterpolants, 0 QuantifiedInterpolants, 7862957 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4944/4944 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown