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_label40_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:12:55,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:12:55,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:12:55,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:12:55,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:12:55,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:12:55,640 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:12:55,642 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:12:55,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:12:55,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:12:55,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:12:55,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:12:55,646 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:12:55,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:12:55,649 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:12:55,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:12:55,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:12:55,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:12:55,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:12:55,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:12:55,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:12:55,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:12:55,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:12:55,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:12:55,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:12:55,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:12:55,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:12:55,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:12:55,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:12:55,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:12:55,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:12:55,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:12:55,673 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:12:55,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:12:55,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:12:55,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:12:55,676 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 19:12:55,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:12:55,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:12:55,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:12:55,704 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:12:55,705 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:12:55,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:12:55,705 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:12:55,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:12:55,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:12:55,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:12:55,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:12:55,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:12:55,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:12:55,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:12:55,707 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:12:55,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:12:55,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:12:55,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:12:55,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:12:55,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:12:55,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:12:55,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:12:55,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:12:55,708 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:12:55,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:12:55,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:12:55,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:12:55,709 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:12:55,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:12:55,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:12:55,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:12:55,777 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:12:55,778 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:12:55,778 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label40_false-unreach-call.c [2018-11-06 19:12:55,841 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1c098d2/e6cfd8a336234007a4eae1898f26f315/FLAGbf48ae06b [2018-11-06 19:12:56,688 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:12:56,689 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label40_false-unreach-call.c [2018-11-06 19:12:56,728 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1c098d2/e6cfd8a336234007a4eae1898f26f315/FLAGbf48ae06b [2018-11-06 19:12:56,745 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1c098d2/e6cfd8a336234007a4eae1898f26f315 [2018-11-06 19:12:56,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:12:56,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:12:56,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:12:56,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:12:56,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:12:56,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:12:56" (1/1) ... [2018-11-06 19:12:56,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2d9c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:56, skipping insertion in model container [2018-11-06 19:12:56,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:12:56" (1/1) ... [2018-11-06 19:12:56,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:12:56,974 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:12:58,530 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:12:58,535 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:12:59,308 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:12:59,354 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:12:59,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59 WrapperNode [2018-11-06 19:12:59,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:12:59,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:12:59,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:12:59,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:12:59,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (1/1) ... [2018-11-06 19:12:59,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (1/1) ... [2018-11-06 19:13:00,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:13:00,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:13:00,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:13:00,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:13:00,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (1/1) ... [2018-11-06 19:13:00,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (1/1) ... [2018-11-06 19:13:00,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (1/1) ... [2018-11-06 19:13:00,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (1/1) ... [2018-11-06 19:13:00,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (1/1) ... [2018-11-06 19:13:00,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (1/1) ... [2018-11-06 19:13:00,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (1/1) ... [2018-11-06 19:13:00,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:13:00,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:13:00,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:13:00,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:13:00,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (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 19:13:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:13:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:13:00,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:13:11,812 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:13:11,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:13:11 BoogieIcfgContainer [2018-11-06 19:13:11,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:13:11,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:13:11,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:13:11,817 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:13:11,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:12:56" (1/3) ... [2018-11-06 19:13:11,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa55f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:13:11, skipping insertion in model container [2018-11-06 19:13:11,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:12:59" (2/3) ... [2018-11-06 19:13:11,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa55f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:13:11, skipping insertion in model container [2018-11-06 19:13:11,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:13:11" (3/3) ... [2018-11-06 19:13:11,822 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label40_false-unreach-call.c [2018-11-06 19:13:11,832 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:13:11,841 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:13:11,859 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:13:11,918 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:13:11,919 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:13:11,919 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:13:11,919 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:13:11,919 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:13:11,920 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:13:11,920 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:13:11,920 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:13:11,920 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:13:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 19:13:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-06 19:13:11,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:11,973 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] [2018-11-06 19:13:11,977 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:11,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:11,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1827210562, now seen corresponding path program 1 times [2018-11-06 19:13:11,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:11,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:12,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:12,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:12,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:12,406 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 19:13:12,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:12,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:13:12,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:12,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:12,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:12,432 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 19:13:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:26,034 INFO L93 Difference]: Finished difference Result 3973 states and 7416 transitions. [2018-11-06 19:13:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:26,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-06 19:13:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:26,082 INFO L225 Difference]: With dead ends: 3973 [2018-11-06 19:13:26,082 INFO L226 Difference]: Without dead ends: 2867 [2018-11-06 19:13:26,091 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 19:13:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2018-11-06 19:13:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1938. [2018-11-06 19:13:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2018-11-06 19:13:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3240 transitions. [2018-11-06 19:13:26,241 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3240 transitions. Word has length 29 [2018-11-06 19:13:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:26,242 INFO L480 AbstractCegarLoop]: Abstraction has 1938 states and 3240 transitions. [2018-11-06 19:13:26,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3240 transitions. [2018-11-06 19:13:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-06 19:13:26,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:26,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:26,248 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:26,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash -495686712, now seen corresponding path program 1 times [2018-11-06 19:13:26,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:26,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:26,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:13:26,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:26,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:13:26,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:26,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:26,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:26,535 INFO L87 Difference]: Start difference. First operand 1938 states and 3240 transitions. Second operand 4 states. [2018-11-06 19:13:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:39,867 INFO L93 Difference]: Finished difference Result 7101 states and 12101 transitions. [2018-11-06 19:13:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:39,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-06 19:13:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:39,897 INFO L225 Difference]: With dead ends: 7101 [2018-11-06 19:13:39,898 INFO L226 Difference]: Without dead ends: 5165 [2018-11-06 19:13:39,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2018-11-06 19:13:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 3540. [2018-11-06 19:13:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3540 states. [2018-11-06 19:13:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 5445 transitions. [2018-11-06 19:13:39,988 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 5445 transitions. Word has length 101 [2018-11-06 19:13:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:39,989 INFO L480 AbstractCegarLoop]: Abstraction has 3540 states and 5445 transitions. [2018-11-06 19:13:39,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 5445 transitions. [2018-11-06 19:13:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-06 19:13:39,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:39,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:39,992 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:39,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash -57072693, now seen corresponding path program 1 times [2018-11-06 19:13:39,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:39,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:39,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:39,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:39,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:13:40,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:40,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:13:40,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:40,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:40,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:40,263 INFO L87 Difference]: Start difference. First operand 3540 states and 5445 transitions. Second operand 4 states. [2018-11-06 19:13:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:52,278 INFO L93 Difference]: Finished difference Result 13555 states and 21081 transitions. [2018-11-06 19:13:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:52,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-11-06 19:13:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:52,334 INFO L225 Difference]: With dead ends: 13555 [2018-11-06 19:13:52,334 INFO L226 Difference]: Without dead ends: 10017 [2018-11-06 19:13:52,343 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 19:13:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10017 states. [2018-11-06 19:13:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10017 to 6718. [2018-11-06 19:13:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6718 states. [2018-11-06 19:13:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 9885 transitions. [2018-11-06 19:13:52,505 INFO L78 Accepts]: Start accepts. Automaton has 6718 states and 9885 transitions. Word has length 115 [2018-11-06 19:13:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:52,506 INFO L480 AbstractCegarLoop]: Abstraction has 6718 states and 9885 transitions. [2018-11-06 19:13:52,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6718 states and 9885 transitions. [2018-11-06 19:13:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-06 19:13:52,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:52,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:52,518 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:52,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash -429054184, now seen corresponding path program 1 times [2018-11-06 19:13:52,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:52,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:52,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:52,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:13:52,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:52,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:13:52,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:52,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:52,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:52,858 INFO L87 Difference]: Start difference. First operand 6718 states and 9885 transitions. Second operand 4 states. [2018-11-06 19:14:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:04,919 INFO L93 Difference]: Finished difference Result 23855 states and 35012 transitions. [2018-11-06 19:14:04,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:14:04,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-11-06 19:14:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:05,021 INFO L225 Difference]: With dead ends: 23855 [2018-11-06 19:14:05,021 INFO L226 Difference]: Without dead ends: 17139 [2018-11-06 19:14:05,036 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 19:14:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17139 states. [2018-11-06 19:14:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17139 to 13037. [2018-11-06 19:14:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13037 states. [2018-11-06 19:14:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13037 states to 13037 states and 18976 transitions. [2018-11-06 19:14:05,332 INFO L78 Accepts]: Start accepts. Automaton has 13037 states and 18976 transitions. Word has length 133 [2018-11-06 19:14:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:05,333 INFO L480 AbstractCegarLoop]: Abstraction has 13037 states and 18976 transitions. [2018-11-06 19:14:05,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:14:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 13037 states and 18976 transitions. [2018-11-06 19:14:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-06 19:14:05,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:05,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:05,337 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:05,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash -842540244, now seen corresponding path program 1 times [2018-11-06 19:14:05,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:05,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:05,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:05,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:05,959 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-06 19:14:06,318 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-06 19:14:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:14:06,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:06,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:14:06,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:14:06,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:14:06,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:14:06,472 INFO L87 Difference]: Start difference. First operand 13037 states and 18976 transitions. Second operand 6 states. [2018-11-06 19:14:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:22,429 INFO L93 Difference]: Finished difference Result 41152 states and 59128 transitions. [2018-11-06 19:14:22,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:14:22,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-11-06 19:14:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:22,495 INFO L225 Difference]: With dead ends: 41152 [2018-11-06 19:14:22,495 INFO L226 Difference]: Without dead ends: 28117 [2018-11-06 19:14:22,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:14:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28117 states. [2018-11-06 19:14:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28117 to 27247. [2018-11-06 19:14:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27247 states. [2018-11-06 19:14:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27247 states to 27247 states and 35783 transitions. [2018-11-06 19:14:23,134 INFO L78 Accepts]: Start accepts. Automaton has 27247 states and 35783 transitions. Word has length 141 [2018-11-06 19:14:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:23,134 INFO L480 AbstractCegarLoop]: Abstraction has 27247 states and 35783 transitions. [2018-11-06 19:14:23,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:14:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27247 states and 35783 transitions. [2018-11-06 19:14:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-06 19:14:23,137 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:23,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:23,137 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:23,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:23,138 INFO L82 PathProgramCache]: Analyzing trace with hash 517549558, now seen corresponding path program 1 times [2018-11-06 19:14:23,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:23,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:23,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:23,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:23,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:14:23,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:23,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:14:23,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:14:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:14:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:14:23,525 INFO L87 Difference]: Start difference. First operand 27247 states and 35783 transitions. Second operand 5 states. [2018-11-06 19:14:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:39,671 INFO L93 Difference]: Finished difference Result 68927 states and 90707 transitions. [2018-11-06 19:14:39,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:14:39,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-11-06 19:14:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:39,745 INFO L225 Difference]: With dead ends: 68927 [2018-11-06 19:14:39,746 INFO L226 Difference]: Without dead ends: 41681 [2018-11-06 19:14:39,774 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 19:14:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41681 states. [2018-11-06 19:14:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41681 to 39901. [2018-11-06 19:14:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39901 states. [2018-11-06 19:14:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39901 states to 39901 states and 51942 transitions. [2018-11-06 19:14:40,266 INFO L78 Accepts]: Start accepts. Automaton has 39901 states and 51942 transitions. Word has length 155 [2018-11-06 19:14:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:40,266 INFO L480 AbstractCegarLoop]: Abstraction has 39901 states and 51942 transitions. [2018-11-06 19:14:40,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:14:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 39901 states and 51942 transitions. [2018-11-06 19:14:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-06 19:14:40,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:40,271 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:14:40,271 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:40,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1153759498, now seen corresponding path program 1 times [2018-11-06 19:14:40,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:40,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:40,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:40,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:40,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:14:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:40,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:14:40,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:14:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:14:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:14:40,722 INFO L87 Difference]: Start difference. First operand 39901 states and 51942 transitions. Second operand 5 states. [2018-11-06 19:14:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:58,055 INFO L93 Difference]: Finished difference Result 102967 states and 135205 transitions. [2018-11-06 19:14:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:14:58,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2018-11-06 19:14:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:58,131 INFO L225 Difference]: With dead ends: 102967 [2018-11-06 19:14:58,131 INFO L226 Difference]: Without dead ends: 63068 [2018-11-06 19:14:58,164 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 19:14:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63068 states. [2018-11-06 19:14:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63068 to 62871. [2018-11-06 19:14:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62871 states. [2018-11-06 19:14:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62871 states to 62871 states and 81367 transitions. [2018-11-06 19:14:58,868 INFO L78 Accepts]: Start accepts. Automaton has 62871 states and 81367 transitions. Word has length 212 [2018-11-06 19:14:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:58,869 INFO L480 AbstractCegarLoop]: Abstraction has 62871 states and 81367 transitions. [2018-11-06 19:14:58,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:14:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 62871 states and 81367 transitions. [2018-11-06 19:14:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-06 19:14:58,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:58,873 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:14:58,873 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:58,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:58,874 INFO L82 PathProgramCache]: Analyzing trace with hash -227015565, now seen corresponding path program 1 times [2018-11-06 19:14:58,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:58,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:58,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:59,214 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 19:14:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-06 19:14:59,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:14:59,278 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 19:14:59,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:59,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:14:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:14:59,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:14:59,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 19:14:59,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:14:59,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:14:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:59,550 INFO L87 Difference]: Start difference. First operand 62871 states and 81367 transitions. Second operand 4 states. [2018-11-06 19:15:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:10,694 INFO L93 Difference]: Finished difference Result 199085 states and 259089 transitions. [2018-11-06 19:15:10,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:10,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2018-11-06 19:15:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:10,967 INFO L225 Difference]: With dead ends: 199085 [2018-11-06 19:15:10,967 INFO L226 Difference]: Without dead ends: 136216 [2018-11-06 19:15:11,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136216 states. [2018-11-06 19:15:12,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136216 to 109360. [2018-11-06 19:15:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109360 states. [2018-11-06 19:15:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109360 states to 109360 states and 137444 transitions. [2018-11-06 19:15:12,996 INFO L78 Accepts]: Start accepts. Automaton has 109360 states and 137444 transitions. Word has length 241 [2018-11-06 19:15:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:12,997 INFO L480 AbstractCegarLoop]: Abstraction has 109360 states and 137444 transitions. [2018-11-06 19:15:12,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 109360 states and 137444 transitions. [2018-11-06 19:15:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-06 19:15:13,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:13,004 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:15:13,005 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:13,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:13,005 INFO L82 PathProgramCache]: Analyzing trace with hash 355724236, now seen corresponding path program 1 times [2018-11-06 19:15:13,005 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:13,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:13,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:13,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:13,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:15:13,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:15:13,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:15:13,267 INFO L87 Difference]: Start difference. First operand 109360 states and 137444 transitions. Second operand 3 states. [2018-11-06 19:15:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:21,511 INFO L93 Difference]: Finished difference Result 217115 states and 273078 transitions. [2018-11-06 19:15:21,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:15:21,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-11-06 19:15:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:21,679 INFO L225 Difference]: With dead ends: 217115 [2018-11-06 19:15:21,679 INFO L226 Difference]: Without dead ends: 108545 [2018-11-06 19:15:21,745 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 19:15:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108545 states. [2018-11-06 19:15:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108545 to 107748. [2018-11-06 19:15:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107748 states. [2018-11-06 19:15:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107748 states to 107748 states and 126558 transitions. [2018-11-06 19:15:22,983 INFO L78 Accepts]: Start accepts. Automaton has 107748 states and 126558 transitions. Word has length 259 [2018-11-06 19:15:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:22,984 INFO L480 AbstractCegarLoop]: Abstraction has 107748 states and 126558 transitions. [2018-11-06 19:15:22,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:15:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 107748 states and 126558 transitions. [2018-11-06 19:15:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-06 19:15:22,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:22,991 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:15:22,991 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:22,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1643534312, now seen corresponding path program 1 times [2018-11-06 19:15:22,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:22,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:22,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:22,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:22,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:23,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:23,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:15:23,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:23,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:23,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:23,283 INFO L87 Difference]: Start difference. First operand 107748 states and 126558 transitions. Second operand 4 states. [2018-11-06 19:15:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:35,761 INFO L93 Difference]: Finished difference Result 303797 states and 356119 transitions. [2018-11-06 19:15:35,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:35,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2018-11-06 19:15:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:36,042 INFO L225 Difference]: With dead ends: 303797 [2018-11-06 19:15:36,043 INFO L226 Difference]: Without dead ends: 196837 [2018-11-06 19:15:36,121 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196837 states. [2018-11-06 19:15:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196837 to 193625. [2018-11-06 19:15:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193625 states. [2018-11-06 19:15:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193625 states to 193625 states and 218375 transitions. [2018-11-06 19:15:37,839 INFO L78 Accepts]: Start accepts. Automaton has 193625 states and 218375 transitions. Word has length 269 [2018-11-06 19:15:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:37,840 INFO L480 AbstractCegarLoop]: Abstraction has 193625 states and 218375 transitions. [2018-11-06 19:15:37,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 193625 states and 218375 transitions. [2018-11-06 19:15:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-06 19:15:37,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:37,849 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:15:37,849 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:37,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:37,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1285746636, now seen corresponding path program 1 times [2018-11-06 19:15:37,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:37,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:37,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:37,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-06 19:15:39,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:39,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:39,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:39,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:39,348 INFO L87 Difference]: Start difference. First operand 193625 states and 218375 transitions. Second operand 4 states. [2018-11-06 19:15:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:52,091 INFO L93 Difference]: Finished difference Result 481782 states and 543891 transitions. [2018-11-06 19:15:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:52,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-11-06 19:15:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:52,370 INFO L225 Difference]: With dead ends: 481782 [2018-11-06 19:15:52,370 INFO L226 Difference]: Without dead ends: 276318 [2018-11-06 19:15:52,441 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 19:15:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276318 states. [2018-11-06 19:15:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276318 to 255017. [2018-11-06 19:15:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255017 states. [2018-11-06 19:15:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255017 states to 255017 states and 278274 transitions. [2018-11-06 19:15:55,832 INFO L78 Accepts]: Start accepts. Automaton has 255017 states and 278274 transitions. Word has length 309 [2018-11-06 19:15:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:55,833 INFO L480 AbstractCegarLoop]: Abstraction has 255017 states and 278274 transitions. [2018-11-06 19:15:55,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 255017 states and 278274 transitions. [2018-11-06 19:15:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-11-06 19:15:55,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:55,840 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 19:15:55,841 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:55,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1207637578, now seen corresponding path program 1 times [2018-11-06 19:15:55,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:55,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-06 19:15:56,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:56,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:56,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:56,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:56,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:56,202 INFO L87 Difference]: Start difference. First operand 255017 states and 278274 transitions. Second operand 4 states. [2018-11-06 19:16:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:10,610 INFO L93 Difference]: Finished difference Result 521854 states and 568785 transitions. [2018-11-06 19:16:10,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:16:10,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2018-11-06 19:16:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:10,918 INFO L225 Difference]: With dead ends: 521854 [2018-11-06 19:16:10,918 INFO L226 Difference]: Without dead ends: 260509 [2018-11-06 19:16:11,008 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 19:16:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260509 states. [2018-11-06 19:16:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260509 to 247109. [2018-11-06 19:16:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247109 states. [2018-11-06 19:16:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247109 states to 247109 states and 267796 transitions. [2018-11-06 19:16:14,300 INFO L78 Accepts]: Start accepts. Automaton has 247109 states and 267796 transitions. Word has length 387 [2018-11-06 19:16:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:14,301 INFO L480 AbstractCegarLoop]: Abstraction has 247109 states and 267796 transitions. [2018-11-06 19:16:14,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:16:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 247109 states and 267796 transitions. [2018-11-06 19:16:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-11-06 19:16:14,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:14,307 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 19:16:14,307 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:14,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash -727014950, now seen corresponding path program 1 times [2018-11-06 19:16:14,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-06 19:16:14,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:14,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:16:14,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:16:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:16:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:14,778 INFO L87 Difference]: Start difference. First operand 247109 states and 267796 transitions. Second operand 4 states. [2018-11-06 19:16:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:27,156 INFO L93 Difference]: Finished difference Result 524995 states and 569099 transitions. [2018-11-06 19:16:27,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:16:27,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2018-11-06 19:16:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:27,486 INFO L225 Difference]: With dead ends: 524995 [2018-11-06 19:16:27,487 INFO L226 Difference]: Without dead ends: 277888 [2018-11-06 19:16:27,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277888 states. [2018-11-06 19:16:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277888 to 272337. [2018-11-06 19:16:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272337 states. [2018-11-06 19:16:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272337 states to 272337 states and 292793 transitions. [2018-11-06 19:16:30,678 INFO L78 Accepts]: Start accepts. Automaton has 272337 states and 292793 transitions. Word has length 433 [2018-11-06 19:16:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:30,679 INFO L480 AbstractCegarLoop]: Abstraction has 272337 states and 292793 transitions. [2018-11-06 19:16:30,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:16:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 272337 states and 292793 transitions. [2018-11-06 19:16:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-11-06 19:16:30,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:30,685 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:16:30,685 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:30,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2077440557, now seen corresponding path program 1 times [2018-11-06 19:16:30,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:30,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:30,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2018-11-06 19:16:31,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:31,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:16:31,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:16:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:16:31,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:31,052 INFO L87 Difference]: Start difference. First operand 272337 states and 292793 transitions. Second operand 4 states. Received shutdown request... [2018-11-06 19:16:43,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:16:43,435 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:16:43,441 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:16:43,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:16:43 BoogieIcfgContainer [2018-11-06 19:16:43,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:16:43,443 INFO L168 Benchmark]: Toolchain (without parser) took 226685.06 ms. Allocated memory was 1.5 GB in the beginning and 4.4 GB in the end (delta: 2.9 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -929.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-06 19:16:43,444 INFO L168 Benchmark]: CDTParser took 0.24 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 19:16:43,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2594.69 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 19:16:43,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 780.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 801.1 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -989.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:16:43,446 INFO L168 Benchmark]: Boogie Preprocessor took 396.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:16:43,447 INFO L168 Benchmark]: RCFGBuilder took 11279.58 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 269.0 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -10.8 MB). Peak memory consumption was 595.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:16:43,448 INFO L168 Benchmark]: TraceAbstraction took 211627.98 ms. Allocated memory was 2.6 GB in the beginning and 4.4 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -246.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-06 19:16:43,453 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.24 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 2594.69 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 780.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 801.1 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -989.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 396.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11279.58 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 269.0 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -10.8 MB). Peak memory consumption was 595.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211627.98 ms. Allocated memory was 2.6 GB in the beginning and 4.4 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -246.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 96). Cancelled while BasicCegarLoop was constructing difference of abstraction (272337states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (393519 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 211.5s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 186.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12888 SDtfs, 31575 SDslu, 4111 SDs, 0 SdLazy, 75308 SolverSat, 17027 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 144.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 258 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272337occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 17.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 83919 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 3492 NumberOfCodeBlocks, 3492 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3477 ConstructedInterpolants, 0 QuantifiedInterpolants, 2274289 SizeOfPredicates, 1 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 2968/2972 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown