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/Problem12_label01_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:13:58,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:13:58,012 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:13:58,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:13:58,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:13:58,029 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:13:58,030 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:13:58,032 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:13:58,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:13:58,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:13:58,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:13:58,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:13:58,037 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:13:58,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:13:58,039 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:13:58,040 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:13:58,041 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:13:58,043 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:13:58,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:13:58,046 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:13:58,047 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:13:58,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:13:58,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:13:58,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:13:58,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:13:58,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:13:58,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:13:58,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:13:58,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:13:58,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:13:58,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:13:58,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:13:58,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:13:58,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:13:58,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:13:58,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:13:58,060 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:13:58,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:13:58,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:13:58,077 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:13:58,077 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:13:58,078 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:13:58,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:13:58,080 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:13:58,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:13:58,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:13:58,081 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:13:58,081 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:13:58,081 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:13:58,081 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:13:58,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:13:58,082 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:13:58,082 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:13:58,082 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:13:58,082 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:13:58,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:13:58,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:13:58,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:13:58,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:13:58,083 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:13:58,084 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:13:58,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:13:58,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:13:58,084 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:13:58,084 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:13:58,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:13:58,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:13:58,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:13:58,154 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:13:58,154 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:13:58,155 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label01_true-unreach-call.c [2018-10-26 21:13:58,222 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f7392d774/6798adaeea9d4282b7031181d57294b7/FLAGdf499d300 [2018-10-26 21:13:59,032 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:13:59,033 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label01_true-unreach-call.c [2018-10-26 21:13:59,060 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f7392d774/6798adaeea9d4282b7031181d57294b7/FLAGdf499d300 [2018-10-26 21:13:59,075 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f7392d774/6798adaeea9d4282b7031181d57294b7 [2018-10-26 21:13:59,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:13:59,088 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:13:59,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:13:59,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:13:59,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:13:59,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:13:59" (1/1) ... [2018-10-26 21:13:59,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209d0f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:13:59, skipping insertion in model container [2018-10-26 21:13:59,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:13:59" (1/1) ... [2018-10-26 21:13:59,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:13:59,261 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:14:00,480 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:14:00,485 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:14:01,085 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:14:01,123 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:14:01,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01 WrapperNode [2018-10-26 21:14:01,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:14:01,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:14:01,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:14:01,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:14:01,140 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:14:01" (1/1) ... [2018-10-26 21:14:01,220 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:14:01" (1/1) ... [2018-10-26 21:14:01,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:14:01,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:14:01,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:14:01,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:14:01,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01" (1/1) ... [2018-10-26 21:14:01,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01" (1/1) ... [2018-10-26 21:14:01,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01" (1/1) ... [2018-10-26 21:14:01,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01" (1/1) ... [2018-10-26 21:14:02,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01" (1/1) ... [2018-10-26 21:14:02,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01" (1/1) ... [2018-10-26 21:14:02,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01" (1/1) ... [2018-10-26 21:14:02,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:14:02,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:14:02,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:14:02,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:14:02,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01" (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:14:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:14:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:14:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:14:11,959 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:14:11,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:14:11 BoogieIcfgContainer [2018-10-26 21:14:11,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:14:11,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:14:11,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:14:11,964 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:14:11,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:13:59" (1/3) ... [2018-10-26 21:14:11,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49726e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:14:11, skipping insertion in model container [2018-10-26 21:14:11,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:01" (2/3) ... [2018-10-26 21:14:11,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49726e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:14:11, skipping insertion in model container [2018-10-26 21:14:11,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:14:11" (3/3) ... [2018-10-26 21:14:11,968 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label01_true-unreach-call.c [2018-10-26 21:14:11,978 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:14:11,988 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:14:12,005 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:14:12,060 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:14:12,060 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:14:12,061 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:14:12,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:14:12,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:14:12,061 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:14:12,061 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:14:12,061 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:14:12,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:14:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-26 21:14:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 21:14:12,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:14:12,118 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:14:12,120 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:14:12,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1660793902, now seen corresponding path program 1 times [2018-10-26 21:14:12,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:14:12,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:14:12,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:12,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:12,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:12,594 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:14:12,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:14:12,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:14:12,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:14:12,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:14:12,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:14:12,622 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-10-26 21:14:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:14:26,539 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-10-26 21:14:26,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:14:26,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-10-26 21:14:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:14:26,584 INFO L225 Difference]: With dead ends: 3146 [2018-10-26 21:14:26,584 INFO L226 Difference]: Without dead ends: 2320 [2018-10-26 21:14:26,593 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:14:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-10-26 21:14:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-10-26 21:14:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-10-26 21:14:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3858 transitions. [2018-10-26 21:14:26,767 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3858 transitions. Word has length 48 [2018-10-26 21:14:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:14:26,767 INFO L481 AbstractCegarLoop]: Abstraction has 2320 states and 3858 transitions. [2018-10-26 21:14:26,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:14:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3858 transitions. [2018-10-26 21:14:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 21:14:26,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:14:26,777 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:26,777 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:14:26,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:26,778 INFO L82 PathProgramCache]: Analyzing trace with hash 156164161, now seen corresponding path program 1 times [2018-10-26 21:14:26,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:14:26,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:14:26,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:26,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:27,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:14:27,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:14:27,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:14:27,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:14:27,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:14:27,090 INFO L87 Difference]: Start difference. First operand 2320 states and 3858 transitions. Second operand 4 states. [2018-10-26 21:14:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:14:43,465 INFO L93 Difference]: Finished difference Result 9150 states and 15304 transitions. [2018-10-26 21:14:43,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:14:43,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-10-26 21:14:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:14:43,501 INFO L225 Difference]: With dead ends: 9150 [2018-10-26 21:14:43,501 INFO L226 Difference]: Without dead ends: 6832 [2018-10-26 21:14:43,506 INFO L605 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-10-26 21:14:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-10-26 21:14:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-10-26 21:14:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-10-26 21:14:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 10776 transitions. [2018-10-26 21:14:43,636 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 10776 transitions. Word has length 120 [2018-10-26 21:14:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:14:43,637 INFO L481 AbstractCegarLoop]: Abstraction has 6832 states and 10776 transitions. [2018-10-26 21:14:43,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:14:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 10776 transitions. [2018-10-26 21:14:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-26 21:14:43,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:14:43,643 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:43,643 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:14:43,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:43,643 INFO L82 PathProgramCache]: Analyzing trace with hash -806140398, now seen corresponding path program 1 times [2018-10-26 21:14:43,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:14:43,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:14:43,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:43,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:43,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:14:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:14:43,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:14:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:14:43,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:14:43,999 INFO L87 Difference]: Start difference. First operand 6832 states and 10776 transitions. Second operand 6 states. [2018-10-26 21:15:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:01,298 INFO L93 Difference]: Finished difference Result 16670 states and 25698 transitions. [2018-10-26 21:15:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:15:01,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-10-26 21:15:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:01,344 INFO L225 Difference]: With dead ends: 16670 [2018-10-26 21:15:01,344 INFO L226 Difference]: Without dead ends: 9840 [2018-10-26 21:15:01,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:15:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9840 states. [2018-10-26 21:15:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9840 to 9840. [2018-10-26 21:15:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9840 states. [2018-10-26 21:15:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9840 states to 9840 states and 14314 transitions. [2018-10-26 21:15:01,542 INFO L78 Accepts]: Start accepts. Automaton has 9840 states and 14314 transitions. Word has length 126 [2018-10-26 21:15:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:01,542 INFO L481 AbstractCegarLoop]: Abstraction has 9840 states and 14314 transitions. [2018-10-26 21:15:01,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:15:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 9840 states and 14314 transitions. [2018-10-26 21:15:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 21:15:01,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:01,546 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-10-26 21:15:01,546 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:01,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash 617018433, now seen corresponding path program 1 times [2018-10-26 21:15:01,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:15:01,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:15:01,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:01,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:01,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:02,028 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-26 21:15:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 21:15:02,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:15:02,328 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:15:02,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:02,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:15:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:02,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:15:02,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 21:15:02,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:15:02,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:15:02,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:15:02,601 INFO L87 Difference]: Start difference. First operand 9840 states and 14314 transitions. Second operand 7 states. [2018-10-26 21:15:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:25,721 INFO L93 Difference]: Finished difference Result 49788 states and 73805 transitions. [2018-10-26 21:15:25,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:15:25,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2018-10-26 21:15:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:25,819 INFO L225 Difference]: With dead ends: 49788 [2018-10-26 21:15:25,819 INFO L226 Difference]: Without dead ends: 38443 [2018-10-26 21:15:25,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:15:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38443 states. [2018-10-26 21:15:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38443 to 23375. [2018-10-26 21:15:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23375 states. [2018-10-26 21:15:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23375 states to 23375 states and 28888 transitions. [2018-10-26 21:15:26,557 INFO L78 Accepts]: Start accepts. Automaton has 23375 states and 28888 transitions. Word has length 198 [2018-10-26 21:15:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:26,557 INFO L481 AbstractCegarLoop]: Abstraction has 23375 states and 28888 transitions. [2018-10-26 21:15:26,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:15:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 23375 states and 28888 transitions. [2018-10-26 21:15:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-26 21:15:26,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:26,570 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2018-10-26 21:15:26,570 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:26,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash -738194658, now seen corresponding path program 1 times [2018-10-26 21:15:26,571 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:15:26,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:15:26,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:26,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:26,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-26 21:15:26,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:26,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:15:26,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:15:26,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:15:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:15:26,926 INFO L87 Difference]: Start difference. First operand 23375 states and 28888 transitions. Second operand 3 states. [2018-10-26 21:15:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:31,480 INFO L93 Difference]: Finished difference Result 52764 states and 65832 transitions. [2018-10-26 21:15:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:15:31,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 432 [2018-10-26 21:15:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:31,549 INFO L225 Difference]: With dead ends: 52764 [2018-10-26 21:15:31,549 INFO L226 Difference]: Without dead ends: 30143 [2018-10-26 21:15:31,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:15:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30143 states. [2018-10-26 21:15:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30143 to 29391. [2018-10-26 21:15:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29391 states. [2018-10-26 21:15:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29391 states to 29391 states and 35499 transitions. [2018-10-26 21:15:32,002 INFO L78 Accepts]: Start accepts. Automaton has 29391 states and 35499 transitions. Word has length 432 [2018-10-26 21:15:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:32,002 INFO L481 AbstractCegarLoop]: Abstraction has 29391 states and 35499 transitions. [2018-10-26 21:15:32,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:15:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 29391 states and 35499 transitions. [2018-10-26 21:15:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-26 21:15:32,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:32,023 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:32,024 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:32,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1038639364, now seen corresponding path program 1 times [2018-10-26 21:15:32,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:15:32,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:15:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:32,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-26 21:15:32,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:32,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:15:32,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:15:32,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:15:32,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:15:32,861 INFO L87 Difference]: Start difference. First operand 29391 states and 35499 transitions. Second operand 4 states. [2018-10-26 21:15:41,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:41,879 INFO L93 Difference]: Finished difference Result 100892 states and 121455 transitions. [2018-10-26 21:15:41,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:15:41,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 438 [2018-10-26 21:15:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:41,995 INFO L225 Difference]: With dead ends: 100892 [2018-10-26 21:15:41,995 INFO L226 Difference]: Without dead ends: 72255 [2018-10-26 21:15:42,037 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:15:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72255 states. [2018-10-26 21:15:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72255 to 71503. [2018-10-26 21:15:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71503 states. [2018-10-26 21:15:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71503 states to 71503 states and 81256 transitions. [2018-10-26 21:15:42,901 INFO L78 Accepts]: Start accepts. Automaton has 71503 states and 81256 transitions. Word has length 438 [2018-10-26 21:15:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:42,902 INFO L481 AbstractCegarLoop]: Abstraction has 71503 states and 81256 transitions. [2018-10-26 21:15:42,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:15:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 71503 states and 81256 transitions. [2018-10-26 21:15:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-10-26 21:15:42,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:42,932 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:15:42,932 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:42,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:42,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1743584792, now seen corresponding path program 1 times [2018-10-26 21:15:42,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:15:42,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:15:42,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:42,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:42,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2018-10-26 21:15:43,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:43,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:15:43,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:15:43,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:15:43,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:15:43,659 INFO L87 Difference]: Start difference. First operand 71503 states and 81256 transitions. Second operand 3 states. [2018-10-26 21:15:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:49,243 INFO L93 Difference]: Finished difference Result 143000 states and 162614 transitions. [2018-10-26 21:15:49,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:15:49,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 460 [2018-10-26 21:15:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:49,352 INFO L225 Difference]: With dead ends: 143000 [2018-10-26 21:15:49,352 INFO L226 Difference]: Without dead ends: 72251 [2018-10-26 21:15:49,400 INFO L605 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-10-26 21:15:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72251 states. [2018-10-26 21:15:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72251 to 69995. [2018-10-26 21:15:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69995 states. [2018-10-26 21:15:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69995 states to 69995 states and 77145 transitions. [2018-10-26 21:15:50,138 INFO L78 Accepts]: Start accepts. Automaton has 69995 states and 77145 transitions. Word has length 460 [2018-10-26 21:15:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:50,139 INFO L481 AbstractCegarLoop]: Abstraction has 69995 states and 77145 transitions. [2018-10-26 21:15:50,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:15:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 69995 states and 77145 transitions. [2018-10-26 21:15:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-26 21:15:50,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:50,190 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:50,190 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:50,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:50,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1557070065, now seen corresponding path program 1 times [2018-10-26 21:15:50,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:15:50,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:15:50,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:50,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:50,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-10-26 21:15:51,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:51,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:15:51,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:15:51,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:15:51,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:15:51,176 INFO L87 Difference]: Start difference. First operand 69995 states and 77145 transitions. Second operand 4 states. [2018-10-26 21:16:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:16:01,508 INFO L93 Difference]: Finished difference Result 148260 states and 164087 transitions. [2018-10-26 21:16:01,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:16:01,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 619 [2018-10-26 21:16:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:16:01,595 INFO L225 Difference]: With dead ends: 148260 [2018-10-26 21:16:01,596 INFO L226 Difference]: Without dead ends: 79019 [2018-10-26 21:16:01,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 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:16:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79019 states. [2018-10-26 21:16:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79019 to 76011. [2018-10-26 21:16:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76011 states. [2018-10-26 21:16:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76011 states to 76011 states and 82758 transitions. [2018-10-26 21:16:02,447 INFO L78 Accepts]: Start accepts. Automaton has 76011 states and 82758 transitions. Word has length 619 [2018-10-26 21:16:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:16:02,448 INFO L481 AbstractCegarLoop]: Abstraction has 76011 states and 82758 transitions. [2018-10-26 21:16:02,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:16:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 76011 states and 82758 transitions. [2018-10-26 21:16:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-10-26 21:16:02,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:16:02,521 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2018-10-26 21:16:02,522 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:16:02,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:16:02,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1469063627, now seen corresponding path program 1 times [2018-10-26 21:16:02,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:16:02,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:16:02,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:02,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:16:02,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:03,186 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-26 21:16:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-26 21:16:03,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:16:03,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:16:03,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:16:03,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:16:03,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:16:03,851 INFO L87 Difference]: Start difference. First operand 76011 states and 82758 transitions. Second operand 4 states. [2018-10-26 21:16:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:16:11,529 INFO L93 Difference]: Finished difference Result 156532 states and 170382 transitions. [2018-10-26 21:16:11,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:16:11,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 643 [2018-10-26 21:16:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:16:11,616 INFO L225 Difference]: With dead ends: 156532 [2018-10-26 21:16:11,617 INFO L226 Difference]: Without dead ends: 81275 [2018-10-26 21:16:11,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:16:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81275 states. [2018-10-26 21:16:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81275 to 79771. [2018-10-26 21:16:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79771 states. [2018-10-26 21:16:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79771 states to 79771 states and 86225 transitions. [2018-10-26 21:16:12,374 INFO L78 Accepts]: Start accepts. Automaton has 79771 states and 86225 transitions. Word has length 643 [2018-10-26 21:16:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:16:12,374 INFO L481 AbstractCegarLoop]: Abstraction has 79771 states and 86225 transitions. [2018-10-26 21:16:12,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:16:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 79771 states and 86225 transitions. [2018-10-26 21:16:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-10-26 21:16:12,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:16:12,396 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 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] [2018-10-26 21:16:12,397 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:16:12,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:16:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1351687765, now seen corresponding path program 1 times [2018-10-26 21:16:12,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:16:12,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:16:12,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:12,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:16:12,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:13,036 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 21:16:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-26 21:16:13,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:16:13,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:16:13,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:16:13,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:16:13,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:16:13,956 INFO L87 Difference]: Start difference. First operand 79771 states and 86225 transitions. Second operand 4 states. [2018-10-26 21:16:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:16:21,844 INFO L93 Difference]: Finished difference Result 160292 states and 173258 transitions. [2018-10-26 21:16:21,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:16:21,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 647 [2018-10-26 21:16:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:16:21,944 INFO L225 Difference]: With dead ends: 160292 [2018-10-26 21:16:21,944 INFO L226 Difference]: Without dead ends: 79767 [2018-10-26 21:16:21,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:16:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79767 states. [2018-10-26 21:16:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79767 to 79767. [2018-10-26 21:16:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79767 states. [2018-10-26 21:16:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79767 states to 79767 states and 85328 transitions. [2018-10-26 21:16:22,632 INFO L78 Accepts]: Start accepts. Automaton has 79767 states and 85328 transitions. Word has length 647 [2018-10-26 21:16:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:16:22,633 INFO L481 AbstractCegarLoop]: Abstraction has 79767 states and 85328 transitions. [2018-10-26 21:16:22,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:16:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 79767 states and 85328 transitions. [2018-10-26 21:16:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-10-26 21:16:22,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:16:22,654 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:16:22,654 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:16:22,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:16:22,655 INFO L82 PathProgramCache]: Analyzing trace with hash 508948473, now seen corresponding path program 1 times [2018-10-26 21:16:22,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:16:22,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:16:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:16:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-10-26 21:16:23,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:16:23,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:16:23,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:16:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:16:23,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:16:23,464 INFO L87 Difference]: Start difference. First operand 79767 states and 85328 transitions. Second operand 3 states. [2018-10-26 21:16:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:16:29,209 INFO L93 Difference]: Finished difference Result 200892 states and 215608 transitions. [2018-10-26 21:16:29,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:16:29,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 676 [2018-10-26 21:16:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:16:29,338 INFO L225 Difference]: With dead ends: 200892 [2018-10-26 21:16:29,338 INFO L226 Difference]: Without dead ends: 121879 [2018-10-26 21:16:29,393 INFO L605 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-10-26 21:16:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121879 states. [2018-10-26 21:16:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121879 to 118871. [2018-10-26 21:16:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118871 states. [2018-10-26 21:16:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118871 states to 118871 states and 125933 transitions. [2018-10-26 21:16:30,273 INFO L78 Accepts]: Start accepts. Automaton has 118871 states and 125933 transitions. Word has length 676 [2018-10-26 21:16:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:16:30,274 INFO L481 AbstractCegarLoop]: Abstraction has 118871 states and 125933 transitions. [2018-10-26 21:16:30,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:16:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 118871 states and 125933 transitions. [2018-10-26 21:16:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-10-26 21:16:30,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:16:30,297 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:16:30,298 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:16:30,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:16:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash 61251109, now seen corresponding path program 1 times [2018-10-26 21:16:30,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:16:30,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:16:30,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:30,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:16:30,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-10-26 21:16:31,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:16:31,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:16:31,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:16:31,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:16:31,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:16:31,533 INFO L87 Difference]: Start difference. First operand 118871 states and 125933 transitions. Second operand 4 states. [2018-10-26 21:16:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:16:43,297 INFO L93 Difference]: Finished difference Result 238492 states and 252626 transitions. [2018-10-26 21:16:43,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:16:43,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 698 [2018-10-26 21:16:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:16:43,426 INFO L225 Difference]: With dead ends: 238492 [2018-10-26 21:16:43,426 INFO L226 Difference]: Without dead ends: 115855 [2018-10-26 21:16:43,490 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:16:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115855 states. [2018-10-26 21:16:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115855 to 113599. [2018-10-26 21:16:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113599 states. [2018-10-26 21:16:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113599 states to 113599 states and 119099 transitions. [2018-10-26 21:16:45,137 INFO L78 Accepts]: Start accepts. Automaton has 113599 states and 119099 transitions. Word has length 698 [2018-10-26 21:16:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:16:45,137 INFO L481 AbstractCegarLoop]: Abstraction has 113599 states and 119099 transitions. [2018-10-26 21:16:45,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:16:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 113599 states and 119099 transitions. [2018-10-26 21:16:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-26 21:16:45,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:16:45,157 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:16:45,157 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:16:45,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:16:45,158 INFO L82 PathProgramCache]: Analyzing trace with hash -341500258, now seen corresponding path program 1 times [2018-10-26 21:16:45,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:16:45,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:16:45,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:45,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:16:45,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:16:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 190 proven. 634 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 21:16:46,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:16:46,520 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:16:46,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:16:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:46,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:16:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-10-26 21:16:47,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:16:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-10-26 21:16:47,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:16:47,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:16:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:16:47,891 INFO L87 Difference]: Start difference. First operand 113599 states and 119099 transitions. Second operand 9 states. [2018-10-26 21:17:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:17:14,171 INFO L93 Difference]: Finished difference Result 245243 states and 257220 transitions. [2018-10-26 21:17:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 21:17:14,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 730 [2018-10-26 21:17:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:17:14,297 INFO L225 Difference]: With dead ends: 245243 [2018-10-26 21:17:14,297 INFO L226 Difference]: Without dead ends: 123361 [2018-10-26 21:17:14,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 737 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-10-26 21:17:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123361 states. [2018-10-26 21:17:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123361 to 103056. [2018-10-26 21:17:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103056 states. [2018-10-26 21:17:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103056 states to 103056 states and 106728 transitions. [2018-10-26 21:17:15,167 INFO L78 Accepts]: Start accepts. Automaton has 103056 states and 106728 transitions. Word has length 730 [2018-10-26 21:17:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:17:15,168 INFO L481 AbstractCegarLoop]: Abstraction has 103056 states and 106728 transitions. [2018-10-26 21:17:15,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:17:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 103056 states and 106728 transitions. [2018-10-26 21:17:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-10-26 21:17:15,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:17:15,185 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:17:15,185 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:17:15,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:17:15,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1696256535, now seen corresponding path program 1 times [2018-10-26 21:17:15,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:17:15,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:17:15,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:17:15,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:17:15,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:17:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:17:15,861 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 21:17:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-26 21:17:17,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:17:17,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:17:17,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:17:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:17:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:17:17,248 INFO L87 Difference]: Start difference. First operand 103056 states and 106728 transitions. Second operand 4 states. [2018-10-26 21:17:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:17:25,271 INFO L93 Difference]: Finished difference Result 209118 states and 216504 transitions. [2018-10-26 21:17:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:17:25,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 780 [2018-10-26 21:17:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:17:25,383 INFO L225 Difference]: With dead ends: 209118 [2018-10-26 21:17:25,383 INFO L226 Difference]: Without dead ends: 106816 [2018-10-26 21:17:25,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:17:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106816 states. [2018-10-26 21:17:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106816 to 102304. [2018-10-26 21:17:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102304 states. [2018-10-26 21:17:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102304 states to 102304 states and 105730 transitions. [2018-10-26 21:17:27,214 INFO L78 Accepts]: Start accepts. Automaton has 102304 states and 105730 transitions. Word has length 780 [2018-10-26 21:17:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:17:27,214 INFO L481 AbstractCegarLoop]: Abstraction has 102304 states and 105730 transitions. [2018-10-26 21:17:27,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:17:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 102304 states and 105730 transitions. [2018-10-26 21:17:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2018-10-26 21:17:27,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:17:27,241 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:27,241 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:17:27,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:17:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1787581214, now seen corresponding path program 1 times [2018-10-26 21:17:27,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:17:27,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:17:27,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:17:27,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:17:27,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:17:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:17:28,116 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 21:17:28,502 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-10-26 21:17:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 312 proven. 869 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 21:17:30,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:17:30,972 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:17:30,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:17:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:17:31,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:17:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 723 proven. 0 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2018-10-26 21:17:32,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:17:32,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-10-26 21:17:32,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:17:32,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:17:32,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:17:32,956 INFO L87 Difference]: Start difference. First operand 102304 states and 105730 transitions. Second operand 12 states. Received shutdown request... [2018-10-26 21:17:49,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 21:17:49,227 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 21:17:49,233 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 21:17:49,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:17:49 BoogieIcfgContainer [2018-10-26 21:17:49,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:17:49,234 INFO L168 Benchmark]: Toolchain (without parser) took 230146.99 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 960.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:17:49,235 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:17:49,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2034.58 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: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-10-26 21:17:49,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 704.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -978.1 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. [2018-10-26 21:17:49,238 INFO L168 Benchmark]: Boogie Preprocessor took 304.80 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2018-10-26 21:17:49,239 INFO L168 Benchmark]: RCFGBuilder took 9821.63 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 246.4 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -209.1 MB). Peak memory consumption was 667.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:17:49,240 INFO L168 Benchmark]: TraceAbstraction took 217272.86 ms. Allocated memory was 2.6 GB in the beginning and 3.5 GB in the end (delta: 943.2 MB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: -57.8 MB). Peak memory consumption was 885.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:17:49,245 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 2034.58 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: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 704.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -978.1 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 304.80 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9821.63 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 246.4 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -209.1 MB). Peak memory consumption was 667.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217272.86 ms. Allocated memory was 2.6 GB in the beginning and 3.5 GB in the end (delta: 943.2 MB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: -57.8 MB). Peak memory consumption was 885.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 153]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 153). Cancelled while BasicCegarLoop was constructing difference of abstraction (102304states) and FLOYD_HOARE automaton (currently 17 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (37480 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 217.1s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 185.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10784 SDtfs, 35671 SDslu, 1818 SDs, 0 SdLazy, 98783 SolverSat, 13570 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 152.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1860 GetRequests, 1774 SyntacticMatches, 23 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118871occurred in iteration=11, 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: 10.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 53421 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 9159 NumberOfCodeBlocks, 9159 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 9141 ConstructedInterpolants, 0 QuantifiedInterpolants, 20515405 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2150 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 10471/11979 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown