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_label41_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 15:00:19,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 15:00:19,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 15:00:19,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 15:00:19,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 15:00:19,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 15:00:19,199 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 15:00:19,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 15:00:19,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 15:00:19,204 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 15:00:19,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 15:00:19,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 15:00:19,206 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 15:00:19,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 15:00:19,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 15:00:19,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 15:00:19,210 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 15:00:19,212 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 15:00:19,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 15:00:19,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 15:00:19,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 15:00:19,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 15:00:19,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 15:00:19,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 15:00:19,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 15:00:19,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 15:00:19,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 15:00:19,224 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 15:00:19,225 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 15:00:19,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 15:00:19,227 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 15:00:19,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 15:00:19,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 15:00:19,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 15:00:19,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 15:00:19,230 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 15:00:19,230 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 15:00:19,246 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 15:00:19,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 15:00:19,247 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 15:00:19,247 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 15:00:19,248 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 15:00:19,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 15:00:19,248 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 15:00:19,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 15:00:19,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 15:00:19,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 15:00:19,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 15:00:19,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 15:00:19,250 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 15:00:19,250 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 15:00:19,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 15:00:19,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 15:00:19,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 15:00:19,251 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 15:00:19,251 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 15:00:19,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:00:19,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 15:00:19,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 15:00:19,252 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 15:00:19,252 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 15:00:19,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 15:00:19,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 15:00:19,252 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 15:00:19,253 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 15:00:19,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 15:00:19,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 15:00:19,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 15:00:19,332 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 15:00:19,333 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 15:00:19,334 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label41_true-unreach-call.c [2018-10-24 15:00:19,405 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f40c821f9/6828f34924bc4a29928493627bd4eb41/FLAG813148f4c [2018-10-24 15:00:20,144 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 15:00:20,147 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label41_true-unreach-call.c [2018-10-24 15:00:20,171 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f40c821f9/6828f34924bc4a29928493627bd4eb41/FLAG813148f4c [2018-10-24 15:00:20,189 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f40c821f9/6828f34924bc4a29928493627bd4eb41 [2018-10-24 15:00:20,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 15:00:20,206 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 15:00:20,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:20,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 15:00:20,212 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 15:00:20,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:20" (1/1) ... [2018-10-24 15:00:20,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a881f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:20, skipping insertion in model container [2018-10-24 15:00:20,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:20" (1/1) ... [2018-10-24 15:00:20,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 15:00:20,334 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 15:00:21,213 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:21,220 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 15:00:21,508 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:21,534 INFO L193 MainTranslator]: Completed translation [2018-10-24 15:00:21,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21 WrapperNode [2018-10-24 15:00:21,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:21,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:21,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 15:00:21,540 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 15:00:21,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (1/1) ... [2018-10-24 15:00:21,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (1/1) ... [2018-10-24 15:00:21,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:21,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 15:00:21,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 15:00:21,866 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 15:00:21,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (1/1) ... [2018-10-24 15:00:21,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (1/1) ... [2018-10-24 15:00:21,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (1/1) ... [2018-10-24 15:00:21,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (1/1) ... [2018-10-24 15:00:21,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (1/1) ... [2018-10-24 15:00:21,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (1/1) ... [2018-10-24 15:00:22,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (1/1) ... [2018-10-24 15:00:22,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 15:00:22,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 15:00:22,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 15:00:22,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 15:00:22,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (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 15:00:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 15:00:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 15:00:22,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 15:00:27,502 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 15:00:27,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:27 BoogieIcfgContainer [2018-10-24 15:00:27,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 15:00:27,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 15:00:27,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 15:00:27,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 15:00:27,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:00:20" (1/3) ... [2018-10-24 15:00:27,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d385d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:27, skipping insertion in model container [2018-10-24 15:00:27,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:21" (2/3) ... [2018-10-24 15:00:27,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d385d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:27, skipping insertion in model container [2018-10-24 15:00:27,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:27" (3/3) ... [2018-10-24 15:00:27,512 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label41_true-unreach-call.c [2018-10-24 15:00:27,522 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 15:00:27,531 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 15:00:27,549 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 15:00:27,593 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 15:00:27,594 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 15:00:27,594 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 15:00:27,594 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 15:00:27,595 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 15:00:27,595 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 15:00:27,595 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 15:00:27,595 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 15:00:27,595 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 15:00:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 15:00:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 15:00:27,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:27,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:27,660 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:27,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1542586394, now seen corresponding path program 1 times [2018-10-24 15:00:27,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:27,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:27,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:28,534 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 15:00:28,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:28,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:28,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:28,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:28,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:28,562 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 15:00:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:31,991 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-24 15:00:31,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:31,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-10-24 15:00:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:32,026 INFO L225 Difference]: With dead ends: 1072 [2018-10-24 15:00:32,026 INFO L226 Difference]: Without dead ends: 762 [2018-10-24 15:00:32,033 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 15:00:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-24 15:00:32,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-24 15:00:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-24 15:00:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-24 15:00:32,123 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 183 [2018-10-24 15:00:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:32,124 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-24 15:00:32,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-24 15:00:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-24 15:00:32,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:32,131 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:32,132 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:32,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1845542153, now seen corresponding path program 1 times [2018-10-24 15:00:32,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:32,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:32,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:32,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:32,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:32,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:32,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:32,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:32,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:32,444 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-24 15:00:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:35,514 INFO L93 Difference]: Finished difference Result 1917 states and 3253 transitions. [2018-10-24 15:00:35,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:35,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-10-24 15:00:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:35,524 INFO L225 Difference]: With dead ends: 1917 [2018-10-24 15:00:35,525 INFO L226 Difference]: Without dead ends: 1401 [2018-10-24 15:00:35,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-10-24 15:00:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 933. [2018-10-24 15:00:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-24 15:00:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-24 15:00:35,569 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 189 [2018-10-24 15:00:35,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:35,569 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-24 15:00:35,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-24 15:00:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-24 15:00:35,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:35,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:35,575 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:35,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:35,576 INFO L82 PathProgramCache]: Analyzing trace with hash -40059333, now seen corresponding path program 1 times [2018-10-24 15:00:35,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:35,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:35,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:35,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:35,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:35,665 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 15:00:35,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:35,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:35,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:35,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:35,667 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-24 15:00:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:38,308 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-24 15:00:38,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:38,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-10-24 15:00:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:38,320 INFO L225 Difference]: With dead ends: 2699 [2018-10-24 15:00:38,320 INFO L226 Difference]: Without dead ends: 1768 [2018-10-24 15:00:38,323 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 15:00:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-24 15:00:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-24 15:00:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-24 15:00:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-24 15:00:38,364 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 192 [2018-10-24 15:00:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:38,365 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-24 15:00:38,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-24 15:00:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-24 15:00:38,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:38,371 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:38,371 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:38,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:38,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1107131409, now seen corresponding path program 1 times [2018-10-24 15:00:38,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:38,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:38,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 15:00:38,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:38,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:38,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:38,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:38,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:38,514 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-10-24 15:00:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:39,937 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-10-24 15:00:39,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:39,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-10-24 15:00:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:39,952 INFO L225 Difference]: With dead ends: 4329 [2018-10-24 15:00:39,952 INFO L226 Difference]: Without dead ends: 2580 [2018-10-24 15:00:39,955 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 15:00:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-10-24 15:00:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-10-24 15:00:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-10-24 15:00:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-10-24 15:00:40,008 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 200 [2018-10-24 15:00:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:40,009 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-10-24 15:00:40,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-10-24 15:00:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-24 15:00:40,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:40,016 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:40,017 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:40,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1875654890, now seen corresponding path program 1 times [2018-10-24 15:00:40,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:40,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:40,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:40,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 15:00:40,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:40,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:40,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:40,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:40,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:40,151 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-10-24 15:00:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:40,625 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-10-24 15:00:40,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:40,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-10-24 15:00:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:40,657 INFO L225 Difference]: With dead ends: 7713 [2018-10-24 15:00:40,657 INFO L226 Difference]: Without dead ends: 5136 [2018-10-24 15:00:40,662 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 15:00:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-10-24 15:00:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-10-24 15:00:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-10-24 15:00:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-10-24 15:00:40,770 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 206 [2018-10-24 15:00:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:40,770 INFO L481 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-10-24 15:00:40,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-10-24 15:00:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-24 15:00:40,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:40,781 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:40,782 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:40,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1741862557, now seen corresponding path program 1 times [2018-10-24 15:00:40,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:40,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:40,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:40,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:41,129 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 15:00:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 15:00:41,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:00:41,169 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 15:00:41,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:41,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:00:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 15:00:41,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:00:41,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-24 15:00:41,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:41,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:41,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:41,440 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-10-24 15:00:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:44,037 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-10-24 15:00:44,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:44,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2018-10-24 15:00:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:44,123 INFO L225 Difference]: With dead ends: 20487 [2018-10-24 15:00:44,124 INFO L226 Difference]: Without dead ends: 15356 [2018-10-24 15:00:44,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-10-24 15:00:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-10-24 15:00:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-10-24 15:00:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-10-24 15:00:44,413 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 215 [2018-10-24 15:00:44,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:44,413 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-10-24 15:00:44,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-10-24 15:00:44,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-24 15:00:44,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:44,433 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,433 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:44,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:44,434 INFO L82 PathProgramCache]: Analyzing trace with hash -239700322, now seen corresponding path program 1 times [2018-10-24 15:00:44,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:44,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:44,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:44,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:44,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:00:44,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:00:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:00:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:00:44,680 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-10-24 15:00:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:47,755 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-10-24 15:00:47,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:00:47,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-10-24 15:00:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:47,795 INFO L225 Difference]: With dead ends: 23029 [2018-10-24 15:00:47,795 INFO L226 Difference]: Without dead ends: 12802 [2018-10-24 15:00:47,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:00:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-10-24 15:00:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-10-24 15:00:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-10-24 15:00:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-10-24 15:00:48,029 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 223 [2018-10-24 15:00:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:48,030 INFO L481 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-10-24 15:00:48,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:00:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-10-24 15:00:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-24 15:00:48,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:48,055 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,055 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:48,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1949917310, now seen corresponding path program 1 times [2018-10-24 15:00:48,056 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:48,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:48,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:48,476 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 15:00:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:48,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:00:48,554 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 15:00:48,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:48,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:00:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:00:48,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:00:48,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 15:00:48,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 15:00:48,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 15:00:48,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:00:48,789 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 7 states. [2018-10-24 15:00:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:55,891 INFO L93 Difference]: Finished difference Result 58087 states and 84611 transitions. [2018-10-24 15:00:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 15:00:55,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 233 [2018-10-24 15:00:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:55,984 INFO L225 Difference]: With dead ends: 58087 [2018-10-24 15:00:55,984 INFO L226 Difference]: Without dead ends: 47044 [2018-10-24 15:00:56,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-24 15:00:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47044 states. [2018-10-24 15:00:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47044 to 45800. [2018-10-24 15:00:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45800 states. [2018-10-24 15:00:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45800 states to 45800 states and 56726 transitions. [2018-10-24 15:00:56,710 INFO L78 Accepts]: Start accepts. Automaton has 45800 states and 56726 transitions. Word has length 233 [2018-10-24 15:00:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:56,711 INFO L481 AbstractCegarLoop]: Abstraction has 45800 states and 56726 transitions. [2018-10-24 15:00:56,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 15:00:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 45800 states and 56726 transitions. [2018-10-24 15:00:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-24 15:00:56,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:56,766 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:56,766 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:56,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash 838847358, now seen corresponding path program 1 times [2018-10-24 15:00:56,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:56,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:56,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 15:00:56,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:56,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:56,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:56,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:56,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:56,892 INFO L87 Difference]: Start difference. First operand 45800 states and 56726 transitions. Second operand 3 states. [2018-10-24 15:00:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:58,778 INFO L93 Difference]: Finished difference Result 105274 states and 132479 transitions. [2018-10-24 15:00:58,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:58,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-10-24 15:00:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:58,859 INFO L225 Difference]: With dead ends: 105274 [2018-10-24 15:00:58,860 INFO L226 Difference]: Without dead ends: 59476 [2018-10-24 15:00:58,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59476 states. [2018-10-24 15:00:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59476 to 59468. [2018-10-24 15:00:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59468 states. [2018-10-24 15:01:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59468 states to 59468 states and 70978 transitions. [2018-10-24 15:01:00,048 INFO L78 Accepts]: Start accepts. Automaton has 59468 states and 70978 transitions. Word has length 245 [2018-10-24 15:01:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:00,049 INFO L481 AbstractCegarLoop]: Abstraction has 59468 states and 70978 transitions. [2018-10-24 15:01:00,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 59468 states and 70978 transitions. [2018-10-24 15:01:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-24 15:01:00,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:00,098 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:00,098 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:00,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash -557160164, now seen corresponding path program 1 times [2018-10-24 15:01:00,098 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:00,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:00,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:00,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:00,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-24 15:01:00,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:00,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:00,348 INFO L87 Difference]: Start difference. First operand 59468 states and 70978 transitions. Second operand 3 states. [2018-10-24 15:01:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:01,383 INFO L93 Difference]: Finished difference Result 116380 states and 139034 transitions. [2018-10-24 15:01:01,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:01,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-10-24 15:01:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:01,445 INFO L225 Difference]: With dead ends: 116380 [2018-10-24 15:01:01,445 INFO L226 Difference]: Without dead ends: 56914 [2018-10-24 15:01:01,483 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 15:01:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56914 states. [2018-10-24 15:01:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56914 to 56914. [2018-10-24 15:01:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56914 states. [2018-10-24 15:01:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56914 states to 56914 states and 66991 transitions. [2018-10-24 15:01:02,041 INFO L78 Accepts]: Start accepts. Automaton has 56914 states and 66991 transitions. Word has length 287 [2018-10-24 15:01:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:02,041 INFO L481 AbstractCegarLoop]: Abstraction has 56914 states and 66991 transitions. [2018-10-24 15:01:02,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 56914 states and 66991 transitions. [2018-10-24 15:01:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-24 15:01:02,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:02,075 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:02,075 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:02,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1619691015, now seen corresponding path program 1 times [2018-10-24 15:01:02,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:02,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:02,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:02,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:02,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 15:01:02,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:02,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:02,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:02,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:02,932 INFO L87 Difference]: Start difference. First operand 56914 states and 66991 transitions. Second operand 3 states. [2018-10-24 15:01:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:04,237 INFO L93 Difference]: Finished difference Result 159633 states and 188339 transitions. [2018-10-24 15:01:04,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:04,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-10-24 15:01:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:04,380 INFO L225 Difference]: With dead ends: 159633 [2018-10-24 15:01:04,380 INFO L226 Difference]: Without dead ends: 102721 [2018-10-24 15:01:04,428 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 15:01:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102721 states. [2018-10-24 15:01:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102721 to 102717. [2018-10-24 15:01:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102717 states. [2018-10-24 15:01:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102717 states to 102717 states and 121291 transitions. [2018-10-24 15:01:05,812 INFO L78 Accepts]: Start accepts. Automaton has 102717 states and 121291 transitions. Word has length 337 [2018-10-24 15:01:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:05,812 INFO L481 AbstractCegarLoop]: Abstraction has 102717 states and 121291 transitions. [2018-10-24 15:01:05,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 102717 states and 121291 transitions. [2018-10-24 15:01:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-24 15:01:05,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:05,881 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:05,881 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:05,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:05,881 INFO L82 PathProgramCache]: Analyzing trace with hash 15499286, now seen corresponding path program 1 times [2018-10-24 15:01:05,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:05,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:05,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:05,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:05,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-24 15:01:06,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:06,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:06,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:06,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:06,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:06,410 INFO L87 Difference]: Start difference. First operand 102717 states and 121291 transitions. Second operand 4 states. [2018-10-24 15:01:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:10,667 INFO L93 Difference]: Finished difference Result 257684 states and 302483 transitions. [2018-10-24 15:01:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:10,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2018-10-24 15:01:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:10,850 INFO L225 Difference]: With dead ends: 257684 [2018-10-24 15:01:10,850 INFO L226 Difference]: Without dead ends: 154969 [2018-10-24 15:01:10,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154969 states. [2018-10-24 15:01:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154969 to 139365. [2018-10-24 15:01:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139365 states. [2018-10-24 15:01:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139365 states to 139365 states and 161240 transitions. [2018-10-24 15:01:12,417 INFO L78 Accepts]: Start accepts. Automaton has 139365 states and 161240 transitions. Word has length 381 [2018-10-24 15:01:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:12,418 INFO L481 AbstractCegarLoop]: Abstraction has 139365 states and 161240 transitions. [2018-10-24 15:01:12,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 139365 states and 161240 transitions. [2018-10-24 15:01:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-24 15:01:12,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:12,505 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:12,505 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:12,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1554796466, now seen corresponding path program 1 times [2018-10-24 15:01:12,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:12,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:12,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 379 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-24 15:01:13,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:13,808 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 15:01:13,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:14,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-24 15:01:14,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:14,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 15:01:14,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:01:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:01:14,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:14,182 INFO L87 Difference]: Start difference. First operand 139365 states and 161240 transitions. Second operand 5 states. [2018-10-24 15:01:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:19,508 INFO L93 Difference]: Finished difference Result 800926 states and 921990 transitions. [2018-10-24 15:01:19,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 15:01:19,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2018-10-24 15:01:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:21,820 INFO L225 Difference]: With dead ends: 800926 [2018-10-24 15:01:21,820 INFO L226 Difference]: Without dead ends: 661563 [2018-10-24 15:01:21,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:01:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661563 states. [2018-10-24 15:01:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661563 to 453574. [2018-10-24 15:01:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453574 states. [2018-10-24 15:01:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453574 states to 453574 states and 520341 transitions. [2018-10-24 15:01:30,929 INFO L78 Accepts]: Start accepts. Automaton has 453574 states and 520341 transitions. Word has length 405 [2018-10-24 15:01:30,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:30,930 INFO L481 AbstractCegarLoop]: Abstraction has 453574 states and 520341 transitions. [2018-10-24 15:01:30,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:01:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand 453574 states and 520341 transitions. [2018-10-24 15:01:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-24 15:01:31,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:31,044 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:31,044 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:31,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash -536930713, now seen corresponding path program 1 times [2018-10-24 15:01:31,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:31,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:31,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 1 proven. 200 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-24 15:01:32,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:32,275 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:01:32,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:32,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-24 15:01:38,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:38,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-24 15:01:38,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 15:01:38,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 15:01:38,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-24 15:01:38,943 INFO L87 Difference]: Start difference. First operand 453574 states and 520341 transitions. Second operand 10 states. [2018-10-24 15:01:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:54,628 INFO L93 Difference]: Finished difference Result 1228680 states and 1440338 transitions. [2018-10-24 15:01:54,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 15:01:54,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 412 [2018-10-24 15:01:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:55,547 INFO L225 Difference]: With dead ends: 1228680 [2018-10-24 15:01:55,548 INFO L226 Difference]: Without dead ends: 775108 [2018-10-24 15:01:55,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 420 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-10-24 15:01:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775108 states. [2018-10-24 15:02:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775108 to 614930. [2018-10-24 15:02:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614930 states. [2018-10-24 15:02:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614930 states to 614930 states and 699958 transitions. [2018-10-24 15:02:05,977 INFO L78 Accepts]: Start accepts. Automaton has 614930 states and 699958 transitions. Word has length 412 [2018-10-24 15:02:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:05,977 INFO L481 AbstractCegarLoop]: Abstraction has 614930 states and 699958 transitions. [2018-10-24 15:02:05,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 15:02:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 614930 states and 699958 transitions. [2018-10-24 15:02:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-24 15:02:08,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:08,032 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:02:08,033 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:08,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1998143988, now seen corresponding path program 1 times [2018-10-24 15:02:08,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:08,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:08,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 15:02:08,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:08,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:08,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:08,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:08,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:08,456 INFO L87 Difference]: Start difference. First operand 614930 states and 699958 transitions. Second operand 4 states. [2018-10-24 15:02:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:22,900 INFO L93 Difference]: Finished difference Result 1605907 states and 1821245 transitions. [2018-10-24 15:02:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:22,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 423 [2018-10-24 15:02:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:24,716 INFO L225 Difference]: With dead ends: 1605907 [2018-10-24 15:02:24,716 INFO L226 Difference]: Without dead ends: 991798 [2018-10-24 15:02:26,515 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 15:02:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991798 states. [2018-10-24 15:02:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991798 to 987270. [2018-10-24 15:02:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987270 states. [2018-10-24 15:02:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987270 states to 987270 states and 1116482 transitions. [2018-10-24 15:02:41,930 INFO L78 Accepts]: Start accepts. Automaton has 987270 states and 1116482 transitions. Word has length 423 [2018-10-24 15:02:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:41,931 INFO L481 AbstractCegarLoop]: Abstraction has 987270 states and 1116482 transitions. [2018-10-24 15:02:41,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 987270 states and 1116482 transitions. [2018-10-24 15:02:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-24 15:02:42,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:42,155 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:02:42,155 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:42,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash -962808791, now seen corresponding path program 1 times [2018-10-24 15:02:42,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:42,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-24 15:02:42,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:42,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:42,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:42,468 INFO L87 Difference]: Start difference. First operand 987270 states and 1116482 transitions. Second operand 3 states. [2018-10-24 15:03:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:03,680 INFO L93 Difference]: Finished difference Result 2494727 states and 2808160 transitions. [2018-10-24 15:03:03,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:03,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-10-24 15:03:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:05,743 INFO L225 Difference]: With dead ends: 2494727 [2018-10-24 15:03:05,743 INFO L226 Difference]: Without dead ends: 1507459 [2018-10-24 15:03:06,202 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:03:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507459 states.