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/Problem17_label12_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:40:05,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:40:05,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:40:05,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:40:05,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:40:05,334 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:40:05,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:40:05,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:40:05,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:40:05,342 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:40:05,343 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:40:05,345 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:40:05,346 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:40:05,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:40:05,351 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:40:05,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:40:05,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:40:05,354 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:40:05,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:40:05,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:40:05,369 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:40:05,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:40:05,377 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:40:05,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:40:05,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:40:05,379 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:40:05,380 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:40:05,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:40:05,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:40:05,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:40:05,386 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:40:05,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:40:05,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:40:05,387 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:40:05,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:40:05,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:40:05,390 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 21:40:05,419 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:40:05,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:40:05,424 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:40:05,424 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:40:05,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:40:05,426 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:40:05,426 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:40:05,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:40:05,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:40:05,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:40:05,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:40:05,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:40:05,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:40:05,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:40:05,428 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:40:05,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:40:05,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:40:05,428 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:40:05,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:40:05,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:40:05,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:40:05,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:40:05,430 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:40:05,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:40:05,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:40:05,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:40:05,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:40:05,433 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:40:05,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:40:05,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:40:05,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:40:05,535 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:40:05,535 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:40:05,536 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label12_true-unreach-call.c [2018-11-06 21:40:05,601 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e54716bc/d8f9921904314076b44d6984793eacba/FLAG83480d676 [2018-11-06 21:40:06,298 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:40:06,301 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label12_true-unreach-call.c [2018-11-06 21:40:06,330 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e54716bc/d8f9921904314076b44d6984793eacba/FLAG83480d676 [2018-11-06 21:40:06,350 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e54716bc/d8f9921904314076b44d6984793eacba [2018-11-06 21:40:06,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:40:06,366 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:40:06,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:40:06,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:40:06,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:40:06,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:40:06" (1/1) ... [2018-11-06 21:40:06,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fab143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:06, skipping insertion in model container [2018-11-06 21:40:06,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:40:06" (1/1) ... [2018-11-06 21:40:06,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:40:06,516 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:40:07,554 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:40:07,559 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:40:07,967 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:40:07,990 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:40:07,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07 WrapperNode [2018-11-06 21:40:07,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:40:07,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:40:07,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:40:07,992 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:40:08,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (1/1) ... [2018-11-06 21:40:08,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (1/1) ... [2018-11-06 21:40:08,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:40:08,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:40:08,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:40:08,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:40:08,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (1/1) ... [2018-11-06 21:40:08,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (1/1) ... [2018-11-06 21:40:08,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (1/1) ... [2018-11-06 21:40:08,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (1/1) ... [2018-11-06 21:40:08,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (1/1) ... [2018-11-06 21:40:08,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (1/1) ... [2018-11-06 21:40:08,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (1/1) ... [2018-11-06 21:40:08,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:40:08,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:40:08,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:40:08,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:40:08,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (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 21:40:08,852 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:40:08,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:40:08,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:40:16,426 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:40:16,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:40:16 BoogieIcfgContainer [2018-11-06 21:40:16,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:40:16,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:40:16,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:40:16,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:40:16,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:40:06" (1/3) ... [2018-11-06 21:40:16,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db8572a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:40:16, skipping insertion in model container [2018-11-06 21:40:16,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:40:07" (2/3) ... [2018-11-06 21:40:16,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db8572a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:40:16, skipping insertion in model container [2018-11-06 21:40:16,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:40:16" (3/3) ... [2018-11-06 21:40:16,439 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label12_true-unreach-call.c [2018-11-06 21:40:16,448 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:40:16,458 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:40:16,474 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:40:16,516 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:40:16,517 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:40:16,517 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:40:16,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:40:16,518 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:40:16,518 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:40:16,518 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:40:16,518 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:40:16,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:40:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-11-06 21:40:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-06 21:40:16,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:40:16,572 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] [2018-11-06 21:40:16,575 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:40:16,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:40:16,582 INFO L82 PathProgramCache]: Analyzing trace with hash 646480794, now seen corresponding path program 1 times [2018-11-06 21:40:16,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:40:16,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:40:16,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:40:16,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:40:16,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:40:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:40:17,001 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 21:40:17,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:40:17,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:40:17,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:40:17,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:40:17,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:40:17,030 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-11-06 21:40:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:40:25,163 INFO L93 Difference]: Finished difference Result 2099 states and 3904 transitions. [2018-11-06 21:40:25,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:40:25,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-06 21:40:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:40:25,204 INFO L225 Difference]: With dead ends: 2099 [2018-11-06 21:40:25,204 INFO L226 Difference]: Without dead ends: 1501 [2018-11-06 21:40:25,219 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 21:40:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2018-11-06 21:40:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1499. [2018-11-06 21:40:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-11-06 21:40:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2373 transitions. [2018-11-06 21:40:25,369 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2373 transitions. Word has length 34 [2018-11-06 21:40:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:40:25,370 INFO L480 AbstractCegarLoop]: Abstraction has 1499 states and 2373 transitions. [2018-11-06 21:40:25,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:40:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2373 transitions. [2018-11-06 21:40:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-06 21:40:25,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:40:25,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:25,376 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:40:25,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:40:25,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1952848231, now seen corresponding path program 1 times [2018-11-06 21:40:25,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:40:25,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:40:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:40:25,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:40:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:40:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:40:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:40:25,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:40:25,871 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:40:25,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:40:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:40:25,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:40:26,469 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 23 [2018-11-06 21:40:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:40:26,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:40:26,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:40:26,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:40:26,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:40:26,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:40:26,675 INFO L87 Difference]: Start difference. First operand 1499 states and 2373 transitions. Second operand 7 states. [2018-11-06 21:41:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:41:28,977 INFO L93 Difference]: Finished difference Result 13867 states and 22366 transitions. [2018-11-06 21:41:28,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:41:28,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2018-11-06 21:41:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:41:29,037 INFO L225 Difference]: With dead ends: 13867 [2018-11-06 21:41:29,037 INFO L226 Difference]: Without dead ends: 12370 [2018-11-06 21:41:29,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:41:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12370 states. [2018-11-06 21:41:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12370 to 12301. [2018-11-06 21:41:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12301 states. [2018-11-06 21:41:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12301 states to 12301 states and 16264 transitions. [2018-11-06 21:41:29,281 INFO L78 Accepts]: Start accepts. Automaton has 12301 states and 16264 transitions. Word has length 105 [2018-11-06 21:41:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:41:29,281 INFO L480 AbstractCegarLoop]: Abstraction has 12301 states and 16264 transitions. [2018-11-06 21:41:29,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:41:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12301 states and 16264 transitions. [2018-11-06 21:41:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-06 21:41:29,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:41:29,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:29,300 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:41:29,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:41:29,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1685219773, now seen corresponding path program 1 times [2018-11-06 21:41:29,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:41:29,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:41:29,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:41:29,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:41:29,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:41:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:41:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:41:29,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:41:29,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:41:29,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:41:29,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:41:29,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:41:29,586 INFO L87 Difference]: Start difference. First operand 12301 states and 16264 transitions. Second operand 3 states. [2018-11-06 21:41:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:41:32,774 INFO L93 Difference]: Finished difference Result 35253 states and 46988 transitions. [2018-11-06 21:41:32,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:41:32,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-11-06 21:41:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:41:32,835 INFO L225 Difference]: With dead ends: 35253 [2018-11-06 21:41:32,836 INFO L226 Difference]: Without dead ends: 14261 [2018-11-06 21:41:32,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:41:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14261 states. [2018-11-06 21:41:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14261 to 14256. [2018-11-06 21:41:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14256 states. [2018-11-06 21:41:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14256 states to 14256 states and 16388 transitions. [2018-11-06 21:41:33,109 INFO L78 Accepts]: Start accepts. Automaton has 14256 states and 16388 transitions. Word has length 146 [2018-11-06 21:41:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:41:33,109 INFO L480 AbstractCegarLoop]: Abstraction has 14256 states and 16388 transitions. [2018-11-06 21:41:33,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:41:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 14256 states and 16388 transitions. [2018-11-06 21:41:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-06 21:41:33,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:41:33,115 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:41:33,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:41:33,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:41:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1032512144, now seen corresponding path program 1 times [2018-11-06 21:41:33,119 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:41:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:41:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:41:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:41:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:41:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:41:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-06 21:41:33,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:41:33,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:41:33,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:41:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:41:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:41:33,553 INFO L87 Difference]: Start difference. First operand 14256 states and 16388 transitions. Second operand 4 states. [2018-11-06 21:41:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:41:37,759 INFO L93 Difference]: Finished difference Result 35326 states and 41402 transitions. [2018-11-06 21:41:37,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:41:37,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 277 [2018-11-06 21:41:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:41:37,798 INFO L225 Difference]: With dead ends: 35326 [2018-11-06 21:41:37,798 INFO L226 Difference]: Without dead ends: 21499 [2018-11-06 21:41:37,813 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 21:41:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21499 states. [2018-11-06 21:41:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21499 to 21499. [2018-11-06 21:41:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21499 states. [2018-11-06 21:41:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21499 states to 21499 states and 24394 transitions. [2018-11-06 21:41:38,081 INFO L78 Accepts]: Start accepts. Automaton has 21499 states and 24394 transitions. Word has length 277 [2018-11-06 21:41:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:41:38,082 INFO L480 AbstractCegarLoop]: Abstraction has 21499 states and 24394 transitions. [2018-11-06 21:41:38,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:41:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 21499 states and 24394 transitions. [2018-11-06 21:41:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-06 21:41:38,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:41:38,087 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:41:38,088 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:41:38,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:41:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1999642880, now seen corresponding path program 1 times [2018-11-06 21:41:38,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:41:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:41:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:41:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:41:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:41:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:41:38,935 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-06 21:41:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 208 proven. 83 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-06 21:41:39,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:41:39,142 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:41:39,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:41:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:41:39,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:41:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 208 proven. 83 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-06 21:41:39,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:41:39,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-11-06 21:41:39,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:41:39,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:41:39,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:41:39,812 INFO L87 Difference]: Start difference. First operand 21499 states and 24394 transitions. Second operand 9 states. [2018-11-06 21:41:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:41:50,089 INFO L93 Difference]: Finished difference Result 46839 states and 53035 transitions. [2018-11-06 21:41:50,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:41:50,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 297 [2018-11-06 21:41:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:41:50,139 INFO L225 Difference]: With dead ends: 46839 [2018-11-06 21:41:50,139 INFO L226 Difference]: Without dead ends: 25342 [2018-11-06 21:41:50,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:41:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25342 states. [2018-11-06 21:41:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25342 to 24909. [2018-11-06 21:41:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24909 states. [2018-11-06 21:41:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24909 states to 24909 states and 27893 transitions. [2018-11-06 21:41:50,452 INFO L78 Accepts]: Start accepts. Automaton has 24909 states and 27893 transitions. Word has length 297 [2018-11-06 21:41:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:41:50,452 INFO L480 AbstractCegarLoop]: Abstraction has 24909 states and 27893 transitions. [2018-11-06 21:41:50,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:41:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 24909 states and 27893 transitions. [2018-11-06 21:41:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-06 21:41:50,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:41:50,468 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, 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, 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] [2018-11-06 21:41:50,468 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:41:50,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:41:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1561886431, now seen corresponding path program 1 times [2018-11-06 21:41:50,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:41:50,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:41:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:41:50,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:41:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:41:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:41:50,973 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 21:41:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 418 proven. 32 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2018-11-06 21:41:51,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:41:51,534 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:41:51,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:41:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:41:51,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:42:42,105 WARN L179 SmtUtils]: Spent 50.19 s on a formula simplification. DAG size of input: 224 DAG size of output: 59 [2018-11-06 21:42:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2018-11-06 21:42:42,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:42:42,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-06 21:42:42,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:42:42,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:42:42,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:42:42,997 INFO L87 Difference]: Start difference. First operand 24909 states and 27893 transitions. Second operand 6 states. [2018-11-06 21:42:49,162 WARN L179 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-11-06 21:43:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:43:26,633 INFO L93 Difference]: Finished difference Result 86613 states and 97243 transitions. [2018-11-06 21:43:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:43:26,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 484 [2018-11-06 21:43:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:43:26,706 INFO L225 Difference]: With dead ends: 86613 [2018-11-06 21:43:26,706 INFO L226 Difference]: Without dead ends: 55722 [2018-11-06 21:43:26,731 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:43:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55722 states. [2018-11-06 21:43:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55722 to 44124. [2018-11-06 21:43:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44124 states. [2018-11-06 21:43:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44124 states to 44124 states and 49283 transitions. [2018-11-06 21:43:27,298 INFO L78 Accepts]: Start accepts. Automaton has 44124 states and 49283 transitions. Word has length 484 [2018-11-06 21:43:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:43:27,299 INFO L480 AbstractCegarLoop]: Abstraction has 44124 states and 49283 transitions. [2018-11-06 21:43:27,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:43:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44124 states and 49283 transitions. [2018-11-06 21:43:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-11-06 21:43:27,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:43:27,317 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 21:43:27,318 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:43:27,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:43:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1468623700, now seen corresponding path program 1 times [2018-11-06 21:43:27,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:43:27,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:43:27,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:27,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:27,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:27,712 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-06 21:43:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-06 21:43:28,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:43:28,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:43:28,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:43:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:43:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:43:28,114 INFO L87 Difference]: Start difference. First operand 44124 states and 49283 transitions. Second operand 3 states. [2018-11-06 21:43:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:43:31,210 INFO L93 Difference]: Finished difference Result 100181 states and 112490 transitions. [2018-11-06 21:43:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:43:31,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2018-11-06 21:43:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:43:31,269 INFO L225 Difference]: With dead ends: 100181 [2018-11-06 21:43:31,269 INFO L226 Difference]: Without dead ends: 55627 [2018-11-06 21:43:31,300 INFO L604 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-11-06 21:43:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55627 states. [2018-11-06 21:43:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55627 to 52203. [2018-11-06 21:43:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52203 states. [2018-11-06 21:43:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52203 states to 52203 states and 56939 transitions. [2018-11-06 21:43:31,826 INFO L78 Accepts]: Start accepts. Automaton has 52203 states and 56939 transitions. Word has length 495 [2018-11-06 21:43:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:43:31,827 INFO L480 AbstractCegarLoop]: Abstraction has 52203 states and 56939 transitions. [2018-11-06 21:43:31,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:43:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 52203 states and 56939 transitions. [2018-11-06 21:43:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-11-06 21:43:31,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:43:31,847 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 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] [2018-11-06 21:43:31,847 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:43:31,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:43:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash 542572590, now seen corresponding path program 1 times [2018-11-06 21:43:31,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:43:31,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:43:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:31,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:31,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-11-06 21:43:32,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:43:32,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:43:32,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:43:32,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:43:32,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:43:32,377 INFO L87 Difference]: Start difference. First operand 52203 states and 56939 transitions. Second operand 3 states. [2018-11-06 21:43:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:43:35,074 INFO L93 Difference]: Finished difference Result 104827 states and 114602 transitions. [2018-11-06 21:43:35,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:43:35,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 517 [2018-11-06 21:43:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:43:35,120 INFO L225 Difference]: With dead ends: 104827 [2018-11-06 21:43:35,120 INFO L226 Difference]: Without dead ends: 53478 [2018-11-06 21:43:35,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:43:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53478 states. [2018-11-06 21:43:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53478 to 53052. [2018-11-06 21:43:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53052 states. [2018-11-06 21:43:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53052 states to 53052 states and 57669 transitions. [2018-11-06 21:43:35,631 INFO L78 Accepts]: Start accepts. Automaton has 53052 states and 57669 transitions. Word has length 517 [2018-11-06 21:43:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:43:35,631 INFO L480 AbstractCegarLoop]: Abstraction has 53052 states and 57669 transitions. [2018-11-06 21:43:35,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:43:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 53052 states and 57669 transitions. [2018-11-06 21:43:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-11-06 21:43:35,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:43:35,646 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:43:35,646 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:43:35,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:43:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1967453608, now seen corresponding path program 1 times [2018-11-06 21:43:35,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:43:35,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:43:35,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:35,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:35,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-06 21:43:36,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:43:36,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:43:36,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:43:36,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:43:36,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:43:36,103 INFO L87 Difference]: Start difference. First operand 53052 states and 57669 transitions. Second operand 3 states. [2018-11-06 21:43:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:43:39,218 INFO L93 Difference]: Finished difference Result 115479 states and 125655 transitions. [2018-11-06 21:43:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:43:39,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 552 [2018-11-06 21:43:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:43:39,290 INFO L225 Difference]: With dead ends: 115479 [2018-11-06 21:43:39,290 INFO L226 Difference]: Without dead ends: 63281 [2018-11-06 21:43:39,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:43:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63281 states. [2018-11-06 21:43:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63281 to 61572. [2018-11-06 21:43:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61572 states. [2018-11-06 21:43:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61572 states to 61572 states and 66496 transitions. [2018-11-06 21:43:40,272 INFO L78 Accepts]: Start accepts. Automaton has 61572 states and 66496 transitions. Word has length 552 [2018-11-06 21:43:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:43:40,273 INFO L480 AbstractCegarLoop]: Abstraction has 61572 states and 66496 transitions. [2018-11-06 21:43:40,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:43:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 61572 states and 66496 transitions. [2018-11-06 21:43:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-11-06 21:43:40,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:43:40,285 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:40,285 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:43:40,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:43:40,286 INFO L82 PathProgramCache]: Analyzing trace with hash -886184829, now seen corresponding path program 1 times [2018-11-06 21:43:40,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:43:40,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:43:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:40,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-11-06 21:43:40,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:43:40,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:43:40,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:43:40,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:43:40,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:43:40,835 INFO L87 Difference]: Start difference. First operand 61572 states and 66496 transitions. Second operand 5 states. [2018-11-06 21:43:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:43:47,164 INFO L93 Difference]: Finished difference Result 148807 states and 160663 transitions. [2018-11-06 21:43:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:43:47,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 571 [2018-11-06 21:43:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:43:47,249 INFO L225 Difference]: With dead ends: 148807 [2018-11-06 21:43:47,249 INFO L226 Difference]: Without dead ends: 85956 [2018-11-06 21:43:47,286 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:43:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85956 states. [2018-11-06 21:43:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85956 to 85070. [2018-11-06 21:43:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85070 states. [2018-11-06 21:43:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85070 states to 85070 states and 91642 transitions. [2018-11-06 21:43:48,630 INFO L78 Accepts]: Start accepts. Automaton has 85070 states and 91642 transitions. Word has length 571 [2018-11-06 21:43:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:43:48,631 INFO L480 AbstractCegarLoop]: Abstraction has 85070 states and 91642 transitions. [2018-11-06 21:43:48,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:43:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 85070 states and 91642 transitions. [2018-11-06 21:43:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-11-06 21:43:48,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:43:48,644 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:48,645 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:43:48,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:43:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1514230869, now seen corresponding path program 1 times [2018-11-06 21:43:48,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:43:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:43:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:48,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-06 21:43:49,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:43:49,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:43:49,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:43:49,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:43:49,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:43:49,208 INFO L87 Difference]: Start difference. First operand 85070 states and 91642 transitions. Second operand 3 states. [2018-11-06 21:43:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:43:50,859 INFO L93 Difference]: Finished difference Result 165853 states and 178568 transitions. [2018-11-06 21:43:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:43:50,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 591 [2018-11-06 21:43:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:43:50,937 INFO L225 Difference]: With dead ends: 165853 [2018-11-06 21:43:50,937 INFO L226 Difference]: Without dead ends: 81634 [2018-11-06 21:43:50,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:43:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81634 states. [2018-11-06 21:43:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81634 to 81621. [2018-11-06 21:43:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81621 states. [2018-11-06 21:43:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81621 states to 81621 states and 87728 transitions. [2018-11-06 21:43:51,693 INFO L78 Accepts]: Start accepts. Automaton has 81621 states and 87728 transitions. Word has length 591 [2018-11-06 21:43:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:43:51,694 INFO L480 AbstractCegarLoop]: Abstraction has 81621 states and 87728 transitions. [2018-11-06 21:43:51,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:43:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 81621 states and 87728 transitions. [2018-11-06 21:43:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2018-11-06 21:43:51,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:43:51,710 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:43:51,710 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:43:51,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:43:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash -164242196, now seen corresponding path program 1 times [2018-11-06 21:43:51,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:43:51,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:43:51,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:51,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2018-11-06 21:43:53,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:43:53,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:43:53,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:43:53,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:43:53,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:43:53,152 INFO L87 Difference]: Start difference. First operand 81621 states and 87728 transitions. Second operand 3 states. [2018-11-06 21:43:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:43:57,084 INFO L93 Difference]: Finished difference Result 174737 states and 188103 transitions. [2018-11-06 21:43:57,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:43:57,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 608 [2018-11-06 21:43:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:43:57,192 INFO L225 Difference]: With dead ends: 174737 [2018-11-06 21:43:57,192 INFO L226 Difference]: Without dead ends: 93115 [2018-11-06 21:43:57,239 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:43:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93115 states. [2018-11-06 21:43:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93115 to 91394. [2018-11-06 21:43:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91394 states. [2018-11-06 21:43:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91394 states to 91394 states and 97665 transitions. [2018-11-06 21:43:58,073 INFO L78 Accepts]: Start accepts. Automaton has 91394 states and 97665 transitions. Word has length 608 [2018-11-06 21:43:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:43:58,074 INFO L480 AbstractCegarLoop]: Abstraction has 91394 states and 97665 transitions. [2018-11-06 21:43:58,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:43:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 91394 states and 97665 transitions. [2018-11-06 21:43:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-11-06 21:43:58,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:43:58,090 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:43:58,091 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:43:58,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:43:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1606731535, now seen corresponding path program 1 times [2018-11-06 21:43:58,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:43:58,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:43:58,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:58,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:58,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:58,665 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-11-06 21:43:58,847 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2018-11-06 21:43:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 938 trivial. 0 not checked. [2018-11-06 21:43:59,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:43:59,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:43:59,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:43:59,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:43:59,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:43:59,799 INFO L87 Difference]: Start difference. First operand 91394 states and 97665 transitions. Second operand 5 states. [2018-11-06 21:44:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:44:07,133 INFO L93 Difference]: Finished difference Result 105054 states and 112121 transitions. [2018-11-06 21:44:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:44:07,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 622 [2018-11-06 21:44:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:44:07,232 INFO L225 Difference]: With dead ends: 105054 [2018-11-06 21:44:07,233 INFO L226 Difference]: Without dead ends: 104626 [2018-11-06 21:44:07,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:44:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104626 states. [2018-11-06 21:44:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104626 to 91394. [2018-11-06 21:44:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91394 states. [2018-11-06 21:44:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91394 states to 91394 states and 97660 transitions. [2018-11-06 21:44:08,122 INFO L78 Accepts]: Start accepts. Automaton has 91394 states and 97660 transitions. Word has length 622 [2018-11-06 21:44:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:44:08,123 INFO L480 AbstractCegarLoop]: Abstraction has 91394 states and 97660 transitions. [2018-11-06 21:44:08,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:44:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 91394 states and 97660 transitions. [2018-11-06 21:44:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-11-06 21:44:08,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:44:08,154 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:08,154 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:44:08,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:44:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1802577366, now seen corresponding path program 1 times [2018-11-06 21:44:08,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:44:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:44:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:08,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:44:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:44:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2018-11-06 21:44:09,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:44:09,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:44:09,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:44:09,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:44:09,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:44:09,983 INFO L87 Difference]: Start difference. First operand 91394 states and 97660 transitions. Second operand 4 states. Received shutdown request... [2018-11-06 21:44:10,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:44:10,186 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:44:10,193 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:44:10,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:44:10 BoogieIcfgContainer [2018-11-06 21:44:10,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:44:10,194 INFO L168 Benchmark]: Toolchain (without parser) took 243829.69 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:44:10,198 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-11-06 21:44:10,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1624.28 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: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:44:10,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 512.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 784.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -914.0 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:44:10,202 INFO L168 Benchmark]: Boogie Preprocessor took 274.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:44:10,205 INFO L168 Benchmark]: RCFGBuilder took 7648.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 459.4 MB). Peak memory consumption was 459.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:44:10,206 INFO L168 Benchmark]: TraceAbstraction took 233764.84 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: -527.7 MB). Peak memory consumption was 982.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:44:10,218 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 1624.28 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: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 512.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 784.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -914.0 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 274.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7648.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 459.4 MB). Peak memory consumption was 459.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 233764.84 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: -527.7 MB). Peak memory consumption was 982.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 107). Cancelled while BasicCegarLoop was constructing difference of abstraction (91394states) and FLOYD_HOARE automaton (currently 3 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (13 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 591 locations, 1 error locations. TIMEOUT Result, 233.6s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 161.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6534 SDtfs, 16887 SDslu, 2363 SDs, 0 SdLazy, 49084 SolverSat, 6348 SolverUnsat, 39 SolverUnknown, 0 SolverNotchecked, 141.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 948 GetRequests, 904 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 55.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91394occurred in iteration=12, 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: 7.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 33518 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 57.8s InterpolantComputationTime, 6918 NumberOfCodeBlocks, 6918 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6901 ConstructedInterpolants, 64 QuantifiedInterpolants, 8893691 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1225 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 10183/10412 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown