java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label16_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:32:49,981 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:32:49,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:32:49,995 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:32:49,995 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:32:49,996 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:32:49,997 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:32:49,999 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:32:50,001 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:32:50,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:32:50,003 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:32:50,003 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:32:50,006 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:32:50,007 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:32:50,008 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:32:50,011 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:32:50,012 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:32:50,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:32:50,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:32:50,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:32:50,030 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:32:50,031 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:32:50,036 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:32:50,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:32:50,036 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:32:50,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:32:50,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:32:50,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:32:50,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:32:50,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:32:50,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:32:50,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:32:50,050 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:32:50,050 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:32:50,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:32:50,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:32:50,053 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 16:32:50,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:32:50,078 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:32:50,078 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:32:50,079 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:32:50,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:32:50,079 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:32:50,080 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:32:50,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:32:50,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:32:50,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:32:50,080 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:32:50,081 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:32:50,081 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:32:50,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:32:50,081 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:32:50,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:32:50,082 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:32:50,082 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:32:50,082 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:32:50,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:32:50,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:32:50,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:32:50,083 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:32:50,083 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:32:50,083 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:32:50,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:32:50,084 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:32:50,084 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:32:50,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:32:50,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:32:50,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:32:50,145 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:32:50,145 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:32:50,146 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label16_true-unreach-call.c [2018-10-24 16:32:50,202 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b858222ad/29d2b19300d54fb7a1ad7d896b5cc7c7/FLAG81e03b3e5 [2018-10-24 16:32:50,822 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:32:50,823 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label16_true-unreach-call.c [2018-10-24 16:32:50,845 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b858222ad/29d2b19300d54fb7a1ad7d896b5cc7c7/FLAG81e03b3e5 [2018-10-24 16:32:50,867 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b858222ad/29d2b19300d54fb7a1ad7d896b5cc7c7 [2018-10-24 16:32:50,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:32:50,881 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:32:50,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:32:50,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:32:50,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:32:50,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:32:50" (1/1) ... [2018-10-24 16:32:50,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ecd9993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:50, skipping insertion in model container [2018-10-24 16:32:50,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:32:50" (1/1) ... [2018-10-24 16:32:50,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:32:51,005 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:32:51,856 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:32:51,863 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:32:52,129 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:32:52,150 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:32:52,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52 WrapperNode [2018-10-24 16:32:52,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:32:52,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:32:52,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:32:52,153 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:32:52,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... [2018-10-24 16:32:52,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... [2018-10-24 16:32:52,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:32:52,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:32:52,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:32:52,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:32:52,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... [2018-10-24 16:32:52,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... [2018-10-24 16:32:52,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... [2018-10-24 16:32:52,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... [2018-10-24 16:32:52,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... [2018-10-24 16:32:52,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... [2018-10-24 16:32:52,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... [2018-10-24 16:32:52,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:32:52,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:32:52,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:32:52,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:32:52,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:32:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:32:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:32:52,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:33:00,985 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:33:00,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:33:00 BoogieIcfgContainer [2018-10-24 16:33:00,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:33:00,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:33:00,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:33:00,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:33:00,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:32:50" (1/3) ... [2018-10-24 16:33:00,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674dde3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:33:00, skipping insertion in model container [2018-10-24 16:33:00,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:32:52" (2/3) ... [2018-10-24 16:33:00,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674dde3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:33:00, skipping insertion in model container [2018-10-24 16:33:00,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:33:00" (3/3) ... [2018-10-24 16:33:00,995 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label16_true-unreach-call.c [2018-10-24 16:33:01,006 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:33:01,021 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:33:01,039 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:33:01,091 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:33:01,092 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:33:01,092 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:33:01,092 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:33:01,092 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:33:01,092 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:33:01,093 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:33:01,093 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:33:01,093 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:33:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-10-24 16:33:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-24 16:33:01,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:33:01,138 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:33:01,141 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:33:01,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:33:01,148 INFO L82 PathProgramCache]: Analyzing trace with hash 265969354, now seen corresponding path program 1 times [2018-10-24 16:33:01,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:33:01,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:33:01,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:33:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:33:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:33:01,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:33:01,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:33:01,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:33:01,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:33:01,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:33:01,756 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-10-24 16:33:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:33:10,846 INFO L93 Difference]: Finished difference Result 1474 states and 2723 transitions. [2018-10-24 16:33:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:33:10,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-10-24 16:33:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:33:10,880 INFO L225 Difference]: With dead ends: 1474 [2018-10-24 16:33:10,880 INFO L226 Difference]: Without dead ends: 1042 [2018-10-24 16:33:10,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:33:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2018-10-24 16:33:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1040. [2018-10-24 16:33:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-10-24 16:33:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1638 transitions. [2018-10-24 16:33:11,030 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1638 transitions. Word has length 63 [2018-10-24 16:33:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:33:11,031 INFO L481 AbstractCegarLoop]: Abstraction has 1040 states and 1638 transitions. [2018-10-24 16:33:11,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:33:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1638 transitions. [2018-10-24 16:33:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 16:33:11,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:33:11,038 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:33:11,039 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:33:11,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:33:11,039 INFO L82 PathProgramCache]: Analyzing trace with hash -899294482, now seen corresponding path program 1 times [2018-10-24 16:33:11,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:33:11,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:33:11,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:11,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:33:11,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:33:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:33:11,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:33:11,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:33:11,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:33:11,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:33:11,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:33:11,488 INFO L87 Difference]: Start difference. First operand 1040 states and 1638 transitions. Second operand 5 states. [2018-10-24 16:33:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:33:28,356 INFO L93 Difference]: Finished difference Result 3299 states and 5135 transitions. [2018-10-24 16:33:28,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:33:28,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-10-24 16:33:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:33:28,370 INFO L225 Difference]: With dead ends: 3299 [2018-10-24 16:33:28,370 INFO L226 Difference]: Without dead ends: 2261 [2018-10-24 16:33:28,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:33:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2018-10-24 16:33:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1953. [2018-10-24 16:33:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2018-10-24 16:33:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2816 transitions. [2018-10-24 16:33:28,426 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2816 transitions. Word has length 129 [2018-10-24 16:33:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:33:28,427 INFO L481 AbstractCegarLoop]: Abstraction has 1953 states and 2816 transitions. [2018-10-24 16:33:28,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:33:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2816 transitions. [2018-10-24 16:33:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-24 16:33:28,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:33:28,431 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:33:28,431 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:33:28,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:33:28,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183744, now seen corresponding path program 1 times [2018-10-24 16:33:28,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:33:28,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:33:28,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:28,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:33:28,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:33:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:33:28,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:33:28,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:33:28,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:33:28,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:33:28,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:33:28,741 INFO L87 Difference]: Start difference. First operand 1953 states and 2816 transitions. Second operand 4 states. [2018-10-24 16:33:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:33:34,674 INFO L93 Difference]: Finished difference Result 7212 states and 10585 transitions. [2018-10-24 16:33:34,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:33:34,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-10-24 16:33:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:33:34,701 INFO L225 Difference]: With dead ends: 7212 [2018-10-24 16:33:34,701 INFO L226 Difference]: Without dead ends: 5261 [2018-10-24 16:33:34,706 INFO L605 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-10-24 16:33:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2018-10-24 16:33:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5255. [2018-10-24 16:33:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5255 states. [2018-10-24 16:33:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5255 states to 5255 states and 6986 transitions. [2018-10-24 16:33:34,813 INFO L78 Accepts]: Start accepts. Automaton has 5255 states and 6986 transitions. Word has length 134 [2018-10-24 16:33:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:33:34,814 INFO L481 AbstractCegarLoop]: Abstraction has 5255 states and 6986 transitions. [2018-10-24 16:33:34,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:33:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 6986 transitions. [2018-10-24 16:33:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-24 16:33:34,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:33:34,820 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-24 16:33:34,820 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:33:34,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:33:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash -648643925, now seen corresponding path program 1 times [2018-10-24 16:33:34,821 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:33:34,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:33:34,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:34,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:33:34,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:33:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 121 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-24 16:33:35,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:33:35,237 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:33:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:33:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:33:35,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:33:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:33:35,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:33:35,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-24 16:33:35,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:33:35,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:33:35,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:33:35,521 INFO L87 Difference]: Start difference. First operand 5255 states and 6986 transitions. Second operand 4 states. [2018-10-24 16:33:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:33:41,961 INFO L93 Difference]: Finished difference Result 19280 states and 26028 transitions. [2018-10-24 16:33:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:33:41,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2018-10-24 16:33:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:33:42,026 INFO L225 Difference]: With dead ends: 19280 [2018-10-24 16:33:42,026 INFO L226 Difference]: Without dead ends: 14027 [2018-10-24 16:33:42,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:33:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14027 states. [2018-10-24 16:33:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14027 to 8857. [2018-10-24 16:33:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2018-10-24 16:33:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 11192 transitions. [2018-10-24 16:33:42,240 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 11192 transitions. Word has length 235 [2018-10-24 16:33:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:33:42,241 INFO L481 AbstractCegarLoop]: Abstraction has 8857 states and 11192 transitions. [2018-10-24 16:33:42,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:33:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 11192 transitions. [2018-10-24 16:33:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-24 16:33:42,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:33:42,252 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-24 16:33:42,253 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:33:42,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:33:42,253 INFO L82 PathProgramCache]: Analyzing trace with hash -845032929, now seen corresponding path program 1 times [2018-10-24 16:33:42,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:33:42,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:33:42,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:42,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:33:42,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:33:42,834 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-24 16:33:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 16:33:43,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:33:43,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:33:43,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:33:43,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:33:43,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:33:43,035 INFO L87 Difference]: Start difference. First operand 8857 states and 11192 transitions. Second operand 5 states. [2018-10-24 16:33:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:33:48,541 INFO L93 Difference]: Finished difference Result 19215 states and 24057 transitions. [2018-10-24 16:33:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:33:48,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 337 [2018-10-24 16:33:48,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:33:48,583 INFO L225 Difference]: With dead ends: 19215 [2018-10-24 16:33:48,583 INFO L226 Difference]: Without dead ends: 10360 [2018-10-24 16:33:48,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:33:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10360 states. [2018-10-24 16:33:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10360 to 10057. [2018-10-24 16:33:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2018-10-24 16:33:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 12448 transitions. [2018-10-24 16:33:48,904 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 12448 transitions. Word has length 337 [2018-10-24 16:33:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:33:48,905 INFO L481 AbstractCegarLoop]: Abstraction has 10057 states and 12448 transitions. [2018-10-24 16:33:48,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:33:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 12448 transitions. [2018-10-24 16:33:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-24 16:33:48,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:33:48,921 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:33:48,921 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:33:48,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:33:48,922 INFO L82 PathProgramCache]: Analyzing trace with hash -506042351, now seen corresponding path program 1 times [2018-10-24 16:33:48,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:33:48,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:33:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:48,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:33:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:33:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-24 16:33:49,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:33:49,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:33:49,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:33:49,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:33:49,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:33:49,381 INFO L87 Difference]: Start difference. First operand 10057 states and 12448 transitions. Second operand 4 states. [2018-10-24 16:33:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:33:54,515 INFO L93 Difference]: Finished difference Result 25814 states and 32434 transitions. [2018-10-24 16:33:54,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:33:54,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2018-10-24 16:33:54,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:33:54,553 INFO L225 Difference]: With dead ends: 25814 [2018-10-24 16:33:54,554 INFO L226 Difference]: Without dead ends: 15759 [2018-10-24 16:33:54,567 INFO L605 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-10-24 16:33:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15759 states. [2018-10-24 16:33:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15759 to 15759. [2018-10-24 16:33:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15759 states. [2018-10-24 16:33:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15759 states to 15759 states and 18917 transitions. [2018-10-24 16:33:54,771 INFO L78 Accepts]: Start accepts. Automaton has 15759 states and 18917 transitions. Word has length 411 [2018-10-24 16:33:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:33:54,772 INFO L481 AbstractCegarLoop]: Abstraction has 15759 states and 18917 transitions. [2018-10-24 16:33:54,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:33:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 15759 states and 18917 transitions. [2018-10-24 16:33:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-24 16:33:54,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:33:54,792 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:33:54,792 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:33:54,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:33:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2057211809, now seen corresponding path program 1 times [2018-10-24 16:33:54,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:33:54,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:33:54,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:54,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:33:54,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:33:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:33:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 16:33:55,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:33:55,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:33:55,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:33:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:33:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:33:55,451 INFO L87 Difference]: Start difference. First operand 15759 states and 18917 transitions. Second operand 4 states. [2018-10-24 16:34:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:01,360 INFO L93 Difference]: Finished difference Result 31518 states and 37839 transitions. [2018-10-24 16:34:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:34:01,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2018-10-24 16:34:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:01,391 INFO L225 Difference]: With dead ends: 31518 [2018-10-24 16:34:01,392 INFO L226 Difference]: Without dead ends: 15761 [2018-10-24 16:34:01,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:34:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15761 states. [2018-10-24 16:34:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15761 to 15757. [2018-10-24 16:34:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15757 states. [2018-10-24 16:34:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15757 states to 15757 states and 18094 transitions. [2018-10-24 16:34:01,611 INFO L78 Accepts]: Start accepts. Automaton has 15757 states and 18094 transitions. Word has length 496 [2018-10-24 16:34:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:01,612 INFO L481 AbstractCegarLoop]: Abstraction has 15757 states and 18094 transitions. [2018-10-24 16:34:01,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:34:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 15757 states and 18094 transitions. [2018-10-24 16:34:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-24 16:34:01,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:01,633 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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-10-24 16:34:01,633 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:01,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:01,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1720017519, now seen corresponding path program 1 times [2018-10-24 16:34:01,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:01,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:01,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:01,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:02,411 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-24 16:34:02,752 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-24 16:34:03,190 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2018-10-24 16:34:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 542 proven. 4 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-10-24 16:34:03,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:34:03,919 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:34:03,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:04,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:34:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-24 16:34:04,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:34:04,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 16:34:04,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:34:04,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:34:04,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:34:04,293 INFO L87 Difference]: Start difference. First operand 15757 states and 18094 transitions. Second operand 8 states. [2018-10-24 16:34:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:14,316 INFO L93 Difference]: Finished difference Result 35882 states and 40871 transitions. [2018-10-24 16:34:14,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:34:14,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 520 [2018-10-24 16:34:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:14,338 INFO L225 Difference]: With dead ends: 35882 [2018-10-24 16:34:14,339 INFO L226 Difference]: Without dead ends: 16052 [2018-10-24 16:34:14,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:34:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16052 states. [2018-10-24 16:34:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16052 to 15752. [2018-10-24 16:34:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-10-24 16:34:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 17369 transitions. [2018-10-24 16:34:14,531 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 17369 transitions. Word has length 520 [2018-10-24 16:34:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:14,532 INFO L481 AbstractCegarLoop]: Abstraction has 15752 states and 17369 transitions. [2018-10-24 16:34:14,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:34:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 17369 transitions. [2018-10-24 16:34:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-10-24 16:34:14,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:14,549 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:34:14,549 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:14,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1798089204, now seen corresponding path program 1 times [2018-10-24 16:34:14,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:14,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:14,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:14,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:14,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:15,197 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 16:34:15,390 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-24 16:34:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 271 proven. 136 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 16:34:15,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:34:15,915 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:34:15,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:16,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:34:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-24 16:34:16,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:34:16,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-10-24 16:34:16,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:34:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:34:16,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:34:16,271 INFO L87 Difference]: Start difference. First operand 15752 states and 17369 transitions. Second operand 9 states. [2018-10-24 16:34:19,094 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-24 16:34:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:25,917 INFO L93 Difference]: Finished difference Result 31968 states and 35207 transitions. [2018-10-24 16:34:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:34:25,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 521 [2018-10-24 16:34:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:25,939 INFO L225 Difference]: With dead ends: 31968 [2018-10-24 16:34:25,939 INFO L226 Difference]: Without dead ends: 16218 [2018-10-24 16:34:25,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 525 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:34:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16218 states. [2018-10-24 16:34:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16218 to 15748. [2018-10-24 16:34:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15748 states. [2018-10-24 16:34:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15748 states to 15748 states and 16802 transitions. [2018-10-24 16:34:26,139 INFO L78 Accepts]: Start accepts. Automaton has 15748 states and 16802 transitions. Word has length 521 [2018-10-24 16:34:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:26,140 INFO L481 AbstractCegarLoop]: Abstraction has 15748 states and 16802 transitions. [2018-10-24 16:34:26,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:34:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 15748 states and 16802 transitions. [2018-10-24 16:34:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-24 16:34:26,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:26,160 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:34:26,160 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:26,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 191164642, now seen corresponding path program 1 times [2018-10-24 16:34:26,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:26,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:26,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-10-24 16:34:26,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:34:26,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:34:26,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:34:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:34:26,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:26,570 INFO L87 Difference]: Start difference. First operand 15748 states and 16802 transitions. Second operand 3 states. [2018-10-24 16:34:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:29,689 INFO L93 Difference]: Finished difference Result 31792 states and 33962 transitions. [2018-10-24 16:34:29,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:34:29,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 567 [2018-10-24 16:34:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:29,705 INFO L225 Difference]: With dead ends: 31792 [2018-10-24 16:34:29,705 INFO L226 Difference]: Without dead ends: 16046 [2018-10-24 16:34:29,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16046 states. [2018-10-24 16:34:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16046 to 15746. [2018-10-24 16:34:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15746 states. [2018-10-24 16:34:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15746 states to 15746 states and 16798 transitions. [2018-10-24 16:34:29,892 INFO L78 Accepts]: Start accepts. Automaton has 15746 states and 16798 transitions. Word has length 567 [2018-10-24 16:34:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:29,893 INFO L481 AbstractCegarLoop]: Abstraction has 15746 states and 16798 transitions. [2018-10-24 16:34:29,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:34:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 15746 states and 16798 transitions. [2018-10-24 16:34:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2018-10-24 16:34:29,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:29,906 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:34:29,907 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:29,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1070353790, now seen corresponding path program 1 times [2018-10-24 16:34:29,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:29,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:29,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-10-24 16:34:30,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:34:30,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:34:30,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:34:30,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:34:30,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:30,552 INFO L87 Difference]: Start difference. First operand 15746 states and 16798 transitions. Second operand 3 states. [2018-10-24 16:34:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:33,102 INFO L93 Difference]: Finished difference Result 37802 states and 40568 transitions. [2018-10-24 16:34:33,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:34:33,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 645 [2018-10-24 16:34:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:33,123 INFO L225 Difference]: With dead ends: 37802 [2018-10-24 16:34:33,123 INFO L226 Difference]: Without dead ends: 22058 [2018-10-24 16:34:33,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22058 states. [2018-10-24 16:34:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22058 to 22048. [2018-10-24 16:34:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22048 states. [2018-10-24 16:34:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22048 states to 22048 states and 23453 transitions. [2018-10-24 16:34:33,361 INFO L78 Accepts]: Start accepts. Automaton has 22048 states and 23453 transitions. Word has length 645 [2018-10-24 16:34:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:33,362 INFO L481 AbstractCegarLoop]: Abstraction has 22048 states and 23453 transitions. [2018-10-24 16:34:33,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:34:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 22048 states and 23453 transitions. [2018-10-24 16:34:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-10-24 16:34:33,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:33,377 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:34:33,377 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:33,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:33,378 INFO L82 PathProgramCache]: Analyzing trace with hash -684261465, now seen corresponding path program 1 times [2018-10-24 16:34:33,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:33,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:33,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:33,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:33,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2018-10-24 16:34:34,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:34:34,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:34:34,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:34:34,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:34:34,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:34:34,116 INFO L87 Difference]: Start difference. First operand 22048 states and 23453 transitions. Second operand 5 states. [2018-10-24 16:34:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:39,362 INFO L93 Difference]: Finished difference Result 58815 states and 62612 transitions. [2018-10-24 16:34:39,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:34:39,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 691 [2018-10-24 16:34:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:39,398 INFO L225 Difference]: With dead ends: 58815 [2018-10-24 16:34:39,398 INFO L226 Difference]: Without dead ends: 36769 [2018-10-24 16:34:39,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:34:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36769 states. [2018-10-24 16:34:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36769 to 28645. [2018-10-24 16:34:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28645 states. [2018-10-24 16:34:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28645 states to 28645 states and 30252 transitions. [2018-10-24 16:34:39,704 INFO L78 Accepts]: Start accepts. Automaton has 28645 states and 30252 transitions. Word has length 691 [2018-10-24 16:34:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:39,705 INFO L481 AbstractCegarLoop]: Abstraction has 28645 states and 30252 transitions. [2018-10-24 16:34:39,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:34:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand 28645 states and 30252 transitions. [2018-10-24 16:34:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2018-10-24 16:34:39,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:39,723 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:34:39,724 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:39,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 778946677, now seen corresponding path program 1 times [2018-10-24 16:34:39,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:39,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-24 16:34:40,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:34:40,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:34:40,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:34:40,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:34:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:40,348 INFO L87 Difference]: Start difference. First operand 28645 states and 30252 transitions. Second operand 3 states. [2018-10-24 16:34:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:42,887 INFO L93 Difference]: Finished difference Result 59687 states and 63192 transitions. [2018-10-24 16:34:42,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:34:42,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 696 [2018-10-24 16:34:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:42,917 INFO L225 Difference]: With dead ends: 59687 [2018-10-24 16:34:42,917 INFO L226 Difference]: Without dead ends: 31044 [2018-10-24 16:34:42,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31044 states. [2018-10-24 16:34:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31044 to 31044. [2018-10-24 16:34:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31044 states. [2018-10-24 16:34:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31044 states to 31044 states and 32565 transitions. [2018-10-24 16:34:43,269 INFO L78 Accepts]: Start accepts. Automaton has 31044 states and 32565 transitions. Word has length 696 [2018-10-24 16:34:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:43,270 INFO L481 AbstractCegarLoop]: Abstraction has 31044 states and 32565 transitions. [2018-10-24 16:34:43,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:34:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 31044 states and 32565 transitions. [2018-10-24 16:34:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-24 16:34:43,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:43,481 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:34:43,481 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:43,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:43,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1922978813, now seen corresponding path program 1 times [2018-10-24 16:34:43,482 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:43,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:43,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:43,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:43,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-10-24 16:34:44,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:34:44,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:34:44,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:34:44,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:34:44,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:44,296 INFO L87 Difference]: Start difference. First operand 31044 states and 32565 transitions. Second operand 3 states. [2018-10-24 16:34:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:46,808 INFO L93 Difference]: Finished difference Result 56339 states and 59052 transitions. [2018-10-24 16:34:46,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:34:46,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 758 [2018-10-24 16:34:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:46,825 INFO L225 Difference]: With dead ends: 56339 [2018-10-24 16:34:46,825 INFO L226 Difference]: Without dead ends: 16562 [2018-10-24 16:34:46,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16562 states. [2018-10-24 16:34:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16562 to 13862. [2018-10-24 16:34:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13862 states. [2018-10-24 16:34:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13862 states to 13862 states and 14243 transitions. [2018-10-24 16:34:46,976 INFO L78 Accepts]: Start accepts. Automaton has 13862 states and 14243 transitions. Word has length 758 [2018-10-24 16:34:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:46,977 INFO L481 AbstractCegarLoop]: Abstraction has 13862 states and 14243 transitions. [2018-10-24 16:34:46,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:34:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 13862 states and 14243 transitions. [2018-10-24 16:34:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2018-10-24 16:34:46,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:46,987 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:34:46,988 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:46,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash -562456670, now seen corresponding path program 1 times [2018-10-24 16:34:46,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:46,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:46,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:47,537 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 16:34:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2018-10-24 16:34:48,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:34:48,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:34:48,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:34:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:34:48,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:48,338 INFO L87 Difference]: Start difference. First operand 13862 states and 14243 transitions. Second operand 3 states. [2018-10-24 16:34:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:51,128 INFO L93 Difference]: Finished difference Result 30428 states and 31275 transitions. [2018-10-24 16:34:51,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:34:51,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 813 [2018-10-24 16:34:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:51,145 INFO L225 Difference]: With dead ends: 30428 [2018-10-24 16:34:51,145 INFO L226 Difference]: Without dead ends: 16567 [2018-10-24 16:34:51,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:34:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16567 states. [2018-10-24 16:34:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16567 to 15361. [2018-10-24 16:34:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15361 states. [2018-10-24 16:34:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15361 states to 15361 states and 15758 transitions. [2018-10-24 16:34:51,295 INFO L78 Accepts]: Start accepts. Automaton has 15361 states and 15758 transitions. Word has length 813 [2018-10-24 16:34:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:51,296 INFO L481 AbstractCegarLoop]: Abstraction has 15361 states and 15758 transitions. [2018-10-24 16:34:51,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:34:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 15361 states and 15758 transitions. [2018-10-24 16:34:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2018-10-24 16:34:51,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:51,306 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:34:51,306 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:51,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:51,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1363917183, now seen corresponding path program 1 times [2018-10-24 16:34:51,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:51,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:51,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:52,080 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 3 [2018-10-24 16:34:52,285 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2018-10-24 16:34:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 682 proven. 56 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-24 16:34:52,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:34:52,727 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 16:34:52,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:52,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:34:53,200 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2018-10-24 16:34:53,838 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-10-24 16:34:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 684 proven. 54 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-24 16:34:55,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:34:55,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-24 16:34:55,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:34:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:34:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:34:55,672 INFO L87 Difference]: Start difference. First operand 15361 states and 15758 transitions. Second operand 8 states. [2018-10-24 16:35:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:35:10,241 INFO L93 Difference]: Finished difference Result 39458 states and 40556 transitions. [2018-10-24 16:35:10,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 16:35:10,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 832 [2018-10-24 16:35:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:35:10,264 INFO L225 Difference]: With dead ends: 39458 [2018-10-24 16:35:10,265 INFO L226 Difference]: Without dead ends: 23490 [2018-10-24 16:35:10,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 835 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-10-24 16:35:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23490 states. [2018-10-24 16:35:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23490 to 15657. [2018-10-24 16:35:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15657 states. [2018-10-24 16:35:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15657 states to 15657 states and 16050 transitions. [2018-10-24 16:35:10,444 INFO L78 Accepts]: Start accepts. Automaton has 15657 states and 16050 transitions. Word has length 832 [2018-10-24 16:35:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:35:10,445 INFO L481 AbstractCegarLoop]: Abstraction has 15657 states and 16050 transitions. [2018-10-24 16:35:10,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:35:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 15657 states and 16050 transitions. [2018-10-24 16:35:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2018-10-24 16:35:10,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:35:10,456 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:35:10,456 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:35:10,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:35:10,456 INFO L82 PathProgramCache]: Analyzing trace with hash 51617314, now seen corresponding path program 1 times [2018-10-24 16:35:10,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:35:10,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:35:10,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:35:10,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:35:10,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:35:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:35:11,048 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-10-24 16:35:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-24 16:35:11,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:35:11,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:35:11,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:35:11,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:35:11,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:35:11,473 INFO L87 Difference]: Start difference. First operand 15657 states and 16050 transitions. Second operand 3 states. [2018-10-24 16:35:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:35:13,523 INFO L93 Difference]: Finished difference Result 32216 states and 33040 transitions. [2018-10-24 16:35:13,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:35:13,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 841 [2018-10-24 16:35:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:35:13,538 INFO L225 Difference]: With dead ends: 32216 [2018-10-24 16:35:13,538 INFO L226 Difference]: Without dead ends: 16861 [2018-10-24 16:35:13,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:35:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16861 states. [2018-10-24 16:35:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16861 to 15354. [2018-10-24 16:35:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15354 states. [2018-10-24 16:35:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15354 states to 15354 states and 15717 transitions. [2018-10-24 16:35:13,696 INFO L78 Accepts]: Start accepts. Automaton has 15354 states and 15717 transitions. Word has length 841 [2018-10-24 16:35:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:35:13,696 INFO L481 AbstractCegarLoop]: Abstraction has 15354 states and 15717 transitions. [2018-10-24 16:35:13,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:35:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15354 states and 15717 transitions. [2018-10-24 16:35:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2018-10-24 16:35:13,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:35:13,709 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:35:13,709 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:35:13,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:35:13,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1597390021, now seen corresponding path program 1 times [2018-10-24 16:35:13,710 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:35:13,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:35:13,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:35:13,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:35:13,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:35:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:35:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 562 proven. 399 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-10-24 16:35:15,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:35:15,683 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 16:35:15,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:35:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:35:15,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:35:16,307 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 16 [2018-10-24 16:35:16,772 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-10-24 16:35:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 834 proven. 188 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-24 16:35:17,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:35:17,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 10 [2018-10-24 16:35:17,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 16:35:17,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 16:35:17,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:35:17,684 INFO L87 Difference]: Start difference. First operand 15354 states and 15717 transitions. Second operand 10 states. [2018-10-24 16:35:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:35:36,259 INFO L93 Difference]: Finished difference Result 41245 states and 42245 transitions. [2018-10-24 16:35:36,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-24 16:35:36,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 854 [2018-10-24 16:35:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:35:36,285 INFO L225 Difference]: With dead ends: 41245 [2018-10-24 16:35:36,285 INFO L226 Difference]: Without dead ends: 25886 [2018-10-24 16:35:36,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 16:35:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25886 states. [2018-10-24 16:35:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25886 to 15350. [2018-10-24 16:35:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15350 states. [2018-10-24 16:35:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15350 states to 15350 states and 15632 transitions. [2018-10-24 16:35:36,490 INFO L78 Accepts]: Start accepts. Automaton has 15350 states and 15632 transitions. Word has length 854 [2018-10-24 16:35:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:35:36,490 INFO L481 AbstractCegarLoop]: Abstraction has 15350 states and 15632 transitions. [2018-10-24 16:35:36,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 16:35:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 15350 states and 15632 transitions. [2018-10-24 16:35:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2018-10-24 16:35:36,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:35:36,505 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:35:36,506 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:35:36,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:35:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1666864483, now seen corresponding path program 1 times [2018-10-24 16:35:36,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:35:36,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:35:36,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:35:36,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:35:36,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:35:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:35:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 1141 proven. 80 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-24 16:35:37,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:35:37,744 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 16:35:37,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:35:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:35:38,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:35:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 1141 proven. 77 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-10-24 16:35:38,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:35:38,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-10-24 16:35:38,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 16:35:38,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 16:35:38,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:35:38,833 INFO L87 Difference]: Start difference. First operand 15350 states and 15632 transitions. Second operand 11 states. [2018-10-24 16:35:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:35:48,297 INFO L93 Difference]: Finished difference Result 31607 states and 32193 transitions. [2018-10-24 16:35:48,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:35:48,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 911 [2018-10-24 16:35:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:35:48,312 INFO L225 Difference]: With dead ends: 31607 [2018-10-24 16:35:48,312 INFO L226 Difference]: Without dead ends: 18059 [2018-10-24 16:35:48,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 916 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-10-24 16:35:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2018-10-24 16:35:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 15650. [2018-10-24 16:35:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15650 states. [2018-10-24 16:35:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15650 states to 15650 states and 15900 transitions. [2018-10-24 16:35:48,484 INFO L78 Accepts]: Start accepts. Automaton has 15650 states and 15900 transitions. Word has length 911 [2018-10-24 16:35:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:35:48,485 INFO L481 AbstractCegarLoop]: Abstraction has 15650 states and 15900 transitions. [2018-10-24 16:35:48,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 16:35:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 15650 states and 15900 transitions. [2018-10-24 16:35:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2018-10-24 16:35:48,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:35:48,500 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:35:48,501 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:35:48,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:35:48,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1766446063, now seen corresponding path program 1 times [2018-10-24 16:35:48,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:35:48,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:35:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:35:48,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:35:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:35:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:35:49,370 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 16:35:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 999 proven. 135 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-24 16:35:51,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:35:51,739 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:35:51,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:35:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:35:51,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:35:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 927 proven. 207 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-24 16:35:56,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:35:56,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2018-10-24 16:35:56,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 16:35:56,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 16:35:56,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=233, Unknown=1, NotChecked=0, Total=306 [2018-10-24 16:35:56,123 INFO L87 Difference]: Start difference. First operand 15650 states and 15900 transitions. Second operand 18 states. Received shutdown request... [2018-10-24 16:36:48,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-24 16:36:48,975 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 16:36:48,981 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 16:36:48,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:36:48 BoogieIcfgContainer [2018-10-24 16:36:48,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:36:48,985 INFO L168 Benchmark]: Toolchain (without parser) took 238103.13 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-24 16:36:48,985 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:36:48,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1270.04 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.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:36:48,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 412.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -882.9 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-24 16:36:48,987 INFO L168 Benchmark]: Boogie Preprocessor took 259.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2018-10-24 16:36:48,988 INFO L168 Benchmark]: RCFGBuilder took 8161.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 309.8 MB). Peak memory consumption was 309.8 MB. Max. memory is 7.1 GB. [2018-10-24 16:36:48,990 INFO L168 Benchmark]: TraceAbstraction took 227994.27 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 2.8 GB in the end (delta: -967.0 MB). Peak memory consumption was 877.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:36:48,998 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1270.04 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.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 412.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -882.9 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 259.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8161.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 309.8 MB). Peak memory consumption was 309.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227994.27 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 2.8 GB in the end (delta: -967.0 MB). Peak memory consumption was 877.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 193]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 193). Cancelled while BasicCegarLoop was constructing difference of abstraction (15650states) and FLOYD_HOARE automaton (currently 26 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (3544 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. TIMEOUT Result, 227.9s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 191.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5841 SDtfs, 28882 SDslu, 3341 SDs, 0 SdLazy, 70131 SolverSat, 6770 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 169.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5018 GetRequests, 4860 SyntacticMatches, 21 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31044occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 41188 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 16161 NumberOfCodeBlocks, 16161 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 16134 ConstructedInterpolants, 638 QuantifiedInterpolants, 46180833 SizeOfPredicates, 13 NumberOfNonLiveVariables, 5683 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 19614/20954 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown