java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label31_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:27:39,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:27:39,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:27:39,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:27:39,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:27:39,987 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:27:39,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:27:39,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:27:39,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:27:39,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:27:39,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:27:39,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:27:39,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:27:39,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:27:39,998 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:27:39,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:27:40,000 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:27:40,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:27:40,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:27:40,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:27:40,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:27:40,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:27:40,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:27:40,011 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:27:40,011 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:27:40,012 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:27:40,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:27:40,013 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:27:40,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:27:40,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:27:40,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:27:40,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:27:40,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:27:40,017 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:27:40,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:27:40,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:27:40,019 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 21:27:40,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:27:40,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:27:40,046 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:27:40,046 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:27:40,047 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:27:40,047 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:27:40,047 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:27:40,047 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:27:40,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:27:40,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:27:40,050 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:27:40,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:27:40,051 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:27:40,051 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:27:40,051 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:27:40,051 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:27:40,052 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:27:40,052 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:27:40,052 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:27:40,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:27:40,052 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:27:40,053 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:27:40,053 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:27:40,053 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:27:40,053 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:27:40,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:27:40,054 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:27:40,055 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:27:40,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:27:40,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:27:40,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:27:40,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:27:40,137 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:27:40,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label31_true-unreach-call.c [2018-10-26 21:27:40,194 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/04d725b70/2dd049c43c4f4a4d9ed162d6a2194829/FLAGc8e58bde3 [2018-10-26 21:27:41,015 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:27:41,016 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label31_true-unreach-call.c [2018-10-26 21:27:41,070 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/04d725b70/2dd049c43c4f4a4d9ed162d6a2194829/FLAGc8e58bde3 [2018-10-26 21:27:41,093 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/04d725b70/2dd049c43c4f4a4d9ed162d6a2194829 [2018-10-26 21:27:41,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:27:41,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:27:41,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:27:41,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:27:41,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:27:41,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:27:41" (1/1) ... [2018-10-26 21:27:41,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:41, skipping insertion in model container [2018-10-26 21:27:41,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:27:41" (1/1) ... [2018-10-26 21:27:41,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:27:41,320 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:27:42,828 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:27:42,833 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:27:43,614 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:27:43,658 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:27:43,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43 WrapperNode [2018-10-26 21:27:43,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:27:43,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:27:43,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:27:43,661 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:27:43,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:43,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:27:44,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:27:44,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:27:44,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:27:44,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:45,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:27:45,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:27:45,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:27:45,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:27:45,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:27:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:27:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:27:45,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:27:56,676 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:27:56,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:27:56 BoogieIcfgContainer [2018-10-26 21:27:56,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:27:56,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:27:56,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:27:56,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:27:56,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:27:41" (1/3) ... [2018-10-26 21:27:56,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296e392f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:27:56, skipping insertion in model container [2018-10-26 21:27:56,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (2/3) ... [2018-10-26 21:27:56,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296e392f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:27:56, skipping insertion in model container [2018-10-26 21:27:56,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:27:56" (3/3) ... [2018-10-26 21:27:56,686 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label31_true-unreach-call.c [2018-10-26 21:27:56,696 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:27:56,705 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:27:56,723 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:27:56,769 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:27:56,770 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:27:56,770 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:27:56,770 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:27:56,771 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:27:56,771 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:27:56,771 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:27:56,771 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:27:56,771 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:27:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-26 21:27:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 21:27:56,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:27:56,830 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] [2018-10-26 21:27:56,832 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:27:56,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:27:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1074275470, now seen corresponding path program 1 times [2018-10-26 21:27:56,839 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:27:56,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:27:56,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:27:56,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:27:56,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:27:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:27:57,311 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-26 21:27:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:27:57,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:27:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:27:57,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:27:57,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:27:57,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:27:57,357 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-26 21:28:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:12,849 INFO L93 Difference]: Finished difference Result 3993 states and 7498 transitions. [2018-10-26 21:28:12,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:28:12,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-10-26 21:28:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:12,900 INFO L225 Difference]: With dead ends: 3993 [2018-10-26 21:28:12,900 INFO L226 Difference]: Without dead ends: 2887 [2018-10-26 21:28:12,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-26 21:28:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1936. [2018-10-26 21:28:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-10-26 21:28:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 3550 transitions. [2018-10-26 21:28:13,062 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 3550 transitions. Word has length 41 [2018-10-26 21:28:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:13,063 INFO L481 AbstractCegarLoop]: Abstraction has 1936 states and 3550 transitions. [2018-10-26 21:28:13,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:28:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 3550 transitions. [2018-10-26 21:28:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 21:28:13,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:13,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:13,073 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:13,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1737438858, now seen corresponding path program 1 times [2018-10-26 21:28:13,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:28:13,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:28:13,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:13,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:13,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:13,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:13,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:28:13,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:28:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:28:13,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:13,444 INFO L87 Difference]: Start difference. First operand 1936 states and 3550 transitions. Second operand 4 states. [2018-10-26 21:28:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:29,099 INFO L93 Difference]: Finished difference Result 7120 states and 13344 transitions. [2018-10-26 21:28:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:28:29,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-26 21:28:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:29,129 INFO L225 Difference]: With dead ends: 7120 [2018-10-26 21:28:29,129 INFO L226 Difference]: Without dead ends: 5186 [2018-10-26 21:28:29,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2018-10-26 21:28:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 3554. [2018-10-26 21:28:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3554 states. [2018-10-26 21:28:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 6248 transitions. [2018-10-26 21:28:29,228 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 6248 transitions. Word has length 110 [2018-10-26 21:28:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:29,228 INFO L481 AbstractCegarLoop]: Abstraction has 3554 states and 6248 transitions. [2018-10-26 21:28:29,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:28:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 6248 transitions. [2018-10-26 21:28:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 21:28:29,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:29,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:29,238 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:29,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2072624303, now seen corresponding path program 1 times [2018-10-26 21:28:29,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:28:29,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:28:29,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:29,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:29,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:29,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:29,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:28:29,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:28:29,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:28:29,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:29,496 INFO L87 Difference]: Start difference. First operand 3554 states and 6248 transitions. Second operand 4 states. [2018-10-26 21:28:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:39,518 INFO L93 Difference]: Finished difference Result 12674 states and 22438 transitions. [2018-10-26 21:28:39,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:28:39,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-10-26 21:28:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:39,560 INFO L225 Difference]: With dead ends: 12674 [2018-10-26 21:28:39,560 INFO L226 Difference]: Without dead ends: 9122 [2018-10-26 21:28:39,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9122 states. [2018-10-26 21:28:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9122 to 9115. [2018-10-26 21:28:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2018-10-26 21:28:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 14199 transitions. [2018-10-26 21:28:39,736 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 14199 transitions. Word has length 123 [2018-10-26 21:28:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:39,737 INFO L481 AbstractCegarLoop]: Abstraction has 9115 states and 14199 transitions. [2018-10-26 21:28:39,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:28:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 14199 transitions. [2018-10-26 21:28:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 21:28:39,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:39,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:39,743 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:39,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:39,743 INFO L82 PathProgramCache]: Analyzing trace with hash 301261888, now seen corresponding path program 1 times [2018-10-26 21:28:39,743 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:28:39,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:28:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:39,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:39,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:40,164 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 21:28:40,421 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-26 21:28:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:40,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:40,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:28:40,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:28:40,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:28:40,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:28:40,609 INFO L87 Difference]: Start difference. First operand 9115 states and 14199 transitions. Second operand 5 states. [2018-10-26 21:28:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:53,313 INFO L93 Difference]: Finished difference Result 29264 states and 45079 transitions. [2018-10-26 21:28:53,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:28:53,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-10-26 21:28:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:53,386 INFO L225 Difference]: With dead ends: 29264 [2018-10-26 21:28:53,386 INFO L226 Difference]: Without dead ends: 20151 [2018-10-26 21:28:53,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:28:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2018-10-26 21:28:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 20149. [2018-10-26 21:28:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20149 states. [2018-10-26 21:28:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20149 states to 20149 states and 28284 transitions. [2018-10-26 21:28:53,820 INFO L78 Accepts]: Start accepts. Automaton has 20149 states and 28284 transitions. Word has length 144 [2018-10-26 21:28:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:53,820 INFO L481 AbstractCegarLoop]: Abstraction has 20149 states and 28284 transitions. [2018-10-26 21:28:53,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:28:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 20149 states and 28284 transitions. [2018-10-26 21:28:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-26 21:28:53,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:53,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:53,826 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:53,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1666609818, now seen corresponding path program 1 times [2018-10-26 21:28:53,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:28:53,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:28:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 21:28:54,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:28:54,499 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:28:54,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:54,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:28:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:54,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:28:54,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-26 21:28:54,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:28:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:28:54,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:28:54,766 INFO L87 Difference]: Start difference. First operand 20149 states and 28284 transitions. Second operand 5 states. [2018-10-26 21:29:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:29:15,412 INFO L93 Difference]: Finished difference Result 71841 states and 101590 transitions. [2018-10-26 21:29:15,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:29:15,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2018-10-26 21:29:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:29:15,527 INFO L225 Difference]: With dead ends: 71841 [2018-10-26 21:29:15,527 INFO L226 Difference]: Without dead ends: 52482 [2018-10-26 21:29:15,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:29:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52482 states. [2018-10-26 21:29:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52482 to 52448. [2018-10-26 21:29:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52448 states. [2018-10-26 21:29:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52448 states to 52448 states and 62491 transitions. [2018-10-26 21:29:16,283 INFO L78 Accepts]: Start accepts. Automaton has 52448 states and 62491 transitions. Word has length 167 [2018-10-26 21:29:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:29:16,284 INFO L481 AbstractCegarLoop]: Abstraction has 52448 states and 62491 transitions. [2018-10-26 21:29:16,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:29:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 52448 states and 62491 transitions. [2018-10-26 21:29:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-26 21:29:16,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:29:16,295 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:29:16,296 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:29:16,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash -802390206, now seen corresponding path program 1 times [2018-10-26 21:29:16,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:29:16,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:29:16,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:16,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:16,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 21:29:16,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:29:16,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:29:16,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:29:16,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:29:16,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:29:16,832 INFO L87 Difference]: Start difference. First operand 52448 states and 62491 transitions. Second operand 5 states. [2018-10-26 21:29:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:29:36,338 INFO L93 Difference]: Finished difference Result 165087 states and 196876 transitions. [2018-10-26 21:29:36,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:29:36,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 307 [2018-10-26 21:29:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:29:36,609 INFO L225 Difference]: With dead ends: 165087 [2018-10-26 21:29:36,609 INFO L226 Difference]: Without dead ends: 113429 [2018-10-26 21:29:36,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:29:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113429 states. [2018-10-26 21:29:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113429 to 113259. [2018-10-26 21:29:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113259 states. [2018-10-26 21:29:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113259 states to 113259 states and 132702 transitions. [2018-10-26 21:29:38,628 INFO L78 Accepts]: Start accepts. Automaton has 113259 states and 132702 transitions. Word has length 307 [2018-10-26 21:29:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:29:38,629 INFO L481 AbstractCegarLoop]: Abstraction has 113259 states and 132702 transitions. [2018-10-26 21:29:38,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:29:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 113259 states and 132702 transitions. [2018-10-26 21:29:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-26 21:29:38,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:29:38,652 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:29:38,652 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:29:38,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1669246596, now seen corresponding path program 1 times [2018-10-26 21:29:38,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:29:38,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:29:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-26 21:29:39,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:29:39,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:29:39,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:29:39,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:29:39,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:29:39,218 INFO L87 Difference]: Start difference. First operand 113259 states and 132702 transitions. Second operand 4 states. [2018-10-26 21:29:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:29:52,906 INFO L93 Difference]: Finished difference Result 289604 states and 341524 transitions. [2018-10-26 21:29:52,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:29:52,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-10-26 21:29:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:29:53,161 INFO L225 Difference]: With dead ends: 289604 [2018-10-26 21:29:53,162 INFO L226 Difference]: Without dead ends: 177135 [2018-10-26 21:29:53,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-26 21:29:53,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177135 states. [2018-10-26 21:29:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177135 to 175509. [2018-10-26 21:29:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175509 states. [2018-10-26 21:29:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175509 states to 175509 states and 200034 transitions. [2018-10-26 21:29:55,082 INFO L78 Accepts]: Start accepts. Automaton has 175509 states and 200034 transitions. Word has length 365 [2018-10-26 21:29:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:29:55,082 INFO L481 AbstractCegarLoop]: Abstraction has 175509 states and 200034 transitions. [2018-10-26 21:29:55,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:29:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 175509 states and 200034 transitions. [2018-10-26 21:29:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-26 21:29:55,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:29:55,109 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:29:55,110 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:29:55,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash 158609359, now seen corresponding path program 1 times [2018-10-26 21:29:55,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:29:55,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:29:55,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:55,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:55,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-10-26 21:29:55,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:29:55,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:29:55,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:29:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:29:55,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:29:55,581 INFO L87 Difference]: Start difference. First operand 175509 states and 200034 transitions. Second operand 3 states. [2018-10-26 21:30:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:04,876 INFO L93 Difference]: Finished difference Result 444781 states and 506737 transitions. [2018-10-26 21:30:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:30:04,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 397 [2018-10-26 21:30:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:05,292 INFO L225 Difference]: With dead ends: 444781 [2018-10-26 21:30:05,293 INFO L226 Difference]: Without dead ends: 270062 [2018-10-26 21:30:05,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:30:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270062 states. [2018-10-26 21:30:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270062 to 269272. [2018-10-26 21:30:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269272 states. [2018-10-26 21:30:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269272 states to 269272 states and 300224 transitions. [2018-10-26 21:30:09,394 INFO L78 Accepts]: Start accepts. Automaton has 269272 states and 300224 transitions. Word has length 397 [2018-10-26 21:30:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:09,395 INFO L481 AbstractCegarLoop]: Abstraction has 269272 states and 300224 transitions. [2018-10-26 21:30:09,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:30:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 269272 states and 300224 transitions. [2018-10-26 21:30:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1271 [2018-10-26 21:30:09,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:09,661 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:30:09,661 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:09,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:09,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1788133953, now seen corresponding path program 1 times [2018-10-26 21:30:09,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:30:09,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:30:09,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:09,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:10,410 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 21:30:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 929 proven. 0 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2018-10-26 21:30:12,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:30:12,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:30:12,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:30:12,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:30:12,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:12,599 INFO L87 Difference]: Start difference. First operand 269272 states and 300224 transitions. Second operand 4 states. [2018-10-26 21:30:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:24,623 INFO L93 Difference]: Finished difference Result 540885 states and 603248 transitions. [2018-10-26 21:30:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:30:24,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1270 [2018-10-26 21:30:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:24,942 INFO L225 Difference]: With dead ends: 540885 [2018-10-26 21:30:24,943 INFO L226 Difference]: Without dead ends: 264505 [2018-10-26 21:30:25,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264505 states. [2018-10-26 21:30:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264505 to 257405. [2018-10-26 21:30:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257405 states. [2018-10-26 21:30:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257405 states to 257405 states and 275736 transitions. [2018-10-26 21:30:35,063 INFO L78 Accepts]: Start accepts. Automaton has 257405 states and 275736 transitions. Word has length 1270 [2018-10-26 21:30:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:35,064 INFO L481 AbstractCegarLoop]: Abstraction has 257405 states and 275736 transitions. [2018-10-26 21:30:35,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:30:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 257405 states and 275736 transitions. [2018-10-26 21:30:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1324 [2018-10-26 21:30:35,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:35,250 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:30:35,250 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:35,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash 912402643, now seen corresponding path program 1 times [2018-10-26 21:30:35,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:30:35,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:30:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:35,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 1028 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-10-26 21:30:37,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:30:37,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:30:37,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:30:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:30:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:37,394 INFO L87 Difference]: Start difference. First operand 257405 states and 275736 transitions. Second operand 4 states. [2018-10-26 21:30:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:48,310 INFO L93 Difference]: Finished difference Result 505363 states and 541424 transitions. [2018-10-26 21:30:48,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:30:48,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1323 [2018-10-26 21:30:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:48,607 INFO L225 Difference]: With dead ends: 505363 [2018-10-26 21:30:48,607 INFO L226 Difference]: Without dead ends: 244007 [2018-10-26 21:30:48,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-26 21:30:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244007 states. [2018-10-26 21:30:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244007 to 240035. [2018-10-26 21:30:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240035 states. [2018-10-26 21:30:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240035 states to 240035 states and 253148 transitions. [2018-10-26 21:30:51,326 INFO L78 Accepts]: Start accepts. Automaton has 240035 states and 253148 transitions. Word has length 1323 [2018-10-26 21:30:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:51,327 INFO L481 AbstractCegarLoop]: Abstraction has 240035 states and 253148 transitions. [2018-10-26 21:30:51,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:30:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 240035 states and 253148 transitions. [2018-10-26 21:30:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1430 [2018-10-26 21:30:51,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:51,488 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:30:51,488 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:51,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash 438575802, now seen corresponding path program 1 times [2018-10-26 21:30:51,489 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:30:51,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:30:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:51,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:51,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:52,910 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 21:30:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1078 proven. 0 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-10-26 21:30:54,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:30:54,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:30:54,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:30:54,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:30:54,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:54,420 INFO L87 Difference]: Start difference. First operand 240035 states and 253148 transitions. Second operand 4 states. [2018-10-26 21:31:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:31:04,170 INFO L93 Difference]: Finished difference Result 490314 states and 516901 transitions. [2018-10-26 21:31:04,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:31:04,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1429 [2018-10-26 21:31:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:31:04,417 INFO L225 Difference]: With dead ends: 490314 [2018-10-26 21:31:04,417 INFO L226 Difference]: Without dead ends: 226604 [2018-10-26 21:31:04,536 INFO L605 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-10-26 21:31:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226604 states. [2018-10-26 21:31:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226604 to 216357. [2018-10-26 21:31:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216357 states. [2018-10-26 21:31:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216357 states to 216357 states and 227562 transitions. [2018-10-26 21:31:07,009 INFO L78 Accepts]: Start accepts. Automaton has 216357 states and 227562 transitions. Word has length 1429 [2018-10-26 21:31:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:31:07,010 INFO L481 AbstractCegarLoop]: Abstraction has 216357 states and 227562 transitions. [2018-10-26 21:31:07,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:31:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 216357 states and 227562 transitions. [2018-10-26 21:31:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1609 [2018-10-26 21:31:07,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:31:07,148 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:31:07,149 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:31:07,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:31:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2113052933, now seen corresponding path program 1 times [2018-10-26 21:31:07,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:31:07,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:31:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:31:07,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:31:07,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:31:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:08,845 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 21:31:09,355 WARN L179 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-26 21:31:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2733 backedges. 1664 proven. 12 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2018-10-26 21:31:14,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:31:14,639 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:31:14,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:31:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:15,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:31:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2733 backedges. 2055 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2018-10-26 21:31:16,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:31:16,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-26 21:31:16,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:31:16,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:31:16,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:31:16,322 INFO L87 Difference]: Start difference. First operand 216357 states and 227562 transitions. Second operand 8 states. Received shutdown request... [2018-10-26 21:31:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:31:20,367 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 21:31:20,375 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 21:31:20,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:31:20 BoogieIcfgContainer [2018-10-26 21:31:20,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:31:20,376 INFO L168 Benchmark]: Toolchain (without parser) took 219270.52 ms. Allocated memory was 1.5 GB in the beginning and 5.0 GB in the end (delta: 3.5 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-26 21:31:20,377 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-10-26 21:31:20,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2551.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:31:20,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 844.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.4 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.0 MB. Max. memory is 7.1 GB. [2018-10-26 21:31:20,382 INFO L168 Benchmark]: Boogie Preprocessor took 525.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:31:20,385 INFO L168 Benchmark]: RCFGBuilder took 11646.43 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 263.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -2.5 MB). Peak memory consumption was 622.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:31:20,392 INFO L168 Benchmark]: TraceAbstraction took 203697.31 ms. Allocated memory was 2.6 GB in the beginning and 5.0 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-26 21:31:20,405 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 2551.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 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 844.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.4 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 525.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11646.43 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 263.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -2.5 MB). Peak memory consumption was 622.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203697.31 ms. Allocated memory was 2.6 GB in the beginning and 5.0 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 132). Cancelled while BasicCegarLoop was constructing difference of abstraction (216357states) and FLOYD_HOARE automaton (currently 6 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1266 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 203.6s OverallTime, 12 OverallIterations, 8 TraceHistogramMax, 156.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8511 SDtfs, 31001 SDslu, 2709 SDs, 0 SdLazy, 53983 SolverSat, 17585 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 127.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1840 GetRequests, 1793 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269272occurred in iteration=8, 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: 24.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 26531 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 9059 NumberOfCodeBlocks, 9059 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 9045 ConstructedInterpolants, 0 QuantifiedInterpolants, 19720740 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2098 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 11927/11945 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown