java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label57_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:34:11,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:34:11,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:34:11,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:34:11,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:34:11,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:34:11,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:34:11,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:34:11,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:34:11,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:34:12,000 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:34:12,001 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:34:12,002 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:34:12,003 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:34:12,004 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:34:12,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:34:12,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:34:12,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:34:12,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:34:12,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:34:12,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:34:12,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:34:12,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:34:12,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:34:12,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:34:12,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:34:12,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:34:12,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:34:12,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:34:12,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:34:12,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:34:12,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:34:12,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:34:12,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:34:12,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:34:12,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:34:12,033 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:34:12,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:34:12,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:34:12,050 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:34:12,050 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:34:12,051 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:34:12,051 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:34:12,051 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:34:12,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:34:12,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:34:12,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:34:12,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:34:12,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:34:12,052 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:34:12,052 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:34:12,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:34:12,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:34:12,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:34:12,053 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:34:12,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:34:12,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:34:12,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:34:12,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:34:12,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:34:12,056 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:34:12,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:34:12,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:34:12,056 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:34:12,056 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:34:12,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:34:12,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:34:12,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:34:12,142 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:34:12,143 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:34:12,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label57_true-unreach-call.c [2018-11-06 21:34:12,207 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810609d00/7efb75ccf77240b0843e8cc8723fccc1/FLAGb4642b503 [2018-11-06 21:34:12,890 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:34:12,891 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label57_true-unreach-call.c [2018-11-06 21:34:12,914 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810609d00/7efb75ccf77240b0843e8cc8723fccc1/FLAGb4642b503 [2018-11-06 21:34:12,936 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810609d00/7efb75ccf77240b0843e8cc8723fccc1 [2018-11-06 21:34:12,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:34:12,947 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:34:12,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:34:12,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:34:12,952 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:34:12,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:34:12" (1/1) ... [2018-11-06 21:34:12,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2964f187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:12, skipping insertion in model container [2018-11-06 21:34:12,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:34:12" (1/1) ... [2018-11-06 21:34:12,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:34:13,078 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:34:13,923 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:34:13,928 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:34:14,240 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:34:14,260 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:34:14,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14 WrapperNode [2018-11-06 21:34:14,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:34:14,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:34:14,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:34:14,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:34:14,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... [2018-11-06 21:34:14,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... [2018-11-06 21:34:14,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:34:14,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:34:14,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:34:14,652 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:34:14,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... [2018-11-06 21:34:14,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... [2018-11-06 21:34:14,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... [2018-11-06 21:34:14,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... [2018-11-06 21:34:14,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... [2018-11-06 21:34:14,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... [2018-11-06 21:34:14,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... [2018-11-06 21:34:14,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:34:14,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:34:14,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:34:14,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:34:14,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:34:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:34:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:34:15,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:34:22,075 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:34:22,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:34:22 BoogieIcfgContainer [2018-11-06 21:34:22,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:34:22,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:34:22,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:34:22,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:34:22,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:34:12" (1/3) ... [2018-11-06 21:34:22,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d8e7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:34:22, skipping insertion in model container [2018-11-06 21:34:22,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:14" (2/3) ... [2018-11-06 21:34:22,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d8e7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:34:22, skipping insertion in model container [2018-11-06 21:34:22,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:34:22" (3/3) ... [2018-11-06 21:34:22,084 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label57_true-unreach-call.c [2018-11-06 21:34:22,094 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:34:22,103 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:34:22,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:34:22,160 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:34:22,160 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:34:22,161 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:34:22,161 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:34:22,161 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:34:22,161 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:34:22,161 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:34:22,162 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:34:22,162 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:34:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-11-06 21:34:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-06 21:34:22,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:22,201 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] [2018-11-06 21:34:22,203 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:22,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:22,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1057203130, now seen corresponding path program 1 times [2018-11-06 21:34:22,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:22,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:22,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:22,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:22,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:22,685 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:34:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:34:22,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:22,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:22,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:34:22,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:34:22,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:22,775 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-11-06 21:34:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:28,565 INFO L93 Difference]: Finished difference Result 1471 states and 2719 transitions. [2018-11-06 21:34:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:34:28,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-06 21:34:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:28,595 INFO L225 Difference]: With dead ends: 1471 [2018-11-06 21:34:28,595 INFO L226 Difference]: Without dead ends: 1039 [2018-11-06 21:34:28,601 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-11-06 21:34:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1037. [2018-11-06 21:34:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-11-06 21:34:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1662 transitions. [2018-11-06 21:34:28,718 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1662 transitions. Word has length 42 [2018-11-06 21:34:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:28,718 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1662 transitions. [2018-11-06 21:34:28,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:34:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1662 transitions. [2018-11-06 21:34:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-06 21:34:28,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:28,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:28,728 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:28,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash -206840875, now seen corresponding path program 1 times [2018-11-06 21:34:28,728 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:28,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:28,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:28,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:34:29,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:29,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:29,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:34:29,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:34:29,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:29,096 INFO L87 Difference]: Start difference. First operand 1037 states and 1662 transitions. Second operand 4 states. [2018-11-06 21:34:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:34,953 INFO L93 Difference]: Finished difference Result 3939 states and 6385 transitions. [2018-11-06 21:34:34,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:34:34,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-11-06 21:34:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:34,972 INFO L225 Difference]: With dead ends: 3939 [2018-11-06 21:34:34,972 INFO L226 Difference]: Without dead ends: 2904 [2018-11-06 21:34:34,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2018-11-06 21:34:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1938. [2018-11-06 21:34:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2018-11-06 21:34:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2794 transitions. [2018-11-06 21:34:35,038 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2794 transitions. Word has length 118 [2018-11-06 21:34:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:35,039 INFO L480 AbstractCegarLoop]: Abstraction has 1938 states and 2794 transitions. [2018-11-06 21:34:35,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:34:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2794 transitions. [2018-11-06 21:34:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-11-06 21:34:35,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:35,053 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:35,053 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:35,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:35,054 INFO L82 PathProgramCache]: Analyzing trace with hash -950387328, now seen corresponding path program 1 times [2018-11-06 21:34:35,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:35,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:35,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:35,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:35,724 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-06 21:34:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-06 21:34:36,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:36,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:34:36,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:34:36,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:34:36,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:34:36,069 INFO L87 Difference]: Start difference. First operand 1938 states and 2794 transitions. Second operand 5 states. [2018-11-06 21:34:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:41,655 INFO L93 Difference]: Finished difference Result 4779 states and 6610 transitions. [2018-11-06 21:34:41,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:34:41,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2018-11-06 21:34:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:41,672 INFO L225 Difference]: With dead ends: 4779 [2018-11-06 21:34:41,672 INFO L226 Difference]: Without dead ends: 2843 [2018-11-06 21:34:41,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:34:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2018-11-06 21:34:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2842. [2018-11-06 21:34:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2842 states. [2018-11-06 21:34:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 3761 transitions. [2018-11-06 21:34:41,724 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 3761 transitions. Word has length 392 [2018-11-06 21:34:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:41,727 INFO L480 AbstractCegarLoop]: Abstraction has 2842 states and 3761 transitions. [2018-11-06 21:34:41,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:34:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 3761 transitions. [2018-11-06 21:34:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-11-06 21:34:41,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:41,735 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:41,735 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:41,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1161204594, now seen corresponding path program 1 times [2018-11-06 21:34:41,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:41,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:41,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-06 21:34:42,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:42,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:34:42,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:34:42,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:34:42,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:42,468 INFO L87 Difference]: Start difference. First operand 2842 states and 3761 transitions. Second operand 4 states. [2018-11-06 21:34:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:45,923 INFO L93 Difference]: Finished difference Result 5983 states and 8140 transitions. [2018-11-06 21:34:45,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:34:45,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2018-11-06 21:34:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:45,949 INFO L225 Difference]: With dead ends: 5983 [2018-11-06 21:34:45,950 INFO L226 Difference]: Without dead ends: 3446 [2018-11-06 21:34:45,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2018-11-06 21:34:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3444. [2018-11-06 21:34:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3444 states. [2018-11-06 21:34:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 4309 transitions. [2018-11-06 21:34:46,034 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 4309 transitions. Word has length 466 [2018-11-06 21:34:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:46,035 INFO L480 AbstractCegarLoop]: Abstraction has 3444 states and 4309 transitions. [2018-11-06 21:34:46,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:34:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 4309 transitions. [2018-11-06 21:34:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-11-06 21:34:46,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:46,047 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:46,048 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:46,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash -537850778, now seen corresponding path program 1 times [2018-11-06 21:34:46,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:46,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:46,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:46,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-06 21:34:46,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:46,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:34:46,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:34:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:34:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:46,561 INFO L87 Difference]: Start difference. First operand 3444 states and 4309 transitions. Second operand 4 states. [2018-11-06 21:34:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:49,623 INFO L93 Difference]: Finished difference Result 7190 states and 9172 transitions. [2018-11-06 21:34:49,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:34:49,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 475 [2018-11-06 21:34:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:49,642 INFO L225 Difference]: With dead ends: 7190 [2018-11-06 21:34:49,642 INFO L226 Difference]: Without dead ends: 4051 [2018-11-06 21:34:49,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2018-11-06 21:34:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 4047. [2018-11-06 21:34:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4047 states. [2018-11-06 21:34:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 4877 transitions. [2018-11-06 21:34:49,716 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 4877 transitions. Word has length 475 [2018-11-06 21:34:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:49,717 INFO L480 AbstractCegarLoop]: Abstraction has 4047 states and 4877 transitions. [2018-11-06 21:34:49,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:34:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 4877 transitions. [2018-11-06 21:34:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-11-06 21:34:49,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:49,730 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:49,730 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:49,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:49,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1637377501, now seen corresponding path program 1 times [2018-11-06 21:34:49,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:49,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:49,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-06 21:34:50,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:50,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:50,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:50,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:50,291 INFO L87 Difference]: Start difference. First operand 4047 states and 4877 transitions. Second operand 3 states. [2018-11-06 21:34:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:52,580 INFO L93 Difference]: Finished difference Result 10189 states and 12204 transitions. [2018-11-06 21:34:52,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:52,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2018-11-06 21:34:52,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:52,600 INFO L225 Difference]: With dead ends: 10189 [2018-11-06 21:34:52,601 INFO L226 Difference]: Without dead ends: 6144 [2018-11-06 21:34:52,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6144 states. [2018-11-06 21:34:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6144 to 5544. [2018-11-06 21:34:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5544 states. [2018-11-06 21:34:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 6480 transitions. [2018-11-06 21:34:52,697 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 6480 transitions. Word has length 496 [2018-11-06 21:34:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:52,698 INFO L480 AbstractCegarLoop]: Abstraction has 5544 states and 6480 transitions. [2018-11-06 21:34:52,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 6480 transitions. [2018-11-06 21:34:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-11-06 21:34:52,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:52,711 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 21:34:52,711 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:52,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash -679040075, now seen corresponding path program 1 times [2018-11-06 21:34:52,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:52,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:52,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:52,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:52,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-11-06 21:34:53,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:53,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:34:53,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:34:53,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:34:53,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:53,465 INFO L87 Difference]: Start difference. First operand 5544 states and 6480 transitions. Second operand 4 states. [2018-11-06 21:34:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:57,187 INFO L93 Difference]: Finished difference Result 16471 states and 19329 transitions. [2018-11-06 21:34:57,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:34:57,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 499 [2018-11-06 21:34:57,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:57,214 INFO L225 Difference]: With dead ends: 16471 [2018-11-06 21:34:57,214 INFO L226 Difference]: Without dead ends: 7269 [2018-11-06 21:34:57,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2018-11-06 21:34:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 7269. [2018-11-06 21:34:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7269 states. [2018-11-06 21:34:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 7624 transitions. [2018-11-06 21:34:57,322 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 7624 transitions. Word has length 499 [2018-11-06 21:34:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:57,323 INFO L480 AbstractCegarLoop]: Abstraction has 7269 states and 7624 transitions. [2018-11-06 21:34:57,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:34:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 7624 transitions. [2018-11-06 21:34:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-11-06 21:34:57,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:57,343 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:57,343 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:57,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash -885852833, now seen corresponding path program 1 times [2018-11-06 21:34:57,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:57,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:57,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:57,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:57,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 1009 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-11-06 21:34:58,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:58,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:58,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:58,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:58,154 INFO L87 Difference]: Start difference. First operand 7269 states and 7624 transitions. Second operand 3 states. [2018-11-06 21:35:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:35:00,046 INFO L93 Difference]: Finished difference Result 17537 states and 18464 transitions. [2018-11-06 21:35:00,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:35:00,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 819 [2018-11-06 21:35:00,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:35:00,073 INFO L225 Difference]: With dead ends: 17537 [2018-11-06 21:35:00,074 INFO L226 Difference]: Without dead ends: 10570 [2018-11-06 21:35:00,081 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:35:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10570 states. [2018-11-06 21:35:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10570 to 8770. [2018-11-06 21:35:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8770 states. [2018-11-06 21:35:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8770 states to 8770 states and 9189 transitions. [2018-11-06 21:35:00,200 INFO L78 Accepts]: Start accepts. Automaton has 8770 states and 9189 transitions. Word has length 819 [2018-11-06 21:35:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:35:00,201 INFO L480 AbstractCegarLoop]: Abstraction has 8770 states and 9189 transitions. [2018-11-06 21:35:00,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:35:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 8770 states and 9189 transitions. [2018-11-06 21:35:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-11-06 21:35:00,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:35:00,223 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:35:00,223 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:35:00,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:35:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash -637617602, now seen corresponding path program 1 times [2018-11-06 21:35:00,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:35:00,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:35:00,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:00,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:00,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-06 21:35:01,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:35:01,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:35:01,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:35:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:35:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:35:01,364 INFO L87 Difference]: Start difference. First operand 8770 states and 9189 transitions. Second operand 3 states. [2018-11-06 21:35:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:35:03,723 INFO L93 Difference]: Finished difference Result 18137 states and 19013 transitions. [2018-11-06 21:35:03,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:35:03,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 831 [2018-11-06 21:35:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:35:03,741 INFO L225 Difference]: With dead ends: 18137 [2018-11-06 21:35:03,741 INFO L226 Difference]: Without dead ends: 9669 [2018-11-06 21:35:03,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:35:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9669 states. [2018-11-06 21:35:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9669 to 8769. [2018-11-06 21:35:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8769 states. [2018-11-06 21:35:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8769 states to 8769 states and 9187 transitions. [2018-11-06 21:35:03,848 INFO L78 Accepts]: Start accepts. Automaton has 8769 states and 9187 transitions. Word has length 831 [2018-11-06 21:35:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:35:03,849 INFO L480 AbstractCegarLoop]: Abstraction has 8769 states and 9187 transitions. [2018-11-06 21:35:03,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:35:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 8769 states and 9187 transitions. [2018-11-06 21:35:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2018-11-06 21:35:03,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:35:03,868 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:35:03,868 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:35:03,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:35:03,869 INFO L82 PathProgramCache]: Analyzing trace with hash 256118363, now seen corresponding path program 1 times [2018-11-06 21:35:03,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:35:03,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:35:03,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:03,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:03,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 40 proven. 537 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-11-06 21:35:05,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:35:05,770 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:35:05,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:06,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:35:06,473 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 16 [2018-11-06 21:35:10,547 WARN L179 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 65 DAG size of output: 23 [2018-11-06 21:35:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 40 proven. 537 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-11-06 21:35:12,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:35:12,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-11-06 21:35:12,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:35:12,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:35:12,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:35:12,486 INFO L87 Difference]: Start difference. First operand 8769 states and 9187 transitions. Second operand 9 states. [2018-11-06 21:36:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:36:30,363 INFO L93 Difference]: Finished difference Result 34692 states and 36412 transitions. [2018-11-06 21:36:30,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:36:30,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 852 [2018-11-06 21:36:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:36:30,408 INFO L225 Difference]: With dead ends: 34692 [2018-11-06 21:36:30,408 INFO L226 Difference]: Without dead ends: 26225 [2018-11-06 21:36:30,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:36:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26225 states. [2018-11-06 21:36:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26225 to 16894. [2018-11-06 21:36:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16894 states. [2018-11-06 21:36:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16894 states to 16894 states and 17774 transitions. [2018-11-06 21:36:30,747 INFO L78 Accepts]: Start accepts. Automaton has 16894 states and 17774 transitions. Word has length 852 [2018-11-06 21:36:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:36:30,749 INFO L480 AbstractCegarLoop]: Abstraction has 16894 states and 17774 transitions. [2018-11-06 21:36:30,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:36:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 16894 states and 17774 transitions. [2018-11-06 21:36:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2018-11-06 21:36:30,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:36:30,774 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:36:30,774 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:36:30,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:36:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash -578528063, now seen corresponding path program 1 times [2018-11-06 21:36:30,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:36:30,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:36:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:36:30,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:36:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:36:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:36:31,556 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-11-06 21:36:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 1098 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2018-11-06 21:36:31,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:36:31,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:36:31,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:36:31,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:36:31,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:36:31,977 INFO L87 Difference]: Start difference. First operand 16894 states and 17774 transitions. Second operand 4 states. [2018-11-06 21:36:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:36:34,267 INFO L93 Difference]: Finished difference Result 46392 states and 48749 transitions. [2018-11-06 21:36:34,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:36:34,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 883 [2018-11-06 21:36:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:36:34,315 INFO L225 Difference]: With dead ends: 46392 [2018-11-06 21:36:34,315 INFO L226 Difference]: Without dead ends: 29800 [2018-11-06 21:36:34,335 INFO L604 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-11-06 21:36:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29800 states. [2018-11-06 21:36:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29800 to 21972. [2018-11-06 21:36:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21972 states. [2018-11-06 21:36:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21972 states to 21972 states and 22902 transitions. [2018-11-06 21:36:34,661 INFO L78 Accepts]: Start accepts. Automaton has 21972 states and 22902 transitions. Word has length 883 [2018-11-06 21:36:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:36:34,662 INFO L480 AbstractCegarLoop]: Abstraction has 21972 states and 22902 transitions. [2018-11-06 21:36:34,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:36:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21972 states and 22902 transitions. [2018-11-06 21:36:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 960 [2018-11-06 21:36:34,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:36:34,698 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:36:34,699 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:36:34,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:36:34,699 INFO L82 PathProgramCache]: Analyzing trace with hash 646601708, now seen corresponding path program 1 times [2018-11-06 21:36:34,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:36:34,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:36:34,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:36:34,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:36:34,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:36:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:36:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 1042 proven. 196 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-06 21:36:37,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:36:37,152 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:36:37,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:36:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:36:37,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:36:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 795 proven. 0 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2018-11-06 21:36:38,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:36:38,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:36:38,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:36:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:36:38,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:36:38,914 INFO L87 Difference]: Start difference. First operand 21972 states and 22902 transitions. Second operand 6 states. [2018-11-06 21:36:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:36:48,023 INFO L93 Difference]: Finished difference Result 50866 states and 53100 transitions. [2018-11-06 21:36:48,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:36:48,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 959 [2018-11-06 21:36:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:36:48,063 INFO L225 Difference]: With dead ends: 50866 [2018-11-06 21:36:48,063 INFO L226 Difference]: Without dead ends: 24679 [2018-11-06 21:36:48,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 969 GetRequests, 961 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:36:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24679 states. [2018-11-06 21:36:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24679 to 21660. [2018-11-06 21:36:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21660 states. [2018-11-06 21:36:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21660 states to 21660 states and 22417 transitions. [2018-11-06 21:36:48,375 INFO L78 Accepts]: Start accepts. Automaton has 21660 states and 22417 transitions. Word has length 959 [2018-11-06 21:36:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:36:48,375 INFO L480 AbstractCegarLoop]: Abstraction has 21660 states and 22417 transitions. [2018-11-06 21:36:48,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:36:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 21660 states and 22417 transitions. [2018-11-06 21:36:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-11-06 21:36:48,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:36:48,405 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:36:48,405 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:36:48,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:36:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash 95805792, now seen corresponding path program 1 times [2018-11-06 21:36:48,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:36:48,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:36:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:36:48,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:36:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:36:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:36:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 80 proven. 1104 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2018-11-06 21:36:51,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:36:51,126 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:36:51,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:36:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:36:51,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:36:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 80 proven. 1104 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2018-11-06 21:36:52,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:36:52,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-11-06 21:36:52,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:36:52,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:36:52,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:36:52,879 INFO L87 Difference]: Start difference. First operand 21660 states and 22417 transitions. Second operand 7 states. [2018-11-06 21:36:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:36:56,640 INFO L93 Difference]: Finished difference Result 31587 states and 32732 transitions. [2018-11-06 21:36:56,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:36:56,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1038 [2018-11-06 21:36:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:36:56,687 INFO L225 Difference]: With dead ends: 31587 [2018-11-06 21:36:56,687 INFO L226 Difference]: Without dead ends: 31585 [2018-11-06 21:36:56,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1043 GetRequests, 1035 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:36:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31585 states. [2018-11-06 21:36:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31585 to 17154. [2018-11-06 21:36:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2018-11-06 21:36:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 17731 transitions. [2018-11-06 21:36:56,982 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 17731 transitions. Word has length 1038 [2018-11-06 21:36:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:36:56,983 INFO L480 AbstractCegarLoop]: Abstraction has 17154 states and 17731 transitions. [2018-11-06 21:36:56,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:36:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 17731 transitions. [2018-11-06 21:36:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1107 [2018-11-06 21:36:57,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:36:57,005 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-06 21:36:57,006 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:36:57,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:36:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash 357968378, now seen corresponding path program 1 times [2018-11-06 21:36:57,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:36:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:36:57,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:36:57,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:36:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:36:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:36:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 80 proven. 1167 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2018-11-06 21:36:59,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:36:59,657 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:36:59,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:36:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:36:59,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:37:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 80 proven. 1167 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2018-11-06 21:37:02,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:37:02,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-11-06 21:37:02,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:37:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:37:02,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:37:02,043 INFO L87 Difference]: Start difference. First operand 17154 states and 17731 transitions. Second operand 6 states. [2018-11-06 21:37:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:06,017 INFO L93 Difference]: Finished difference Result 25279 states and 26183 transitions. [2018-11-06 21:37:06,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:37:06,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1106 [2018-11-06 21:37:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:06,044 INFO L225 Difference]: With dead ends: 25279 [2018-11-06 21:37:06,044 INFO L226 Difference]: Without dead ends: 25277 [2018-11-06 21:37:06,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1110 GetRequests, 1104 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:37:06,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25277 states. [2018-11-06 21:37:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25277 to 18658. [2018-11-06 21:37:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18658 states. [2018-11-06 21:37:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18658 states to 18658 states and 19297 transitions. [2018-11-06 21:37:06,311 INFO L78 Accepts]: Start accepts. Automaton has 18658 states and 19297 transitions. Word has length 1106 [2018-11-06 21:37:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:06,312 INFO L480 AbstractCegarLoop]: Abstraction has 18658 states and 19297 transitions. [2018-11-06 21:37:06,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:37:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 18658 states and 19297 transitions. [2018-11-06 21:37:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1348 [2018-11-06 21:37:06,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:06,343 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:37:06,343 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:06,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1690892681, now seen corresponding path program 1 times [2018-11-06 21:37:06,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:06,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:06,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3431 backedges. 1966 proven. 764 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2018-11-06 21:37:08,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:37:08,827 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:37:08,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:09,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:37:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3431 backedges. 2030 proven. 700 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2018-11-06 21:37:10,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:37:10,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-11-06 21:37:10,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:37:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:37:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:37:10,413 INFO L87 Difference]: Start difference. First operand 18658 states and 19297 transitions. Second operand 6 states. [2018-11-06 21:37:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:14,041 INFO L93 Difference]: Finished difference Result 30991 states and 32141 transitions. [2018-11-06 21:37:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:37:14,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1347 [2018-11-06 21:37:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:14,071 INFO L225 Difference]: With dead ends: 30991 [2018-11-06 21:37:14,071 INFO L226 Difference]: Without dead ends: 30989 [2018-11-06 21:37:14,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1352 GetRequests, 1346 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:37:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30989 states. [2018-11-06 21:37:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30989 to 24074. [2018-11-06 21:37:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24074 states. [2018-11-06 21:37:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24074 states to 24074 states and 24934 transitions. [2018-11-06 21:37:14,381 INFO L78 Accepts]: Start accepts. Automaton has 24074 states and 24934 transitions. Word has length 1347 [2018-11-06 21:37:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:14,382 INFO L480 AbstractCegarLoop]: Abstraction has 24074 states and 24934 transitions. [2018-11-06 21:37:14,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:37:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 24074 states and 24934 transitions. [2018-11-06 21:37:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1449 [2018-11-06 21:37:14,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:14,414 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-11-06 21:37:14,414 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:14,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:14,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1765664877, now seen corresponding path program 1 times [2018-11-06 21:37:14,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:14,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:14,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:14,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:14,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:15,745 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-06 21:37:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 2687 proven. 0 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2018-11-06 21:37:17,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:37:17,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:37:17,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:37:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:37:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:37:17,331 INFO L87 Difference]: Start difference. First operand 24074 states and 24934 transitions. Second operand 4 states. [2018-11-06 21:37:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:19,285 INFO L93 Difference]: Finished difference Result 47565 states and 49278 transitions. [2018-11-06 21:37:19,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:37:19,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1448 [2018-11-06 21:37:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:19,306 INFO L225 Difference]: With dead ends: 47565 [2018-11-06 21:37:19,306 INFO L226 Difference]: Without dead ends: 24093 [2018-11-06 21:37:19,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:37:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24093 states. [2018-11-06 21:37:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24093 to 24074. [2018-11-06 21:37:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24074 states. [2018-11-06 21:37:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24074 states to 24074 states and 24879 transitions. [2018-11-06 21:37:19,571 INFO L78 Accepts]: Start accepts. Automaton has 24074 states and 24879 transitions. Word has length 1448 [2018-11-06 21:37:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:19,572 INFO L480 AbstractCegarLoop]: Abstraction has 24074 states and 24879 transitions. [2018-11-06 21:37:19,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:37:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 24074 states and 24879 transitions. [2018-11-06 21:37:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1492 [2018-11-06 21:37:19,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:19,605 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:37:19,605 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:19,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1569569278, now seen corresponding path program 1 times [2018-11-06 21:37:19,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:19,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:19,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:19,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:20,858 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:37:21,126 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-11-06 21:37:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 3130 proven. 537 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2018-11-06 21:37:22,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:37:22,687 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:37:22,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:23,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:37:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 2612 proven. 350 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2018-11-06 21:37:26,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:37:27,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2018-11-06 21:37:27,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 21:37:27,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 21:37:27,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:37:27,002 INFO L87 Difference]: Start difference. First operand 24074 states and 24879 transitions. Second operand 13 states. [2018-11-06 21:37:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:52,678 INFO L93 Difference]: Finished difference Result 54498 states and 56251 transitions. [2018-11-06 21:37:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-06 21:37:52,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1491 [2018-11-06 21:37:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:52,679 INFO L225 Difference]: With dead ends: 54498 [2018-11-06 21:37:52,679 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:37:52,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1583 GetRequests, 1527 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=662, Invalid=2200, Unknown=0, NotChecked=0, Total=2862 [2018-11-06 21:37:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:37:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:37:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:37:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:37:52,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1491 [2018-11-06 21:37:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:52,701 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:37:52,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 21:37:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:37:52,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:37:52,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:37:52,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:53,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:54,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:55,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:55,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:55,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:55,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:55,439 WARN L179 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 752 DAG size of output: 624 [2018-11-06 21:37:55,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:55,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:55,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:55,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:56,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,222 WARN L179 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 752 DAG size of output: 624 [2018-11-06 21:37:57,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:57,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:58,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:58,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:37:58,204 WARN L179 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 662 DAG size of output: 555 Received shutdown request... [2018-11-06 21:38:06,313 WARN L187 SmtUtils]: Removed 12 from assertion stack [2018-11-06 21:38:06,313 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-11-06 21:38:06,314 INFO L168 Benchmark]: Toolchain (without parser) took 233367.79 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -244.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:38:06,315 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:38:06,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1313.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:38:06,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 389.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -876.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:38:06,317 INFO L168 Benchmark]: Boogie Preprocessor took 283.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:38:06,323 INFO L168 Benchmark]: RCFGBuilder took 7140.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 311.2 MB). Peak memory consumption was 311.2 MB. Max. memory is 7.1 GB. [2018-11-06 21:38:06,324 INFO L168 Benchmark]: TraceAbstraction took 224236.24 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 173.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-06 21:38:06,328 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.28 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 1313.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 389.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -876.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 283.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7140.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 311.2 MB). Peak memory consumption was 311.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224236.24 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 173.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 130]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 600. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown