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/Problem03_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:57:13,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:57:13,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:57:14,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:57:14,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:57:14,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:57:14,013 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:57:14,016 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:57:14,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:57:14,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:57:14,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:57:14,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:57:14,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:57:14,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:57:14,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:57:14,026 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:57:14,027 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:57:14,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:57:14,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:57:14,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:57:14,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:57:14,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:57:14,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:57:14,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:57:14,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:57:14,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:57:14,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:57:14,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:57:14,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:57:14,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:57:14,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:57:14,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:57:14,056 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:57:14,056 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:57:14,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:57:14,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:57:14,058 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:57:14,091 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:57:14,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:57:14,093 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:57:14,093 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:57:14,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:57:14,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:57:14,094 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:57:14,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:57:14,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:57:14,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:57:14,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:57:14,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:57:14,097 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:57:14,097 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:57:14,097 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:57:14,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:57:14,098 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:57:14,098 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:57:14,098 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:57:14,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:57:14,098 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:57:14,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:57:14,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:57:14,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:57:14,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:57:14,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:57:14,101 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:57:14,101 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:57:14,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:57:14,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:57:14,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:57:14,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:57:14,188 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:57:14,189 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label23_true-unreach-call.c [2018-10-24 14:57:14,257 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d43a251f5/335c32b039ce49ae967b439d9bcc1ca2/FLAGcb67b4912 [2018-10-24 14:57:14,915 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:57:14,916 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label23_true-unreach-call.c [2018-10-24 14:57:14,933 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d43a251f5/335c32b039ce49ae967b439d9bcc1ca2/FLAGcb67b4912 [2018-10-24 14:57:14,948 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d43a251f5/335c32b039ce49ae967b439d9bcc1ca2 [2018-10-24 14:57:14,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:57:14,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:57:14,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:14,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:57:14,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:57:14,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:14" (1/1) ... [2018-10-24 14:57:14,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6a7e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:14, skipping insertion in model container [2018-10-24 14:57:14,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:14" (1/1) ... [2018-10-24 14:57:14,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:57:15,069 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:57:15,758 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:15,764 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:57:15,987 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:16,008 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:57:16,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16 WrapperNode [2018-10-24 14:57:16,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:16,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:16,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:57:16,010 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:57:16,019 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:57:16" (1/1) ... [2018-10-24 14:57:16,054 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:57:16" (1/1) ... [2018-10-24 14:57:16,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:16,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:57:16,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:57:16,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:57:16,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (1/1) ... [2018-10-24 14:57:16,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (1/1) ... [2018-10-24 14:57:16,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (1/1) ... [2018-10-24 14:57:16,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (1/1) ... [2018-10-24 14:57:16,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (1/1) ... [2018-10-24 14:57:16,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (1/1) ... [2018-10-24 14:57:16,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (1/1) ... [2018-10-24 14:57:16,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:57:16,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:57:16,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:57:16,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:57:16,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (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:57:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:57:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:57:16,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:57:22,142 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:57:22,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:22 BoogieIcfgContainer [2018-10-24 14:57:22,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:57:22,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:57:22,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:57:22,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:57:22,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:57:14" (1/3) ... [2018-10-24 14:57:22,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df51438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:22, skipping insertion in model container [2018-10-24 14:57:22,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (2/3) ... [2018-10-24 14:57:22,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df51438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:22, skipping insertion in model container [2018-10-24 14:57:22,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:22" (3/3) ... [2018-10-24 14:57:22,153 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label23_true-unreach-call.c [2018-10-24 14:57:22,163 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:57:22,172 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:57:22,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:57:22,228 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:57:22,229 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:57:22,229 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:57:22,230 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:57:22,230 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:57:22,230 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:57:22,230 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:57:22,230 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:57:22,230 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:57:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:57:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 14:57:22,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:22,275 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:22,277 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:22,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:22,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1121877156, now seen corresponding path program 1 times [2018-10-24 14:57:22,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:22,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:22,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:22,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:23,341 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:57:23,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:23,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:23,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:23,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:23,371 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:57:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:26,599 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-10-24 14:57:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:26,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-10-24 14:57:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:26,637 INFO L225 Difference]: With dead ends: 1079 [2018-10-24 14:57:26,638 INFO L226 Difference]: Without dead ends: 769 [2018-10-24 14:57:26,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-24 14:57:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-10-24 14:57:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-24 14:57:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-10-24 14:57:26,732 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 172 [2018-10-24 14:57:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:26,733 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-10-24 14:57:26,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-10-24 14:57:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-24 14:57:26,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:26,740 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:26,740 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:26,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:26,741 INFO L82 PathProgramCache]: Analyzing trace with hash -413316829, now seen corresponding path program 1 times [2018-10-24 14:57:26,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:26,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:26,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:26,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:26,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:26,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:26,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:26,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:26,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:26,877 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-10-24 14:57:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:29,002 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-10-24 14:57:29,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:29,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-10-24 14:57:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:29,008 INFO L225 Difference]: With dead ends: 1449 [2018-10-24 14:57:29,008 INFO L226 Difference]: Without dead ends: 938 [2018-10-24 14:57:29,012 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:57:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-24 14:57:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-10-24 14:57:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 14:57:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 14:57:29,066 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 181 [2018-10-24 14:57:29,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:29,067 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 14:57:29,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 14:57:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-24 14:57:29,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:29,076 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:29,076 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:29,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:29,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1137369717, now seen corresponding path program 1 times [2018-10-24 14:57:29,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:29,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:29,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:29,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:29,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:29,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:29,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:29,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:29,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:29,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:29,226 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 4 states. [2018-10-24 14:57:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:33,496 INFO L93 Difference]: Finished difference Result 3530 states and 5871 transitions. [2018-10-24 14:57:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:33,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-10-24 14:57:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:33,510 INFO L225 Difference]: With dead ends: 3530 [2018-10-24 14:57:33,511 INFO L226 Difference]: Without dead ends: 2609 [2018-10-24 14:57:33,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2018-10-24 14:57:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1750. [2018-10-24 14:57:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-24 14:57:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2700 transitions. [2018-10-24 14:57:33,562 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2700 transitions. Word has length 182 [2018-10-24 14:57:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:33,563 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 2700 transitions. [2018-10-24 14:57:33,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2700 transitions. [2018-10-24 14:57:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 14:57:33,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:33,568 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:33,568 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:33,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1234356994, now seen corresponding path program 1 times [2018-10-24 14:57:33,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:33,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:33,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:33,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:33,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:33,670 INFO L87 Difference]: Start difference. First operand 1750 states and 2700 transitions. Second operand 3 states. [2018-10-24 14:57:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:35,011 INFO L93 Difference]: Finished difference Result 4327 states and 6643 transitions. [2018-10-24 14:57:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:35,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-24 14:57:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:35,025 INFO L225 Difference]: With dead ends: 4327 [2018-10-24 14:57:35,026 INFO L226 Difference]: Without dead ends: 2579 [2018-10-24 14:57:35,029 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:57:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2018-10-24 14:57:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2578. [2018-10-24 14:57:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2018-10-24 14:57:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3889 transitions. [2018-10-24 14:57:35,135 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3889 transitions. Word has length 183 [2018-10-24 14:57:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:35,136 INFO L481 AbstractCegarLoop]: Abstraction has 2578 states and 3889 transitions. [2018-10-24 14:57:35,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3889 transitions. [2018-10-24 14:57:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-24 14:57:35,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:35,143 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:35,143 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:35,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2013561591, now seen corresponding path program 1 times [2018-10-24 14:57:35,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:35,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:35,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:35,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:35,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:35,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:35,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:35,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:35,387 INFO L87 Difference]: Start difference. First operand 2578 states and 3889 transitions. Second operand 3 states. [2018-10-24 14:57:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:38,155 INFO L93 Difference]: Finished difference Result 7609 states and 11523 transitions. [2018-10-24 14:57:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:38,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-24 14:57:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:38,178 INFO L225 Difference]: With dead ends: 7609 [2018-10-24 14:57:38,178 INFO L226 Difference]: Without dead ends: 5033 [2018-10-24 14:57:38,183 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:57:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2018-10-24 14:57:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 5032. [2018-10-24 14:57:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5032 states. [2018-10-24 14:57:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 7054 transitions. [2018-10-24 14:57:38,277 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 7054 transitions. Word has length 189 [2018-10-24 14:57:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:38,278 INFO L481 AbstractCegarLoop]: Abstraction has 5032 states and 7054 transitions. [2018-10-24 14:57:38,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 7054 transitions. [2018-10-24 14:57:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-24 14:57:38,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:38,288 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:38,288 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:38,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1171437102, now seen corresponding path program 1 times [2018-10-24 14:57:38,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:38,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:38,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:38,763 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 14:57:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:38,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:57:38,918 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:57:38,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:39,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:57:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:39,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:57:39,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:57:39,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:57:39,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:57:39,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:57:39,211 INFO L87 Difference]: Start difference. First operand 5032 states and 7054 transitions. Second operand 8 states. [2018-10-24 14:57:39,906 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:57:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:48,139 INFO L93 Difference]: Finished difference Result 23767 states and 33478 transitions. [2018-10-24 14:57:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 14:57:48,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2018-10-24 14:57:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:48,213 INFO L225 Difference]: With dead ends: 23767 [2018-10-24 14:57:48,213 INFO L226 Difference]: Without dead ends: 18737 [2018-10-24 14:57:48,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-24 14:57:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2018-10-24 14:57:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 18319. [2018-10-24 14:57:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2018-10-24 14:57:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 22199 transitions. [2018-10-24 14:57:48,599 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 22199 transitions. Word has length 191 [2018-10-24 14:57:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:48,600 INFO L481 AbstractCegarLoop]: Abstraction has 18319 states and 22199 transitions. [2018-10-24 14:57:48,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:57:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 22199 transitions. [2018-10-24 14:57:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 14:57:48,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:48,624 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:48,624 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:48,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1288004966, now seen corresponding path program 1 times [2018-10-24 14:57:48,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:48,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:48,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:48,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:48,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:48,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:48,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:48,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:48,991 INFO L87 Difference]: Start difference. First operand 18319 states and 22199 transitions. Second operand 4 states. [2018-10-24 14:57:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:53,029 INFO L93 Difference]: Finished difference Result 69914 states and 84761 transitions. [2018-10-24 14:57:53,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:53,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2018-10-24 14:57:53,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:53,153 INFO L225 Difference]: With dead ends: 69914 [2018-10-24 14:57:53,153 INFO L226 Difference]: Without dead ends: 51597 [2018-10-24 14:57:53,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51597 states. [2018-10-24 14:57:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51597 to 51593. [2018-10-24 14:57:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51593 states. [2018-10-24 14:57:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51593 states to 51593 states and 61917 transitions. [2018-10-24 14:57:54,117 INFO L78 Accepts]: Start accepts. Automaton has 51593 states and 61917 transitions. Word has length 202 [2018-10-24 14:57:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:54,117 INFO L481 AbstractCegarLoop]: Abstraction has 51593 states and 61917 transitions. [2018-10-24 14:57:54,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 51593 states and 61917 transitions. [2018-10-24 14:57:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-24 14:57:54,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:54,143 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:54,143 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:54,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:54,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1291616846, now seen corresponding path program 1 times [2018-10-24 14:57:54,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:54,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:54,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:54,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:54,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:54,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:54,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:54,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:54,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:54,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:54,307 INFO L87 Difference]: Start difference. First operand 51593 states and 61917 transitions. Second operand 3 states. [2018-10-24 14:57:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:57,041 INFO L93 Difference]: Finished difference Result 100125 states and 120354 transitions. [2018-10-24 14:57:57,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:57,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-24 14:57:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:57,147 INFO L225 Difference]: With dead ends: 100125 [2018-10-24 14:57:57,148 INFO L226 Difference]: Without dead ends: 48534 [2018-10-24 14:57:57,209 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:57:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48534 states. [2018-10-24 14:57:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48534 to 45669. [2018-10-24 14:57:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45669 states. [2018-10-24 14:57:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45669 states to 45669 states and 52629 transitions. [2018-10-24 14:57:57,915 INFO L78 Accepts]: Start accepts. Automaton has 45669 states and 52629 transitions. Word has length 220 [2018-10-24 14:57:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:57,915 INFO L481 AbstractCegarLoop]: Abstraction has 45669 states and 52629 transitions. [2018-10-24 14:57:57,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 45669 states and 52629 transitions. [2018-10-24 14:57:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-24 14:57:57,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:57,940 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:57,941 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:57,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1278323586, now seen corresponding path program 1 times [2018-10-24 14:57:57,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:57,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:57,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:57,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:57,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-24 14:57:58,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:58,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:57:58,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:57:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:57:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:58,598 INFO L87 Difference]: Start difference. First operand 45669 states and 52629 transitions. Second operand 5 states. [2018-10-24 14:58:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:01,342 INFO L93 Difference]: Finished difference Result 128651 states and 148966 transitions. [2018-10-24 14:58:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:58:01,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-10-24 14:58:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:01,468 INFO L225 Difference]: With dead ends: 128651 [2018-10-24 14:58:01,468 INFO L226 Difference]: Without dead ends: 82984 [2018-10-24 14:58:01,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82984 states. [2018-10-24 14:58:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82984 to 77555. [2018-10-24 14:58:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77555 states. [2018-10-24 14:58:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77555 states to 77555 states and 89310 transitions. [2018-10-24 14:58:02,483 INFO L78 Accepts]: Start accepts. Automaton has 77555 states and 89310 transitions. Word has length 223 [2018-10-24 14:58:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:02,483 INFO L481 AbstractCegarLoop]: Abstraction has 77555 states and 89310 transitions. [2018-10-24 14:58:02,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:58:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 77555 states and 89310 transitions. [2018-10-24 14:58:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-24 14:58:02,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:02,510 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:02,510 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:02,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:02,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1252765123, now seen corresponding path program 1 times [2018-10-24 14:58:02,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:02,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:02,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-24 14:58:03,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:03,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:03,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:03,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:03,184 INFO L87 Difference]: Start difference. First operand 77555 states and 89310 transitions. Second operand 4 states. [2018-10-24 14:58:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:05,664 INFO L93 Difference]: Finished difference Result 238671 states and 274476 transitions. [2018-10-24 14:58:05,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:05,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-10-24 14:58:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:05,884 INFO L225 Difference]: With dead ends: 238671 [2018-10-24 14:58:05,884 INFO L226 Difference]: Without dead ends: 161118 [2018-10-24 14:58:05,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161118 states. [2018-10-24 14:58:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161118 to 161108. [2018-10-24 14:58:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161108 states. [2018-10-24 14:58:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161108 states to 161108 states and 182897 transitions. [2018-10-24 14:58:08,897 INFO L78 Accepts]: Start accepts. Automaton has 161108 states and 182897 transitions. Word has length 258 [2018-10-24 14:58:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:08,898 INFO L481 AbstractCegarLoop]: Abstraction has 161108 states and 182897 transitions. [2018-10-24 14:58:08,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 161108 states and 182897 transitions. [2018-10-24 14:58:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-24 14:58:08,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:08,925 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:58:08,925 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:08,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash -702254135, now seen corresponding path program 1 times [2018-10-24 14:58:08,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:08,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:08,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 93 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-24 14:58:09,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:09,189 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:58:09,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:09,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-24 14:58:09,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:09,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:58:09,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:58:09,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:58:09,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:58:09,477 INFO L87 Difference]: Start difference. First operand 161108 states and 182897 transitions. Second operand 7 states. [2018-10-24 14:58:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:18,337 INFO L93 Difference]: Finished difference Result 567106 states and 642380 transitions. [2018-10-24 14:58:18,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 14:58:18,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 281 [2018-10-24 14:58:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:18,938 INFO L225 Difference]: With dead ends: 567106 [2018-10-24 14:58:18,938 INFO L226 Difference]: Without dead ends: 405997 [2018-10-24 14:58:19,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:58:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405997 states. [2018-10-24 14:58:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405997 to 386518. [2018-10-24 14:58:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386518 states. [2018-10-24 14:58:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386518 states to 386518 states and 432524 transitions. [2018-10-24 14:58:24,345 INFO L78 Accepts]: Start accepts. Automaton has 386518 states and 432524 transitions. Word has length 281 [2018-10-24 14:58:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:24,345 INFO L481 AbstractCegarLoop]: Abstraction has 386518 states and 432524 transitions. [2018-10-24 14:58:24,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:58:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 386518 states and 432524 transitions. [2018-10-24 14:58:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-24 14:58:24,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:24,359 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:58:24,359 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:24,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1506012389, now seen corresponding path program 1 times [2018-10-24 14:58:24,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:24,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:24,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:24,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:24,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-24 14:58:24,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:24,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:24,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:24,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:24,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:24,734 INFO L87 Difference]: Start difference. First operand 386518 states and 432524 transitions. Second operand 4 states. [2018-10-24 14:58:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:37,629 INFO L93 Difference]: Finished difference Result 1116454 states and 1241555 transitions. [2018-10-24 14:58:37,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:37,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 293 [2018-10-24 14:58:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:38,696 INFO L225 Difference]: With dead ends: 1116454 [2018-10-24 14:58:38,696 INFO L226 Difference]: Without dead ends: 729938 [2018-10-24 14:58:38,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729938 states. [2018-10-24 14:58:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729938 to 573081. [2018-10-24 14:58:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573081 states. [2018-10-24 14:58:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573081 states to 573081 states and 632488 transitions. [2018-10-24 14:58:49,055 INFO L78 Accepts]: Start accepts. Automaton has 573081 states and 632488 transitions. Word has length 293 [2018-10-24 14:58:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:49,055 INFO L481 AbstractCegarLoop]: Abstraction has 573081 states and 632488 transitions. [2018-10-24 14:58:49,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 573081 states and 632488 transitions. [2018-10-24 14:58:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-24 14:58:49,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:49,070 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:58:49,071 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:49,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash -96945716, now seen corresponding path program 1 times [2018-10-24 14:58:49,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:49,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:49,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-24 14:58:49,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:49,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:58:49,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:49,278 INFO L87 Difference]: Start difference. First operand 573081 states and 632488 transitions. Second operand 3 states. [2018-10-24 14:59:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:04,694 INFO L93 Difference]: Finished difference Result 1146130 states and 1264944 transitions. [2018-10-24 14:59:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:04,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-10-24 14:59:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:05,457 INFO L225 Difference]: With dead ends: 1146130 [2018-10-24 14:59:05,458 INFO L226 Difference]: Without dead ends: 573051 [2018-10-24 14:59:05,644 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:59:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573051 states. [2018-10-24 14:59:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573051 to 573051. [2018-10-24 14:59:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573051 states. [2018-10-24 14:59:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573051 states to 573051 states and 632408 transitions. [2018-10-24 14:59:13,692 INFO L78 Accepts]: Start accepts. Automaton has 573051 states and 632408 transitions. Word has length 314 [2018-10-24 14:59:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:13,692 INFO L481 AbstractCegarLoop]: Abstraction has 573051 states and 632408 transitions. [2018-10-24 14:59:13,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 573051 states and 632408 transitions. [2018-10-24 14:59:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-24 14:59:13,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:15,045 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:15,045 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:15,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:15,045 INFO L82 PathProgramCache]: Analyzing trace with hash 970070550, now seen corresponding path program 1 times [2018-10-24 14:59:15,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:15,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:15,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:59:15,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:15,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:15,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:15,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:15,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:15,333 INFO L87 Difference]: Start difference. First operand 573051 states and 632408 transitions. Second operand 4 states. [2018-10-24 14:59:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:21,958 INFO L93 Difference]: Finished difference Result 1107749 states and 1220063 transitions. [2018-10-24 14:59:21,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:21,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-10-24 14:59:21,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:22,633 INFO L225 Difference]: With dead ends: 1107749 [2018-10-24 14:59:22,633 INFO L226 Difference]: Without dead ends: 534700 [2018-10-24 14:59:22,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534700 states. [2018-10-24 14:59:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534700 to 427835. [2018-10-24 14:59:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427835 states. [2018-10-24 14:59:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427835 states to 427835 states and 467700 transitions. [2018-10-24 14:59:31,204 INFO L78 Accepts]: Start accepts. Automaton has 427835 states and 467700 transitions. Word has length 315 [2018-10-24 14:59:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:31,205 INFO L481 AbstractCegarLoop]: Abstraction has 427835 states and 467700 transitions. [2018-10-24 14:59:31,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 427835 states and 467700 transitions. [2018-10-24 14:59:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-24 14:59:31,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:31,223 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:59:31,223 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:31,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 615754466, now seen corresponding path program 1 times [2018-10-24 14:59:31,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:31,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:31,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:31,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:31,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-24 14:59:31,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:31,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:31,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:31,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:31,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:31,578 INFO L87 Difference]: Start difference. First operand 427835 states and 467700 transitions. Second operand 4 states. [2018-10-24 14:59:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:40,767 INFO L93 Difference]: Finished difference Result 866138 states and 947465 transitions. [2018-10-24 14:59:40,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:40,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2018-10-24 14:59:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:41,316 INFO L225 Difference]: With dead ends: 866138 [2018-10-24 14:59:41,317 INFO L226 Difference]: Without dead ends: 438305 [2018-10-24 14:59:41,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438305 states. [2018-10-24 14:59:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438305 to 437225. [2018-10-24 14:59:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437225 states. [2018-10-24 14:59:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437225 states to 437225 states and 474630 transitions. [2018-10-24 14:59:47,439 INFO L78 Accepts]: Start accepts. Automaton has 437225 states and 474630 transitions. Word has length 330 [2018-10-24 14:59:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:47,439 INFO L481 AbstractCegarLoop]: Abstraction has 437225 states and 474630 transitions. [2018-10-24 14:59:47,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 437225 states and 474630 transitions. [2018-10-24 14:59:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-24 14:59:47,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:47,456 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:47,456 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:47,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash -849692513, now seen corresponding path program 1 times [2018-10-24 14:59:47,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:47,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:47,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 176 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:47,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:59:47,859 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:59:49,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:49,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:59:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:59:49,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:59:49,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:59:49,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:59:49,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:59:49,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:59:49,312 INFO L87 Difference]: Start difference. First operand 437225 states and 474630 transitions. Second operand 7 states. [2018-10-24 14:59:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:59,119 INFO L93 Difference]: Finished difference Result 897778 states and 974894 transitions. [2018-10-24 14:59:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 14:59:59,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 332 [2018-10-24 14:59:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:59,863 INFO L225 Difference]: With dead ends: 897778 [2018-10-24 14:59:59,863 INFO L226 Difference]: Without dead ends: 460555 [2018-10-24 15:00:00,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-10-24 15:00:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460555 states. [2018-10-24 15:00:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460555 to 446001. [2018-10-24 15:00:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446001 states. [2018-10-24 15:00:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446001 states to 446001 states and 481273 transitions. [2018-10-24 15:00:08,159 INFO L78 Accepts]: Start accepts. Automaton has 446001 states and 481273 transitions. Word has length 332 [2018-10-24 15:00:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:08,160 INFO L481 AbstractCegarLoop]: Abstraction has 446001 states and 481273 transitions. [2018-10-24 15:00:08,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 15:00:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 446001 states and 481273 transitions. [2018-10-24 15:00:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-24 15:00:08,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:08,173 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:00:08,174 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:08,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1613952301, now seen corresponding path program 1 times [2018-10-24 15:00:08,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:08,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:08,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 15:00:09,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:09,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:09,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:09,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:09,787 INFO L87 Difference]: Start difference. First operand 446001 states and 481273 transitions. Second operand 3 states. [2018-10-24 15:00:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:21,349 INFO L93 Difference]: Finished difference Result 1267610 states and 1367052 transitions. [2018-10-24 15:00:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:21,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-10-24 15:00:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:22,441 INFO L225 Difference]: With dead ends: 1267610 [2018-10-24 15:00:22,441 INFO L226 Difference]: Without dead ends: 821611 [2018-10-24 15:00:22,682 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 15:00:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821611 states. [2018-10-24 15:00:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821611 to 821609. [2018-10-24 15:00:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821609 states. [2018-10-24 15:00:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821609 states to 821609 states and 883241 transitions. [2018-10-24 15:00:36,354 INFO L78 Accepts]: Start accepts. Automaton has 821609 states and 883241 transitions. Word has length 337 [2018-10-24 15:00:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:36,355 INFO L481 AbstractCegarLoop]: Abstraction has 821609 states and 883241 transitions. [2018-10-24 15:00:36,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 821609 states and 883241 transitions. [2018-10-24 15:00:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-24 15:00:36,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:36,393 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:00:36,394 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:36,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1263247419, now seen corresponding path program 1 times [2018-10-24 15:00:36,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:36,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:36,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:36,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:36,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:36,883 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 15:00:37,081 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 15:00:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-24 15:00:37,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:37,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 15:00:37,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:00:37,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:00:37,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:00:37,238 INFO L87 Difference]: Start difference. First operand 821609 states and 883241 transitions. Second operand 5 states. Received shutdown request... [2018-10-24 15:00:37,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:37,955 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:00:37,960 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:00:37,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:00:37 BoogieIcfgContainer [2018-10-24 15:00:37,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:00:37,962 INFO L168 Benchmark]: Toolchain (without parser) took 203001.60 ms. Allocated memory was 1.5 GB in the beginning and 5.8 GB in the end (delta: 4.3 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -842.0 MB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:37,963 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:00:37,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1046.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:37,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 288.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -878.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:37,965 INFO L168 Benchmark]: Boogie Preprocessor took 138.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:37,966 INFO L168 Benchmark]: RCFGBuilder took 5705.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 257.8 MB). Peak memory consumption was 257.8 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:37,967 INFO L168 Benchmark]: TraceAbstraction took 195817.06 ms. Allocated memory was 2.3 GB in the beginning and 5.8 GB in the end (delta: 3.5 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -319.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:37,972 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1046.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 288.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -878.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5705.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 257.8 MB). Peak memory consumption was 257.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195817.06 ms. Allocated memory was 2.3 GB in the beginning and 5.8 GB in the end (delta: 3.5 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -319.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1548]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1548). Cancelled while BasicCegarLoop was constructing difference of abstraction (821609states) and FLOYD_HOARE automaton (currently 4 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (329 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 195.7s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 117.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4610 SDtfs, 20745 SDslu, 3574 SDs, 0 SdLazy, 22324 SolverSat, 6044 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 886 GetRequests, 825 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=821609occurred in iteration=17, 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: 65.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 308695 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 5412 NumberOfCodeBlocks, 5412 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5391 ConstructedInterpolants, 0 QuantifiedInterpolants, 2791714 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1460 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 2597/2613 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown