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/Problem13_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:21:50,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:21:50,491 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:21:50,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:21:50,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:21:50,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:21:50,512 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:21:50,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:21:50,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:21:50,518 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:21:50,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:21:50,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:21:50,522 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:21:50,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:21:50,532 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:21:50,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:21:50,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:21:50,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:21:50,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:21:50,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:21:50,549 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:21:50,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:21:50,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:21:50,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:21:50,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:21:50,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:21:50,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:21:50,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:21:50,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:21:50,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:21:50,562 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:21:50,563 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:21:50,564 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:21:50,564 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:21:50,565 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:21:50,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:21:50,567 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:21:50,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:21:50,597 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:21:50,598 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:21:50,599 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:21:50,599 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:21:50,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:21:50,600 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:21:50,600 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:21:50,600 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:21:50,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:21:50,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:21:50,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:21:50,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:21:50,602 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:21:50,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:21:50,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:21:50,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:21:50,603 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:21:50,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:21:50,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:21:50,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:21:50,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:21:50,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:21:50,606 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:21:50,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:21:50,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:21:50,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:21:50,607 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:21:50,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:21:50,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:21:50,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:21:50,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:21:50,681 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:21:50,682 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label49_true-unreach-call.c [2018-11-06 21:21:50,768 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c198f76/9f1def38a619436e9afc30294f24d6e9/FLAG2278b017a [2018-11-06 21:21:51,582 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:21:51,583 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label49_true-unreach-call.c [2018-11-06 21:21:51,621 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c198f76/9f1def38a619436e9afc30294f24d6e9/FLAG2278b017a [2018-11-06 21:21:51,641 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c198f76/9f1def38a619436e9afc30294f24d6e9 [2018-11-06 21:21:51,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:21:51,656 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:21:51,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:21:51,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:21:51,666 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:21:51,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:21:51" (1/1) ... [2018-11-06 21:21:51,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b330f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:51, skipping insertion in model container [2018-11-06 21:21:51,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:21:51" (1/1) ... [2018-11-06 21:21:51,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:21:51,868 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:21:53,347 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:21:53,353 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:21:54,232 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:21:54,275 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:21:54,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54 WrapperNode [2018-11-06 21:21:54,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:21:54,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:21:54,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:21:54,278 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:21:54,290 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:21:54" (1/1) ... [2018-11-06 21:21:54,681 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:21:54" (1/1) ... [2018-11-06 21:21:55,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:21:55,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:21:55,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:21:55,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:21:55,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54" (1/1) ... [2018-11-06 21:21:55,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54" (1/1) ... [2018-11-06 21:21:55,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54" (1/1) ... [2018-11-06 21:21:55,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54" (1/1) ... [2018-11-06 21:21:55,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54" (1/1) ... [2018-11-06 21:21:55,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54" (1/1) ... [2018-11-06 21:21:55,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54" (1/1) ... [2018-11-06 21:21:55,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:21:55,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:21:55,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:21:55,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:21:55,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54" (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:21:55,801 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:21:55,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:21:55,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:22:07,486 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:22:07,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:07 BoogieIcfgContainer [2018-11-06 21:22:07,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:22:07,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:22:07,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:22:07,492 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:22:07,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:21:51" (1/3) ... [2018-11-06 21:22:07,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9d9c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:07, skipping insertion in model container [2018-11-06 21:22:07,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:54" (2/3) ... [2018-11-06 21:22:07,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9d9c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:07, skipping insertion in model container [2018-11-06 21:22:07,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:07" (3/3) ... [2018-11-06 21:22:07,496 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label49_true-unreach-call.c [2018-11-06 21:22:07,506 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:22:07,515 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:22:07,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:22:07,591 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:22:07,592 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:22:07,592 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:22:07,592 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:22:07,592 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:22:07,592 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:22:07,593 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:22:07,593 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:22:07,593 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:22:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 21:22:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-06 21:22:07,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:07,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:22:07,654 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:07,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1281577798, now seen corresponding path program 1 times [2018-11-06 21:22:07,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:07,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:07,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:07,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:08,204 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 21:22:08,260 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:22:08,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:08,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:22:08,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:22:08,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:22:08,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:08,302 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 21:22:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:22:22,351 INFO L93 Difference]: Finished difference Result 3991 states and 7504 transitions. [2018-11-06 21:22:22,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:22:22,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-06 21:22:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:22:22,402 INFO L225 Difference]: With dead ends: 3991 [2018-11-06 21:22:22,403 INFO L226 Difference]: Without dead ends: 2885 [2018-11-06 21:22:22,413 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:22:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2018-11-06 21:22:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1946. [2018-11-06 21:22:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2018-11-06 21:22:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 3412 transitions. [2018-11-06 21:22:22,585 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 3412 transitions. Word has length 59 [2018-11-06 21:22:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:22:22,585 INFO L480 AbstractCegarLoop]: Abstraction has 1946 states and 3412 transitions. [2018-11-06 21:22:22,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:22:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 3412 transitions. [2018-11-06 21:22:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-06 21:22:22,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:22,594 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, 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 21:22:22,594 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:22,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:22,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1396402041, now seen corresponding path program 1 times [2018-11-06 21:22:22,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:22,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:22,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:22,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:22:22,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:22,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:22:22,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:22:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:22:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:22,895 INFO L87 Difference]: Start difference. First operand 1946 states and 3412 transitions. Second operand 4 states. [2018-11-06 21:22:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:22:35,329 INFO L93 Difference]: Finished difference Result 7107 states and 12745 transitions. [2018-11-06 21:22:35,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:22:35,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-11-06 21:22:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:22:35,360 INFO L225 Difference]: With dead ends: 7107 [2018-11-06 21:22:35,360 INFO L226 Difference]: Without dead ends: 5163 [2018-11-06 21:22:35,366 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:22:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2018-11-06 21:22:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 5141. [2018-11-06 21:22:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5141 states. [2018-11-06 21:22:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5141 states to 5141 states and 8063 transitions. [2018-11-06 21:22:35,466 INFO L78 Accepts]: Start accepts. Automaton has 5141 states and 8063 transitions. Word has length 126 [2018-11-06 21:22:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:22:35,467 INFO L480 AbstractCegarLoop]: Abstraction has 5141 states and 8063 transitions. [2018-11-06 21:22:35,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:22:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5141 states and 8063 transitions. [2018-11-06 21:22:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-06 21:22:35,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:35,472 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:22:35,472 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:35,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash -475148071, now seen corresponding path program 1 times [2018-11-06 21:22:35,473 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:35,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:35,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:22:35,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:35,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:22:35,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:22:35,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:22:35,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:35,685 INFO L87 Difference]: Start difference. First operand 5141 states and 8063 transitions. Second operand 4 states. [2018-11-06 21:22:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:22:44,341 INFO L93 Difference]: Finished difference Result 13480 states and 21596 transitions. [2018-11-06 21:22:44,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:22:44,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-11-06 21:22:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:22:44,384 INFO L225 Difference]: With dead ends: 13480 [2018-11-06 21:22:44,384 INFO L226 Difference]: Without dead ends: 8341 [2018-11-06 21:22:44,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8341 states. [2018-11-06 21:22:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8341 to 8306. [2018-11-06 21:22:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8306 states. [2018-11-06 21:22:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8306 states to 8306 states and 12291 transitions. [2018-11-06 21:22:44,586 INFO L78 Accepts]: Start accepts. Automaton has 8306 states and 12291 transitions. Word has length 156 [2018-11-06 21:22:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:22:44,587 INFO L480 AbstractCegarLoop]: Abstraction has 8306 states and 12291 transitions. [2018-11-06 21:22:44,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:22:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 8306 states and 12291 transitions. [2018-11-06 21:22:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-06 21:22:44,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:44,592 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, 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] [2018-11-06 21:22:44,592 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:44,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:44,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1043698077, now seen corresponding path program 1 times [2018-11-06 21:22:44,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:44,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:44,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:22:44,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:44,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:22:44,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:22:44,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:22:44,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:44,961 INFO L87 Difference]: Start difference. First operand 8306 states and 12291 transitions. Second operand 4 states. [2018-11-06 21:22:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:22:56,558 INFO L93 Difference]: Finished difference Result 32419 states and 48135 transitions. [2018-11-06 21:22:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:22:56,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-11-06 21:22:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:22:56,631 INFO L225 Difference]: With dead ends: 32419 [2018-11-06 21:22:56,632 INFO L226 Difference]: Without dead ends: 24115 [2018-11-06 21:22:56,651 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:22:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24115 states. [2018-11-06 21:22:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24115 to 24106. [2018-11-06 21:22:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24106 states. [2018-11-06 21:22:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24106 states to 24106 states and 33018 transitions. [2018-11-06 21:22:57,229 INFO L78 Accepts]: Start accepts. Automaton has 24106 states and 33018 transitions. Word has length 160 [2018-11-06 21:22:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:22:57,229 INFO L480 AbstractCegarLoop]: Abstraction has 24106 states and 33018 transitions. [2018-11-06 21:22:57,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:22:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 24106 states and 33018 transitions. [2018-11-06 21:22:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-06 21:22:57,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:57,236 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 21:22:57,236 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:57,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1354219912, now seen corresponding path program 1 times [2018-11-06 21:22:57,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:57,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:57,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:57,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:57,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-06 21:22:57,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:57,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:22:57,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:22:57,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:22:57,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:22:57,628 INFO L87 Difference]: Start difference. First operand 24106 states and 33018 transitions. Second operand 5 states. [2018-11-06 21:23:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:07,162 INFO L93 Difference]: Finished difference Result 55348 states and 74217 transitions. [2018-11-06 21:23:07,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:23:07,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-11-06 21:23:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:07,223 INFO L225 Difference]: With dead ends: 55348 [2018-11-06 21:23:07,223 INFO L226 Difference]: Without dead ends: 31244 [2018-11-06 21:23:07,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:23:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31244 states. [2018-11-06 21:23:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31244 to 30418. [2018-11-06 21:23:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30418 states. [2018-11-06 21:23:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30418 states to 30418 states and 39945 transitions. [2018-11-06 21:23:07,753 INFO L78 Accepts]: Start accepts. Automaton has 30418 states and 39945 transitions. Word has length 223 [2018-11-06 21:23:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:07,753 INFO L480 AbstractCegarLoop]: Abstraction has 30418 states and 39945 transitions. [2018-11-06 21:23:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:23:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 30418 states and 39945 transitions. [2018-11-06 21:23:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-06 21:23:07,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:07,768 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:23:07,768 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:07,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash -40276901, now seen corresponding path program 1 times [2018-11-06 21:23:07,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:07,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:07,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:08,275 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:23:09,612 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-11-06 21:23:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 274 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-06 21:23:09,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:23:09,831 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:23:09,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:09,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:23:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-06 21:23:10,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:23:10,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-11-06 21:23:10,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:23:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:23:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:23:10,195 INFO L87 Difference]: Start difference. First operand 30418 states and 39945 transitions. Second operand 6 states. [2018-11-06 21:23:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:28,930 INFO L93 Difference]: Finished difference Result 149864 states and 196943 transitions. [2018-11-06 21:23:28,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:23:28,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 296 [2018-11-06 21:23:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:29,173 INFO L225 Difference]: With dead ends: 149864 [2018-11-06 21:23:29,173 INFO L226 Difference]: Without dead ends: 119448 [2018-11-06 21:23:29,234 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:23:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119448 states. [2018-11-06 21:23:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119448 to 117079. [2018-11-06 21:23:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117079 states. [2018-11-06 21:23:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117079 states to 117079 states and 136744 transitions. [2018-11-06 21:23:31,004 INFO L78 Accepts]: Start accepts. Automaton has 117079 states and 136744 transitions. Word has length 296 [2018-11-06 21:23:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:31,005 INFO L480 AbstractCegarLoop]: Abstraction has 117079 states and 136744 transitions. [2018-11-06 21:23:31,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:23:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 117079 states and 136744 transitions. [2018-11-06 21:23:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-11-06 21:23:31,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:31,036 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:23:31,037 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:31,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash 341673552, now seen corresponding path program 1 times [2018-11-06 21:23:31,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:31,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:31,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:31,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:31,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-06 21:23:31,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:23:31,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:23:31,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:23:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:23:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:23:31,910 INFO L87 Difference]: Start difference. First operand 117079 states and 136744 transitions. Second operand 5 states. [2018-11-06 21:23:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:47,037 INFO L93 Difference]: Finished difference Result 355595 states and 415006 transitions. [2018-11-06 21:23:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:23:47,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 465 [2018-11-06 21:23:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:47,441 INFO L225 Difference]: With dead ends: 355595 [2018-11-06 21:23:47,441 INFO L226 Difference]: Without dead ends: 239306 [2018-11-06 21:23:47,576 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:23:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239306 states. [2018-11-06 21:23:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239306 to 236140. [2018-11-06 21:23:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236140 states. [2018-11-06 21:23:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236140 states to 236140 states and 265602 transitions. [2018-11-06 21:23:50,982 INFO L78 Accepts]: Start accepts. Automaton has 236140 states and 265602 transitions. Word has length 465 [2018-11-06 21:23:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:50,983 INFO L480 AbstractCegarLoop]: Abstraction has 236140 states and 265602 transitions. [2018-11-06 21:23:50,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:23:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 236140 states and 265602 transitions. [2018-11-06 21:23:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-11-06 21:23:51,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:51,034 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 21:23:51,034 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:51,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:51,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1845717652, now seen corresponding path program 1 times [2018-11-06 21:23:51,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:51,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:51,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:51,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:51,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:51,521 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:23:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 467 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-06 21:23:51,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:23:51,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:23:51,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:23:51,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:23:51,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:23:51,713 INFO L87 Difference]: Start difference. First operand 236140 states and 265602 transitions. Second operand 4 states. [2018-11-06 21:24:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:00,679 INFO L93 Difference]: Finished difference Result 488037 states and 548541 transitions. [2018-11-06 21:24:00,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:00,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 534 [2018-11-06 21:24:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:01,011 INFO L225 Difference]: With dead ends: 488037 [2018-11-06 21:24:01,012 INFO L226 Difference]: Without dead ends: 234512 [2018-11-06 21:24:01,162 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234512 states. [2018-11-06 21:24:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234512 to 216365. [2018-11-06 21:24:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216365 states. [2018-11-06 21:24:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216365 states to 216365 states and 239614 transitions. [2018-11-06 21:24:04,645 INFO L78 Accepts]: Start accepts. Automaton has 216365 states and 239614 transitions. Word has length 534 [2018-11-06 21:24:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:04,646 INFO L480 AbstractCegarLoop]: Abstraction has 216365 states and 239614 transitions. [2018-11-06 21:24:04,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 216365 states and 239614 transitions. [2018-11-06 21:24:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-11-06 21:24:04,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:04,677 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, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:04,677 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:04,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash 3769002, now seen corresponding path program 1 times [2018-11-06 21:24:04,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:04,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:04,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:04,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:04,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-06 21:24:05,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:05,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:24:05,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:24:05,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:24:05,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:05,157 INFO L87 Difference]: Start difference. First operand 216365 states and 239614 transitions. Second operand 5 states. [2018-11-06 21:24:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:22,998 INFO L93 Difference]: Finished difference Result 582773 states and 649613 transitions. [2018-11-06 21:24:22,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:24:22,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 560 [2018-11-06 21:24:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:23,464 INFO L225 Difference]: With dead ends: 582773 [2018-11-06 21:24:23,464 INFO L226 Difference]: Without dead ends: 365618 [2018-11-06 21:24:23,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365618 states. [2018-11-06 21:24:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365618 to 348056. [2018-11-06 21:24:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348056 states. [2018-11-06 21:24:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348056 states to 348056 states and 384575 transitions. [2018-11-06 21:24:33,841 INFO L78 Accepts]: Start accepts. Automaton has 348056 states and 384575 transitions. Word has length 560 [2018-11-06 21:24:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:33,841 INFO L480 AbstractCegarLoop]: Abstraction has 348056 states and 384575 transitions. [2018-11-06 21:24:33,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:24:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 348056 states and 384575 transitions. [2018-11-06 21:24:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-11-06 21:24:33,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:33,860 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, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:33,861 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:33,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:33,861 INFO L82 PathProgramCache]: Analyzing trace with hash 850010646, now seen corresponding path program 1 times [2018-11-06 21:24:33,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:33,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:33,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:33,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:33,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 471 proven. 8 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-06 21:24:34,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:24:34,498 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:24:34,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:34,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:24:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-06 21:24:35,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:24:35,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-11-06 21:24:35,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:24:35,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:24:35,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:35,622 INFO L87 Difference]: Start difference. First operand 348056 states and 384575 transitions. Second operand 5 states. [2018-11-06 21:24:50,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:50,116 INFO L93 Difference]: Finished difference Result 718950 states and 796149 transitions. [2018-11-06 21:24:50,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:24:50,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 595 [2018-11-06 21:24:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:50,609 INFO L225 Difference]: With dead ends: 718950 [2018-11-06 21:24:50,609 INFO L226 Difference]: Without dead ends: 366125 [2018-11-06 21:24:50,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366125 states. [2018-11-06 21:24:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366125 to 340100. [2018-11-06 21:24:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340100 states. [2018-11-06 21:24:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340100 states to 340100 states and 366112 transitions. [2018-11-06 21:24:55,766 INFO L78 Accepts]: Start accepts. Automaton has 340100 states and 366112 transitions. Word has length 595 [2018-11-06 21:24:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:55,767 INFO L480 AbstractCegarLoop]: Abstraction has 340100 states and 366112 transitions. [2018-11-06 21:24:55,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:24:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 340100 states and 366112 transitions. [2018-11-06 21:24:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-11-06 21:24:55,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:55,794 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:55,795 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:55,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:55,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1814761810, now seen corresponding path program 1 times [2018-11-06 21:24:55,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:55,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:55,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:55,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 913 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-06 21:24:57,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:57,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:24:57,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:24:57,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:24:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:57,411 INFO L87 Difference]: Start difference. First operand 340100 states and 366112 transitions. Second operand 4 states. [2018-11-06 21:25:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:07,245 INFO L93 Difference]: Finished difference Result 680221 states and 732253 transitions. [2018-11-06 21:25:07,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:25:07,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 758 [2018-11-06 21:25:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:07,654 INFO L225 Difference]: With dead ends: 680221 [2018-11-06 21:25:07,654 INFO L226 Difference]: Without dead ends: 336957 [2018-11-06 21:25:07,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:25:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336957 states. [2018-11-06 21:25:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336957 to 330626. [2018-11-06 21:25:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330626 states. [2018-11-06 21:25:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330626 states to 330626 states and 350460 transitions. [2018-11-06 21:25:20,222 INFO L78 Accepts]: Start accepts. Automaton has 330626 states and 350460 transitions. Word has length 758 [2018-11-06 21:25:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:20,222 INFO L480 AbstractCegarLoop]: Abstraction has 330626 states and 350460 transitions. [2018-11-06 21:25:20,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:25:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 330626 states and 350460 transitions. [2018-11-06 21:25:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-11-06 21:25:20,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:20,262 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:25:20,262 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:20,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1060361875, now seen corresponding path program 1 times [2018-11-06 21:25:20,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:20,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:20,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 760 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-06 21:25:21,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:25:21,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:25:21,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:25:21,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:25:21,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:25:21,160 INFO L87 Difference]: Start difference. First operand 330626 states and 350460 transitions. Second operand 4 states. Received shutdown request... [2018-11-06 21:25:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:25:25,402 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:25:25,407 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:25:25,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:25:25 BoogieIcfgContainer [2018-11-06 21:25:25,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:25:25,408 INFO L168 Benchmark]: Toolchain (without parser) took 213753.52 ms. Allocated memory was 1.5 GB in the beginning and 5.9 GB in the end (delta: 4.4 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-06 21:25:25,409 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:25:25,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2618.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:25:25,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 834.91 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 814.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:25:25,412 INFO L168 Benchmark]: Boogie Preprocessor took 612.31 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:25:25,412 INFO L168 Benchmark]: RCFGBuilder took 11761.88 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 241.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 581.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:25:25,416 INFO L168 Benchmark]: TraceAbstraction took 197919.30 ms. Allocated memory was 2.6 GB in the beginning and 5.9 GB in the end (delta: 3.3 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-06 21:25:25,421 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2618.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 834.91 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 814.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 612.31 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11761.88 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 241.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 581.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197919.30 ms. Allocated memory was 2.6 GB in the beginning and 5.9 GB in the end (delta: 3.3 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). 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: 186]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 186). Cancelled while BasicCegarLoop was constructing difference of abstraction (330626states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (57874 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 197.8s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 149.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8628 SDtfs, 32113 SDslu, 3958 SDs, 0 SdLazy, 67047 SolverSat, 15325 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 114.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 903 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348056occurred 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: 37.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 75431 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 5702 NumberOfCodeBlocks, 5702 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 5688 ConstructedInterpolants, 0 QuantifiedInterpolants, 7216762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1168 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 6614/6626 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown