java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label07_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:00:40,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:00:40,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:00:40,033 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:00:40,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:00:40,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:00:40,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:00:40,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:00:40,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:00:40,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:00:40,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:00:40,044 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:00:40,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:00:40,048 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:00:40,049 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:00:40,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:00:40,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:00:40,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:00:40,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:00:40,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:00:40,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:00:40,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:00:40,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:00:40,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:00:40,077 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:00:40,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:00:40,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:00:40,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:00:40,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:00:40,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:00:40,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:00:40,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:00:40,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:00:40,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:00:40,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:00:40,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:00:40,086 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 14:00:40,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:00:40,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:00:40,101 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:00:40,102 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:00:40,102 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:00:40,102 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:00:40,103 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:00:40,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:00:40,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:00:40,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:00:40,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:00:40,104 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:00:40,104 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:00:40,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:00:40,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:00:40,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:00:40,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:00:40,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:00:40,105 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:00:40,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:00:40,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:00:40,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:00:40,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:00:40,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:00:40,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:00:40,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:00:40,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:00:40,107 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:00:40,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:00:40,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:00:40,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:00:40,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:00:40,174 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:00:40,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label07_false-unreach-call.c [2018-10-24 14:00:40,233 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ed0317ef6/363b3b1865204f34985225f2eebeabb0/FLAG85ac44c54 [2018-10-24 14:00:40,953 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:00:40,954 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label07_false-unreach-call.c [2018-10-24 14:00:40,980 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ed0317ef6/363b3b1865204f34985225f2eebeabb0/FLAG85ac44c54 [2018-10-24 14:00:40,995 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ed0317ef6/363b3b1865204f34985225f2eebeabb0 [2018-10-24 14:00:41,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:00:41,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:00:41,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:00:41,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:00:41,014 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:00:41,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:00:40" (1/1) ... [2018-10-24 14:00:41,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6354d7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:41, skipping insertion in model container [2018-10-24 14:00:41,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:00:40" (1/1) ... [2018-10-24 14:00:41,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:00:41,197 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:00:42,495 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:00:42,500 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:00:43,098 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:00:43,134 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:00:43,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43 WrapperNode [2018-10-24 14:00:43,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:00:43,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:00:43,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:00:43,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:00:43,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... [2018-10-24 14:00:43,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... [2018-10-24 14:00:43,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:00:43,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:00:43,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:00:43,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:00:43,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... [2018-10-24 14:00:43,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... [2018-10-24 14:00:43,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... [2018-10-24 14:00:43,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... [2018-10-24 14:00:43,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... [2018-10-24 14:00:43,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... [2018-10-24 14:00:44,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... [2018-10-24 14:00:44,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:00:44,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:00:44,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:00:44,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:00:44,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:00:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:00:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:00:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:00:52,883 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:00:52,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:00:52 BoogieIcfgContainer [2018-10-24 14:00:52,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:00:52,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:00:52,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:00:52,889 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:00:52,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:00:40" (1/3) ... [2018-10-24 14:00:52,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b8231d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:00:52, skipping insertion in model container [2018-10-24 14:00:52,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:43" (2/3) ... [2018-10-24 14:00:52,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b8231d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:00:52, skipping insertion in model container [2018-10-24 14:00:52,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:00:52" (3/3) ... [2018-10-24 14:00:52,892 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label07_false-unreach-call.c [2018-10-24 14:00:52,902 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:00:52,911 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:00:52,928 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:00:52,972 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:00:52,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:00:52,973 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:00:52,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:00:52,974 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:00:52,974 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:00:52,974 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:00:52,974 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:00:52,974 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:00:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-24 14:00:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-24 14:00:53,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:00:53,024 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:00:53,027 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:00:53,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:00:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984234, now seen corresponding path program 1 times [2018-10-24 14:00:53,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:00:53,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:00:53,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:00:53,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:00:53,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:00:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:00:53,251 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 14:00:53,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:00:53,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:00:53,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:00:53,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:00:53,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:00:53,275 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 3 states. [2018-10-24 14:01:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:01:02,668 INFO L93 Difference]: Finished difference Result 2391 states and 4632 transitions. [2018-10-24 14:01:02,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:01:02,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-24 14:01:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:01:02,713 INFO L225 Difference]: With dead ends: 2391 [2018-10-24 14:01:02,714 INFO L226 Difference]: Without dead ends: 1568 [2018-10-24 14:01:02,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 14:01:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2018-10-24 14:01:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2018-10-24 14:01:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2018-10-24 14:01:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2601 transitions. [2018-10-24 14:01:02,877 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2601 transitions. Word has length 7 [2018-10-24 14:01:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:01:02,878 INFO L481 AbstractCegarLoop]: Abstraction has 1568 states and 2601 transitions. [2018-10-24 14:01:02,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:01:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2601 transitions. [2018-10-24 14:01:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-24 14:01:02,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:01:02,881 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:01:02,881 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:01:02,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:01:02,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1382629178, now seen corresponding path program 1 times [2018-10-24 14:01:02,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:01:02,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:01:02,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:02,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:02,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:03,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:01:03,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:01:03,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:01:03,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:01:03,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:01:03,119 INFO L87 Difference]: Start difference. First operand 1568 states and 2601 transitions. Second operand 3 states. [2018-10-24 14:01:12,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:01:12,309 INFO L93 Difference]: Finished difference Result 4638 states and 7738 transitions. [2018-10-24 14:01:12,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:01:12,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-10-24 14:01:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:01:12,328 INFO L225 Difference]: With dead ends: 4638 [2018-10-24 14:01:12,328 INFO L226 Difference]: Without dead ends: 3072 [2018-10-24 14:01:12,332 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 14:01:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-10-24 14:01:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2018-10-24 14:01:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2018-10-24 14:01:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4785 transitions. [2018-10-24 14:01:12,397 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4785 transitions. Word has length 79 [2018-10-24 14:01:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:01:12,398 INFO L481 AbstractCegarLoop]: Abstraction has 3072 states and 4785 transitions. [2018-10-24 14:01:12,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:01:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4785 transitions. [2018-10-24 14:01:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-24 14:01:12,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:01:12,402 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:01:12,402 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:01:12,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:01:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash 901345351, now seen corresponding path program 1 times [2018-10-24 14:01:12,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:01:12,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:01:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:12,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:12,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:01:12,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:01:12,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:01:12,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:01:12,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:01:12,621 INFO L87 Difference]: Start difference. First operand 3072 states and 4785 transitions. Second operand 4 states. [2018-10-24 14:01:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:01:23,420 INFO L93 Difference]: Finished difference Result 12158 states and 19012 transitions. [2018-10-24 14:01:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:01:23,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-10-24 14:01:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:01:23,471 INFO L225 Difference]: With dead ends: 12158 [2018-10-24 14:01:23,471 INFO L226 Difference]: Without dead ends: 9088 [2018-10-24 14:01:23,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 14:01:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2018-10-24 14:01:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9088. [2018-10-24 14:01:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2018-10-24 14:01:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 12491 transitions. [2018-10-24 14:01:23,633 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 12491 transitions. Word has length 82 [2018-10-24 14:01:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:01:23,634 INFO L481 AbstractCegarLoop]: Abstraction has 9088 states and 12491 transitions. [2018-10-24 14:01:23,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:01:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 12491 transitions. [2018-10-24 14:01:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-24 14:01:23,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:01:23,639 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:01:23,640 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:01:23,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:01:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 808225171, now seen corresponding path program 1 times [2018-10-24 14:01:23,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:01:23,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:01:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:23,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:23,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:01:23,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:01:23,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:01:23,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:01:23,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:01:23,972 INFO L87 Difference]: Start difference. First operand 9088 states and 12491 transitions. Second operand 4 states. [2018-10-24 14:01:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:01:33,481 INFO L93 Difference]: Finished difference Result 35532 states and 48960 transitions. [2018-10-24 14:01:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:01:33,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-10-24 14:01:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:01:33,557 INFO L225 Difference]: With dead ends: 35532 [2018-10-24 14:01:33,558 INFO L226 Difference]: Without dead ends: 26446 [2018-10-24 14:01:33,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:01:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26446 states. [2018-10-24 14:01:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26446 to 18112. [2018-10-24 14:01:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18112 states. [2018-10-24 14:01:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18112 states to 18112 states and 23341 transitions. [2018-10-24 14:01:33,931 INFO L78 Accepts]: Start accepts. Automaton has 18112 states and 23341 transitions. Word has length 89 [2018-10-24 14:01:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:01:33,932 INFO L481 AbstractCegarLoop]: Abstraction has 18112 states and 23341 transitions. [2018-10-24 14:01:33,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:01:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 18112 states and 23341 transitions. [2018-10-24 14:01:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-24 14:01:33,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:01:33,940 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:01:33,941 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:01:33,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:01:33,941 INFO L82 PathProgramCache]: Analyzing trace with hash 395154341, now seen corresponding path program 1 times [2018-10-24 14:01:33,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:01:33,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:01:33,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:33,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:33,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:34,223 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:01:34,823 WARN L179 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-10-24 14:01:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:34,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:01:34,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:01:34,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:01:34,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:01:34,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:01:34,866 INFO L87 Difference]: Start difference. First operand 18112 states and 23341 transitions. Second operand 6 states. [2018-10-24 14:01:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:01:47,185 INFO L93 Difference]: Finished difference Result 39230 states and 49824 transitions. [2018-10-24 14:01:47,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:01:47,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-10-24 14:01:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:01:47,229 INFO L225 Difference]: With dead ends: 39230 [2018-10-24 14:01:47,229 INFO L226 Difference]: Without dead ends: 21120 [2018-10-24 14:01:47,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:01:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21120 states. [2018-10-24 14:01:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21120 to 21120. [2018-10-24 14:01:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21120 states. [2018-10-24 14:01:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21120 states to 21120 states and 25897 transitions. [2018-10-24 14:01:47,514 INFO L78 Accepts]: Start accepts. Automaton has 21120 states and 25897 transitions. Word has length 94 [2018-10-24 14:01:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:01:47,515 INFO L481 AbstractCegarLoop]: Abstraction has 21120 states and 25897 transitions. [2018-10-24 14:01:47,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:01:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 21120 states and 25897 transitions. [2018-10-24 14:01:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-24 14:01:47,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:01:47,518 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:01:47,518 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:01:47,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:01:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1684756667, now seen corresponding path program 1 times [2018-10-24 14:01:47,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:01:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:01:47,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:47,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:47,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:47,951 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-24 14:01:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:48,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:01:48,061 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 14:01:48,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:48,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:01:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:48,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:01:48,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-24 14:01:48,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:01:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:01:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:01:48,571 INFO L87 Difference]: Start difference. First operand 21120 states and 25897 transitions. Second operand 6 states. [2018-10-24 14:02:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:06,262 INFO L93 Difference]: Finished difference Result 65582 states and 79518 transitions. [2018-10-24 14:02:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 14:02:06,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-24 14:02:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:06,329 INFO L225 Difference]: With dead ends: 65582 [2018-10-24 14:02:06,330 INFO L226 Difference]: Without dead ends: 42957 [2018-10-24 14:02:06,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:02:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42957 states. [2018-10-24 14:02:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42957 to 28639. [2018-10-24 14:02:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2018-10-24 14:02:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 32976 transitions. [2018-10-24 14:02:06,864 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 32976 transitions. Word has length 149 [2018-10-24 14:02:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:06,864 INFO L481 AbstractCegarLoop]: Abstraction has 28639 states and 32976 transitions. [2018-10-24 14:02:06,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:02:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 32976 transitions. [2018-10-24 14:02:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-24 14:02:06,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:06,868 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:06,868 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:06,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash -747845316, now seen corresponding path program 1 times [2018-10-24 14:02:06,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:06,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:06,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:06,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:06,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 14:02:07,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:07,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:07,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:02:07,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:02:07,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:02:07,185 INFO L87 Difference]: Start difference. First operand 28639 states and 32976 transitions. Second operand 3 states. [2018-10-24 14:02:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:12,358 INFO L93 Difference]: Finished difference Result 64796 states and 75059 transitions. [2018-10-24 14:02:12,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:02:12,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-10-24 14:02:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:12,406 INFO L225 Difference]: With dead ends: 64796 [2018-10-24 14:02:12,406 INFO L226 Difference]: Without dead ends: 36911 [2018-10-24 14:02:12,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:02:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36911 states. [2018-10-24 14:02:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36911 to 36911. [2018-10-24 14:02:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36911 states. [2018-10-24 14:02:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36911 states to 36911 states and 42306 transitions. [2018-10-24 14:02:13,119 INFO L78 Accepts]: Start accepts. Automaton has 36911 states and 42306 transitions. Word has length 240 [2018-10-24 14:02:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:13,120 INFO L481 AbstractCegarLoop]: Abstraction has 36911 states and 42306 transitions. [2018-10-24 14:02:13,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:02:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 36911 states and 42306 transitions. [2018-10-24 14:02:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-24 14:02:13,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:13,128 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 14:02:13,128 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:13,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1775731377, now seen corresponding path program 1 times [2018-10-24 14:02:13,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:13,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:13,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-24 14:02:13,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:13,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:13,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:02:13,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:02:13,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:02:13,455 INFO L87 Difference]: Start difference. First operand 36911 states and 42306 transitions. Second operand 3 states. [2018-10-24 14:02:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:20,803 INFO L93 Difference]: Finished difference Result 73068 states and 83853 transitions. [2018-10-24 14:02:20,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:02:20,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2018-10-24 14:02:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:20,847 INFO L225 Difference]: With dead ends: 73068 [2018-10-24 14:02:20,847 INFO L226 Difference]: Without dead ends: 36911 [2018-10-24 14:02:20,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:02:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36911 states. [2018-10-24 14:02:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36911 to 36911. [2018-10-24 14:02:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36911 states. [2018-10-24 14:02:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36911 states to 36911 states and 41007 transitions. [2018-10-24 14:02:21,284 INFO L78 Accepts]: Start accepts. Automaton has 36911 states and 41007 transitions. Word has length 309 [2018-10-24 14:02:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:21,285 INFO L481 AbstractCegarLoop]: Abstraction has 36911 states and 41007 transitions. [2018-10-24 14:02:21,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:02:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 36911 states and 41007 transitions. [2018-10-24 14:02:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-24 14:02:21,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:21,292 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:02:21,293 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:21,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1873491081, now seen corresponding path program 1 times [2018-10-24 14:02:21,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:21,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:21,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:21,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:21,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-24 14:02:21,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:21,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:21,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:02:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:02:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:02:21,564 INFO L87 Difference]: Start difference. First operand 36911 states and 41007 transitions. Second operand 3 states. [2018-10-24 14:02:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:27,534 INFO L93 Difference]: Finished difference Result 88108 states and 98582 transitions. [2018-10-24 14:02:27,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:02:27,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-10-24 14:02:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:27,590 INFO L225 Difference]: With dead ends: 88108 [2018-10-24 14:02:27,591 INFO L226 Difference]: Without dead ends: 51951 [2018-10-24 14:02:27,612 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 14:02:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51951 states. [2018-10-24 14:02:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51951 to 51951. [2018-10-24 14:02:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51951 states. [2018-10-24 14:02:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51951 states to 51951 states and 57704 transitions. [2018-10-24 14:02:28,177 INFO L78 Accepts]: Start accepts. Automaton has 51951 states and 57704 transitions. Word has length 337 [2018-10-24 14:02:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:28,178 INFO L481 AbstractCegarLoop]: Abstraction has 51951 states and 57704 transitions. [2018-10-24 14:02:28,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:02:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 51951 states and 57704 transitions. [2018-10-24 14:02:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-24 14:02:28,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:28,191 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:02:28,192 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:28,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:28,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1307002014, now seen corresponding path program 1 times [2018-10-24 14:02:28,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:28,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:28,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:28,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:28,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-24 14:02:28,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:28,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:02:28,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:28,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:28,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:28,733 INFO L87 Difference]: Start difference. First operand 51951 states and 57704 transitions. Second operand 4 states. [2018-10-24 14:02:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:34,929 INFO L93 Difference]: Finished difference Result 103148 states and 114649 transitions. [2018-10-24 14:02:34,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:34,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 397 [2018-10-24 14:02:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:34,979 INFO L225 Difference]: With dead ends: 103148 [2018-10-24 14:02:34,979 INFO L226 Difference]: Without dead ends: 51951 [2018-10-24 14:02:35,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51951 states. [2018-10-24 14:02:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51951 to 51951. [2018-10-24 14:02:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51951 states. [2018-10-24 14:02:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51951 states to 51951 states and 55225 transitions. [2018-10-24 14:02:35,834 INFO L78 Accepts]: Start accepts. Automaton has 51951 states and 55225 transitions. Word has length 397 [2018-10-24 14:02:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:35,835 INFO L481 AbstractCegarLoop]: Abstraction has 51951 states and 55225 transitions. [2018-10-24 14:02:35,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 51951 states and 55225 transitions. [2018-10-24 14:02:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-24 14:02:35,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:35,849 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:02:35,849 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:35,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash 823321056, now seen corresponding path program 1 times [2018-10-24 14:02:35,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:35,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:35,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:35,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:35,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2018-10-24 14:02:36,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:36,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:36,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:02:36,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:02:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:02:36,195 INFO L87 Difference]: Start difference. First operand 51951 states and 55225 transitions. Second operand 3 states. [2018-10-24 14:02:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:40,819 INFO L93 Difference]: Finished difference Result 103896 states and 110566 transitions. [2018-10-24 14:02:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:02:40,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 419 [2018-10-24 14:02:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:40,872 INFO L225 Difference]: With dead ends: 103896 [2018-10-24 14:02:40,872 INFO L226 Difference]: Without dead ends: 52699 [2018-10-24 14:02:40,899 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 14:02:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52699 states. [2018-10-24 14:02:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52699 to 52699. [2018-10-24 14:02:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52699 states. [2018-10-24 14:02:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52699 states to 52699 states and 55214 transitions. [2018-10-24 14:02:41,316 INFO L78 Accepts]: Start accepts. Automaton has 52699 states and 55214 transitions. Word has length 419 [2018-10-24 14:02:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:41,317 INFO L481 AbstractCegarLoop]: Abstraction has 52699 states and 55214 transitions. [2018-10-24 14:02:41,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:02:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52699 states and 55214 transitions. [2018-10-24 14:02:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-24 14:02:41,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:41,344 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:02:41,345 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:41,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:41,345 INFO L82 PathProgramCache]: Analyzing trace with hash -195895467, now seen corresponding path program 1 times [2018-10-24 14:02:41,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:41,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:41,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:41,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:41,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-24 14:02:41,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:41,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:02:41,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:41,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:41,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:41,837 INFO L87 Difference]: Start difference. First operand 52699 states and 55214 transitions. Second operand 4 states. [2018-10-24 14:02:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:46,940 INFO L93 Difference]: Finished difference Result 126452 states and 132690 transitions. [2018-10-24 14:02:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:02:46,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 602 [2018-10-24 14:02:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:47,004 INFO L225 Difference]: With dead ends: 126452 [2018-10-24 14:02:47,004 INFO L226 Difference]: Without dead ends: 74507 [2018-10-24 14:02:47,034 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 14:02:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74507 states. [2018-10-24 14:02:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74507 to 74507. [2018-10-24 14:02:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74507 states. [2018-10-24 14:02:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74507 states to 74507 states and 77979 transitions. [2018-10-24 14:02:47,598 INFO L78 Accepts]: Start accepts. Automaton has 74507 states and 77979 transitions. Word has length 602 [2018-10-24 14:02:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:47,599 INFO L481 AbstractCegarLoop]: Abstraction has 74507 states and 77979 transitions. [2018-10-24 14:02:47,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 74507 states and 77979 transitions. [2018-10-24 14:02:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-10-24 14:02:47,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:47,627 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:02:47,627 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:47,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:47,627 INFO L82 PathProgramCache]: Analyzing trace with hash -998756597, now seen corresponding path program 1 times [2018-10-24 14:02:47,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:47,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:47,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:47,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:47,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-24 14:02:48,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:48,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:02:48,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:48,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:48,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:48,410 INFO L87 Difference]: Start difference. First operand 74507 states and 77979 transitions. Second operand 4 states. [2018-10-24 14:02:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:54,985 INFO L93 Difference]: Finished difference Result 148260 states and 155199 transitions. [2018-10-24 14:02:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:54,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 606 [2018-10-24 14:02:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:55,070 INFO L225 Difference]: With dead ends: 148260 [2018-10-24 14:02:55,070 INFO L226 Difference]: Without dead ends: 72999 [2018-10-24 14:02:55,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72999 states. [2018-10-24 14:02:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72999 to 72247. [2018-10-24 14:02:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72247 states. [2018-10-24 14:02:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72247 states to 72247 states and 75331 transitions. [2018-10-24 14:02:55,666 INFO L78 Accepts]: Start accepts. Automaton has 72247 states and 75331 transitions. Word has length 606 [2018-10-24 14:02:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:55,666 INFO L481 AbstractCegarLoop]: Abstraction has 72247 states and 75331 transitions. [2018-10-24 14:02:55,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 72247 states and 75331 transitions. [2018-10-24 14:02:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-10-24 14:02:55,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:55,689 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:02:55,689 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:55,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:55,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1070355263, now seen corresponding path program 1 times [2018-10-24 14:02:55,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:55,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:55,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:55,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 14:02:56,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:56,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:56,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:02:56,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:02:56,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:02:56,161 INFO L87 Difference]: Start difference. First operand 72247 states and 75331 transitions. Second operand 3 states. [2018-10-24 14:03:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:01,689 INFO L93 Difference]: Finished difference Result 181337 states and 189449 transitions. [2018-10-24 14:03:01,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:03:01,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 635 [2018-10-24 14:03:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:01,798 INFO L225 Difference]: With dead ends: 181337 [2018-10-24 14:03:01,798 INFO L226 Difference]: Without dead ends: 109844 [2018-10-24 14:03:01,831 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 14:03:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109844 states. [2018-10-24 14:03:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109844 to 107588. [2018-10-24 14:03:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107588 states. [2018-10-24 14:03:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107588 states to 107588 states and 111511 transitions. [2018-10-24 14:03:02,569 INFO L78 Accepts]: Start accepts. Automaton has 107588 states and 111511 transitions. Word has length 635 [2018-10-24 14:03:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:02,570 INFO L481 AbstractCegarLoop]: Abstraction has 107588 states and 111511 transitions. [2018-10-24 14:03:02,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:03:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 107588 states and 111511 transitions. [2018-10-24 14:03:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-24 14:03:02,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:02,589 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:03:02,589 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:02,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash -301306774, now seen corresponding path program 1 times [2018-10-24 14:03:02,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:02,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:02,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:03,176 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:03:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-10-24 14:03:03,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:03:03,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:03:03,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:03:03,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:03:03,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:03:03,448 INFO L87 Difference]: Start difference. First operand 107588 states and 111511 transitions. Second operand 6 states. [2018-10-24 14:03:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:11,532 INFO L93 Difference]: Finished difference Result 214979 states and 222820 transitions. [2018-10-24 14:03:11,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:03:11,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 672 [2018-10-24 14:03:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:11,617 INFO L225 Difference]: With dead ends: 214979 [2018-10-24 14:03:11,617 INFO L226 Difference]: Without dead ends: 93833 [2018-10-24 14:03:11,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:03:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93833 states. [2018-10-24 14:03:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93833 to 89516. [2018-10-24 14:03:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89516 states. [2018-10-24 14:03:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89516 states to 89516 states and 91810 transitions. [2018-10-24 14:03:12,365 INFO L78 Accepts]: Start accepts. Automaton has 89516 states and 91810 transitions. Word has length 672 [2018-10-24 14:03:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:12,365 INFO L481 AbstractCegarLoop]: Abstraction has 89516 states and 91810 transitions. [2018-10-24 14:03:12,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:03:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 89516 states and 91810 transitions. [2018-10-24 14:03:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-24 14:03:12,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:12,380 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:03:12,380 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:12,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:12,380 INFO L82 PathProgramCache]: Analyzing trace with hash 625184252, now seen corresponding path program 1 times [2018-10-24 14:03:12,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:12,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:12,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:12,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:12,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 26 proven. 634 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-24 14:03:14,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:03:14,144 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 14:03:14,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:14,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:03:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-10-24 14:03:14,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:03:14,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-10-24 14:03:14,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 14:03:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 14:03:14,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:03:14,843 INFO L87 Difference]: Start difference. First operand 89516 states and 91810 transitions. Second operand 9 states. [2018-10-24 14:03:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:44,788 INFO L93 Difference]: Finished difference Result 197079 states and 202146 transitions. [2018-10-24 14:03:44,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 14:03:44,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 689 [2018-10-24 14:03:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:44,909 INFO L225 Difference]: With dead ends: 197079 [2018-10-24 14:03:44,909 INFO L226 Difference]: Without dead ends: 100787 [2018-10-24 14:03:44,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 696 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-10-24 14:03:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100787 states. [2018-10-24 14:03:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100787 to 81987. [2018-10-24 14:03:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81987 states. [2018-10-24 14:03:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81987 states to 81987 states and 84103 transitions. [2018-10-24 14:03:46,130 INFO L78 Accepts]: Start accepts. Automaton has 81987 states and 84103 transitions. Word has length 689 [2018-10-24 14:03:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:46,131 INFO L481 AbstractCegarLoop]: Abstraction has 81987 states and 84103 transitions. [2018-10-24 14:03:46,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 14:03:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 81987 states and 84103 transitions. [2018-10-24 14:03:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2018-10-24 14:03:46,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:46,153 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:03:46,153 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:46,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:46,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1460066374, now seen corresponding path program 1 times [2018-10-24 14:03:46,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:46,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:46,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:46,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:46,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:47,056 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-10-24 14:03:47,410 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-24 14:03:48,053 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-10-24 14:03:48,297 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-24 14:03:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 150 proven. 591 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-24 14:03:49,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:03:49,701 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 14:03:49,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:49,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:03:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-10-24 14:03:50,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:03:50,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 14:03:50,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 14:03:50,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 14:03:50,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:03:50,299 INFO L87 Difference]: Start difference. First operand 81987 states and 84103 transitions. Second operand 11 states. [2018-10-24 14:04:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:04:21,598 INFO L93 Difference]: Finished difference Result 202348 states and 207694 transitions. [2018-10-24 14:04:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 14:04:21,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 728 [2018-10-24 14:04:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:04:21,720 INFO L225 Difference]: With dead ends: 202348 [2018-10-24 14:04:21,720 INFO L226 Difference]: Without dead ends: 118102 [2018-10-24 14:04:21,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-10-24 14:04:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118102 states. [2018-10-24 14:04:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118102 to 79727. [2018-10-24 14:04:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79727 states. [2018-10-24 14:04:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79727 states to 79727 states and 81538 transitions. [2018-10-24 14:04:22,483 INFO L78 Accepts]: Start accepts. Automaton has 79727 states and 81538 transitions. Word has length 728 [2018-10-24 14:04:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:04:22,483 INFO L481 AbstractCegarLoop]: Abstraction has 79727 states and 81538 transitions. [2018-10-24 14:04:22,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 14:04:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 79727 states and 81538 transitions. [2018-10-24 14:04:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-24 14:04:22,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:04:22,825 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:04:22,825 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:04:22,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:04:22,826 INFO L82 PathProgramCache]: Analyzing trace with hash 429350737, now seen corresponding path program 1 times [2018-10-24 14:04:22,826 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:04:22,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:04:22,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:22,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:04:22,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:04:23,507 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:04:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-24 14:04:23,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:04:23,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:04:23,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:04:23,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:04:23,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:04:23,902 INFO L87 Difference]: Start difference. First operand 79727 states and 81538 transitions. Second operand 4 states. [2018-10-24 14:04:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:04:31,373 INFO L93 Difference]: Finished difference Result 163212 states and 166913 transitions. [2018-10-24 14:04:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:04:31,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 739 [2018-10-24 14:04:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:04:31,462 INFO L225 Difference]: With dead ends: 163212 [2018-10-24 14:04:31,462 INFO L226 Difference]: Without dead ends: 84239 [2018-10-24 14:04:31,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:04:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84239 states. [2018-10-24 14:04:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84239 to 78975. [2018-10-24 14:04:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78975 states. [2018-10-24 14:04:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78975 states to 78975 states and 80749 transitions. [2018-10-24 14:04:32,473 INFO L78 Accepts]: Start accepts. Automaton has 78975 states and 80749 transitions. Word has length 739 [2018-10-24 14:04:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:04:32,473 INFO L481 AbstractCegarLoop]: Abstraction has 78975 states and 80749 transitions. [2018-10-24 14:04:32,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:04:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 78975 states and 80749 transitions. [2018-10-24 14:04:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-10-24 14:04:32,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:04:32,491 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:32,491 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:04:32,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:04:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash -394278024, now seen corresponding path program 1 times [2018-10-24 14:04:32,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:04:32,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:04:32,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:32,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:04:32,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:04:33,132 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 Received shutdown request... [2018-10-24 14:04:33,607 WARN L187 SmtUtils]: Removed 1 from assertion stack [2018-10-24 14:04:33,608 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:04:33,613 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:04:33,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:04:33 BoogieIcfgContainer [2018-10-24 14:04:33,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:04:33,614 INFO L168 Benchmark]: Toolchain (without parser) took 232606.97 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-24 14:04:33,615 INFO L168 Benchmark]: CDTParser took 0.23 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 14:04:33,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2125.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:33,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 626.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -969.0 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:33,617 INFO L168 Benchmark]: Boogie Preprocessor took 314.87 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: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:33,618 INFO L168 Benchmark]: RCFGBuilder took 8807.23 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 234.4 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -202.9 MB). Peak memory consumption was 641.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:33,620 INFO L168 Benchmark]: TraceAbstraction took 220728.10 ms. Allocated memory was 2.5 GB in the beginning and 3.8 GB in the end (delta: 1.3 GB). Free memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: -286.1 MB). Peak memory consumption was 979.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:33,628 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.23 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 2125.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 626.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -969.0 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 314.87 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: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8807.23 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 234.4 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -202.9 MB). Peak memory consumption was 641.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220728.10 ms. Allocated memory was 2.5 GB in the beginning and 3.8 GB in the end (delta: 1.3 GB). Free memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: -286.1 MB). Peak memory consumption was 979.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 774 with TraceHistMax 6,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 21. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 220.6s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 193.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13958 SDtfs, 56782 SDslu, 1553 SDs, 0 SdLazy, 99005 SolverSat, 13742 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 158.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1704 GetRequests, 1614 SyntacticMatches, 19 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107588occurred in iteration=14, 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: 9.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 92416 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 8439 NumberOfCodeBlocks, 8439 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 8418 ConstructedInterpolants, 0 QuantifiedInterpolants, 17367567 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 7375/8605 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown