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_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:04:57,986 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:04:57,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:04:58,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:04:58,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:04:58,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:04:58,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:04:58,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:04:58,015 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:04:58,017 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:04:58,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:04:58,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:04:58,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:04:58,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:04:58,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:04:58,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:04:58,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:04:58,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:04:58,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:04:58,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:04:58,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:04:58,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:04:58,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:04:58,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:04:58,052 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:04:58,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:04:58,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:04:58,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:04:58,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:04:58,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:04:58,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:04:58,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:04:58,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:04:58,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:04:58,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:04:58,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:04:58,060 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-26 20:04:58,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:04:58,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:04:58,076 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:04:58,076 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:04:58,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:04:58,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:04:58,077 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:04:58,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:04:58,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:04:58,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:04:58,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:04:58,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:04:58,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:04:58,078 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:04:58,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:04:58,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:04:58,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:04:58,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:04:58,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:04:58,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:04:58,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:04:58,080 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:04:58,080 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:04:58,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:04:58,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:04:58,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:04:58,081 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:04:58,081 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:04:58,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:04:58,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:04:58,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:04:58,141 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:04:58,142 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:04:58,143 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-10-26 20:04:58,203 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6c0014ea8/38dacd4b053943b1bd439e4d6b039a86/FLAG2b9dde918 [2018-10-26 20:04:58,906 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:04:58,907 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-10-26 20:04:58,928 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6c0014ea8/38dacd4b053943b1bd439e4d6b039a86/FLAG2b9dde918 [2018-10-26 20:04:58,943 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6c0014ea8/38dacd4b053943b1bd439e4d6b039a86 [2018-10-26 20:04:58,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:04:58,954 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:04:58,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:04:58,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:04:58,959 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:04:58,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:04:58" (1/1) ... [2018-10-26 20:04:58,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b295a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:58, skipping insertion in model container [2018-10-26 20:04:58,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:04:58" (1/1) ... [2018-10-26 20:04:58,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:04:59,080 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:04:59,836 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:04:59,842 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:05:00,104 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:05:00,130 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:05:00,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00 WrapperNode [2018-10-26 20:05:00,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:05:00,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:05:00,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:05:00,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:05:00,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (1/1) ... [2018-10-26 20:05:00,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (1/1) ... [2018-10-26 20:05:00,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:05:00,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:05:00,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:05:00,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:05:00,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (1/1) ... [2018-10-26 20:05:00,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (1/1) ... [2018-10-26 20:05:00,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (1/1) ... [2018-10-26 20:05:00,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (1/1) ... [2018-10-26 20:05:00,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (1/1) ... [2018-10-26 20:05:00,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (1/1) ... [2018-10-26 20:05:00,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (1/1) ... [2018-10-26 20:05:00,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:05:00,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:05:00,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:05:00,627 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:05:00,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (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-26 20:05:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:05:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:05:00,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:05:05,960 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:05:05,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:05:05 BoogieIcfgContainer [2018-10-26 20:05:05,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:05:05,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:05:05,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:05:05,966 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:05:05,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:04:58" (1/3) ... [2018-10-26 20:05:05,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c4e2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:05:05, skipping insertion in model container [2018-10-26 20:05:05,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:00" (2/3) ... [2018-10-26 20:05:05,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c4e2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:05:05, skipping insertion in model container [2018-10-26 20:05:05,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:05:05" (3/3) ... [2018-10-26 20:05:05,971 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label53_true-unreach-call.c [2018-10-26 20:05:05,981 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:05:05,993 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:05:06,012 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:05:06,065 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:05:06,066 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:05:06,067 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:05:06,067 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:05:06,067 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:05:06,067 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:05:06,067 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:05:06,067 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:05:06,068 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:05:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:05:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 20:05:06,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:06,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:06,141 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:06,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:06,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2009406410, now seen corresponding path program 1 times [2018-10-26 20:05:06,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:06,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:06,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:06,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:06,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:07,214 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-26 20:05:07,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:07,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:07,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:07,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:07,244 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:05:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:10,867 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-26 20:05:10,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:10,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-10-26 20:05:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:10,898 INFO L225 Difference]: With dead ends: 1089 [2018-10-26 20:05:10,899 INFO L226 Difference]: Without dead ends: 779 [2018-10-26 20:05:10,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-26 20:05:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-26 20:05:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-26 20:05:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-26 20:05:10,998 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 195 [2018-10-26 20:05:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:10,999 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-26 20:05:11,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-26 20:05:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-26 20:05:11,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:11,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:11,016 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:11,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash -907220423, now seen corresponding path program 1 times [2018-10-26 20:05:11,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:11,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:11,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:11,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:11,347 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-26 20:05:11,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:11,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:11,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:11,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:11,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:11,351 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-26 20:05:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:16,339 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-26 20:05:16,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:16,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-10-26 20:05:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:16,350 INFO L225 Difference]: With dead ends: 1904 [2018-10-26 20:05:16,351 INFO L226 Difference]: Without dead ends: 1391 [2018-10-26 20:05:16,355 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-26 20:05:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-26 20:05:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-26 20:05:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-26 20:05:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-26 20:05:16,401 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 201 [2018-10-26 20:05:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:16,402 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-26 20:05:16,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-26 20:05:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-26 20:05:16,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:16,406 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:16,407 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:16,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:16,407 INFO L82 PathProgramCache]: Analyzing trace with hash 330620286, now seen corresponding path program 1 times [2018-10-26 20:05:16,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:16,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:16,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:16,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:16,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:16,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:16,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:16,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:16,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:16,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:16,530 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-26 20:05:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:18,714 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-10-26 20:05:18,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:18,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-26 20:05:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:18,725 INFO L225 Difference]: With dead ends: 2711 [2018-10-26 20:05:18,725 INFO L226 Difference]: Without dead ends: 1786 [2018-10-26 20:05:18,728 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-26 20:05:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-26 20:05:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-10-26 20:05:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-10-26 20:05:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-10-26 20:05:18,766 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 202 [2018-10-26 20:05:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:18,766 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-10-26 20:05:18,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-10-26 20:05:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 20:05:18,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:18,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:18,773 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:18,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -400117653, now seen corresponding path program 1 times [2018-10-26 20:05:18,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:18,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:18,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:18,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:18,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:18,900 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-26 20:05:18,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:18,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:18,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:18,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:18,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:18,902 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-10-26 20:05:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:20,343 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-10-26 20:05:20,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:20,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-10-26 20:05:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:20,361 INFO L225 Difference]: With dead ends: 5215 [2018-10-26 20:05:20,361 INFO L226 Difference]: Without dead ends: 3433 [2018-10-26 20:05:20,364 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-26 20:05:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-10-26 20:05:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-10-26 20:05:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-26 20:05:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-10-26 20:05:20,426 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 204 [2018-10-26 20:05:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:20,426 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-10-26 20:05:20,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-10-26 20:05:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 20:05:20,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:20,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:20,435 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:20,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:20,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1921534150, now seen corresponding path program 1 times [2018-10-26 20:05:20,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:20,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:20,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:20,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:20,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:20,611 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-26 20:05:20,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:20,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:20,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:20,613 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 3 states. [2018-10-26 20:05:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:21,660 INFO L93 Difference]: Finished difference Result 10229 states and 15374 transitions. [2018-10-26 20:05:21,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:21,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-26 20:05:21,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:21,692 INFO L225 Difference]: With dead ends: 10229 [2018-10-26 20:05:21,692 INFO L226 Difference]: Without dead ends: 6815 [2018-10-26 20:05:21,699 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-26 20:05:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6815 states. [2018-10-26 20:05:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6815 to 6811. [2018-10-26 20:05:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6811 states. [2018-10-26 20:05:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6811 states to 6811 states and 10227 transitions. [2018-10-26 20:05:21,844 INFO L78 Accepts]: Start accepts. Automaton has 6811 states and 10227 transitions. Word has length 218 [2018-10-26 20:05:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:21,845 INFO L481 AbstractCegarLoop]: Abstraction has 6811 states and 10227 transitions. [2018-10-26 20:05:21,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 6811 states and 10227 transitions. [2018-10-26 20:05:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-26 20:05:21,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:21,860 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:21,860 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:21,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:21,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1444628378, now seen corresponding path program 1 times [2018-10-26 20:05:21,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:21,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:21,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:21,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:21,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:22,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:22,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:22,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:22,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:22,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:22,172 INFO L87 Difference]: Start difference. First operand 6811 states and 10227 transitions. Second operand 4 states. [2018-10-26 20:05:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:25,110 INFO L93 Difference]: Finished difference Result 26790 states and 40398 transitions. [2018-10-26 20:05:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:25,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-10-26 20:05:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:25,171 INFO L225 Difference]: With dead ends: 26790 [2018-10-26 20:05:25,172 INFO L226 Difference]: Without dead ends: 19981 [2018-10-26 20:05:25,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19981 states. [2018-10-26 20:05:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19981 to 13345. [2018-10-26 20:05:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13345 states. [2018-10-26 20:05:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13345 states to 13345 states and 19034 transitions. [2018-10-26 20:05:25,512 INFO L78 Accepts]: Start accepts. Automaton has 13345 states and 19034 transitions. Word has length 219 [2018-10-26 20:05:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:25,513 INFO L481 AbstractCegarLoop]: Abstraction has 13345 states and 19034 transitions. [2018-10-26 20:05:25,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 13345 states and 19034 transitions. [2018-10-26 20:05:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-26 20:05:25,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:25,538 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:25,538 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:25,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:25,539 INFO L82 PathProgramCache]: Analyzing trace with hash -626143831, now seen corresponding path program 1 times [2018-10-26 20:05:25,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:25,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:25,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:25,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:25,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:05:25,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:25,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:25,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:25,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:25,909 INFO L87 Difference]: Start difference. First operand 13345 states and 19034 transitions. Second operand 4 states. [2018-10-26 20:05:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:28,758 INFO L93 Difference]: Finished difference Result 50146 states and 71178 transitions. [2018-10-26 20:05:28,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:28,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-10-26 20:05:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:28,831 INFO L225 Difference]: With dead ends: 50146 [2018-10-26 20:05:28,831 INFO L226 Difference]: Without dead ends: 36803 [2018-10-26 20:05:28,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36803 states. [2018-10-26 20:05:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36803 to 36799. [2018-10-26 20:05:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36799 states. [2018-10-26 20:05:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36799 states to 36799 states and 46035 transitions. [2018-10-26 20:05:29,441 INFO L78 Accepts]: Start accepts. Automaton has 36799 states and 46035 transitions. Word has length 232 [2018-10-26 20:05:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:29,441 INFO L481 AbstractCegarLoop]: Abstraction has 36799 states and 46035 transitions. [2018-10-26 20:05:29,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 36799 states and 46035 transitions. [2018-10-26 20:05:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-26 20:05:29,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:29,502 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:29,502 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:29,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:29,503 INFO L82 PathProgramCache]: Analyzing trace with hash 405445227, now seen corresponding path program 1 times [2018-10-26 20:05:29,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:29,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:29,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 20:05:29,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:29,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:29,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:29,677 INFO L87 Difference]: Start difference. First operand 36799 states and 46035 transitions. Second operand 3 states. [2018-10-26 20:05:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:31,296 INFO L93 Difference]: Finished difference Result 71506 states and 89059 transitions. [2018-10-26 20:05:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:31,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-10-26 20:05:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:31,378 INFO L225 Difference]: With dead ends: 71506 [2018-10-26 20:05:31,378 INFO L226 Difference]: Without dead ends: 34709 [2018-10-26 20:05:31,417 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-26 20:05:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34709 states. [2018-10-26 20:05:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34709 to 34709. [2018-10-26 20:05:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34709 states. [2018-10-26 20:05:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34709 states to 34709 states and 42256 transitions. [2018-10-26 20:05:32,150 INFO L78 Accepts]: Start accepts. Automaton has 34709 states and 42256 transitions. Word has length 253 [2018-10-26 20:05:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:32,151 INFO L481 AbstractCegarLoop]: Abstraction has 34709 states and 42256 transitions. [2018-10-26 20:05:32,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34709 states and 42256 transitions. [2018-10-26 20:05:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-26 20:05:32,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:32,186 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:05:32,186 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:32,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:32,187 INFO L82 PathProgramCache]: Analyzing trace with hash -48503042, now seen corresponding path program 1 times [2018-10-26 20:05:32,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:32,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:32,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:32,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:32,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:32,785 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2018-10-26 20:05:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:32,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:32,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:32,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:32,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:32,915 INFO L87 Difference]: Start difference. First operand 34709 states and 42256 transitions. Second operand 4 states. [2018-10-26 20:05:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:35,139 INFO L93 Difference]: Finished difference Result 71880 states and 87371 transitions. [2018-10-26 20:05:35,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:35,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-10-26 20:05:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:35,181 INFO L225 Difference]: With dead ends: 71880 [2018-10-26 20:05:35,181 INFO L226 Difference]: Without dead ends: 37173 [2018-10-26 20:05:35,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37173 states. [2018-10-26 20:05:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37173 to 37169. [2018-10-26 20:05:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37169 states. [2018-10-26 20:05:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37169 states to 37169 states and 44967 transitions. [2018-10-26 20:05:35,667 INFO L78 Accepts]: Start accepts. Automaton has 37169 states and 44967 transitions. Word has length 270 [2018-10-26 20:05:35,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:35,668 INFO L481 AbstractCegarLoop]: Abstraction has 37169 states and 44967 transitions. [2018-10-26 20:05:35,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 37169 states and 44967 transitions. [2018-10-26 20:05:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-26 20:05:35,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:35,696 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:35,697 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:35,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:35,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1440785836, now seen corresponding path program 1 times [2018-10-26 20:05:35,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:35,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:35,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:35,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:35,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 20:05:35,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:35,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:35,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:35,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:35,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:35,948 INFO L87 Difference]: Start difference. First operand 37169 states and 44967 transitions. Second operand 3 states. [2018-10-26 20:05:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:37,799 INFO L93 Difference]: Finished difference Result 74338 states and 89936 transitions. [2018-10-26 20:05:37,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:37,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2018-10-26 20:05:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:37,845 INFO L225 Difference]: With dead ends: 74338 [2018-10-26 20:05:37,845 INFO L226 Difference]: Without dead ends: 37171 [2018-10-26 20:05:37,875 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-26 20:05:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37171 states. [2018-10-26 20:05:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37171 to 37169. [2018-10-26 20:05:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37169 states. [2018-10-26 20:05:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37169 states to 37169 states and 43322 transitions. [2018-10-26 20:05:38,351 INFO L78 Accepts]: Start accepts. Automaton has 37169 states and 43322 transitions. Word has length 306 [2018-10-26 20:05:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:38,351 INFO L481 AbstractCegarLoop]: Abstraction has 37169 states and 43322 transitions. [2018-10-26 20:05:38,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 37169 states and 43322 transitions. [2018-10-26 20:05:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-26 20:05:38,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:38,377 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:05:38,377 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:38,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash 370758085, now seen corresponding path program 1 times [2018-10-26 20:05:38,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:38,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:38,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:05:38,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:38,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:38,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:38,611 INFO L87 Difference]: Start difference. First operand 37169 states and 43322 transitions. Second operand 3 states. [2018-10-26 20:05:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:39,898 INFO L93 Difference]: Finished difference Result 72636 states and 84664 transitions. [2018-10-26 20:05:39,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:39,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2018-10-26 20:05:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:39,941 INFO L225 Difference]: With dead ends: 72636 [2018-10-26 20:05:39,941 INFO L226 Difference]: Without dead ends: 35469 [2018-10-26 20:05:39,966 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-26 20:05:39,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35469 states. [2018-10-26 20:05:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35469 to 35465. [2018-10-26 20:05:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-26 20:05:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 40049 transitions. [2018-10-26 20:05:40,395 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 40049 transitions. Word has length 319 [2018-10-26 20:05:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:40,395 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 40049 transitions. [2018-10-26 20:05:40,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 40049 transitions. [2018-10-26 20:05:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-26 20:05:40,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:40,418 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:05:40,418 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:40,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash -539370600, now seen corresponding path program 1 times [2018-10-26 20:05:40,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:40,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:40,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:40,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:40,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:41,205 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 20:05:41,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:41,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:41,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:41,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:41,208 INFO L87 Difference]: Start difference. First operand 35465 states and 40049 transitions. Second operand 3 states. [2018-10-26 20:05:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:42,494 INFO L93 Difference]: Finished difference Result 69289 states and 78346 transitions. [2018-10-26 20:05:42,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:42,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2018-10-26 20:05:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:42,526 INFO L225 Difference]: With dead ends: 69289 [2018-10-26 20:05:42,527 INFO L226 Difference]: Without dead ends: 35463 [2018-10-26 20:05:42,547 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-26 20:05:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35463 states. [2018-10-26 20:05:42,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35463 to 35463. [2018-10-26 20:05:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35463 states. [2018-10-26 20:05:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35463 states to 35463 states and 40045 transitions. [2018-10-26 20:05:42,869 INFO L78 Accepts]: Start accepts. Automaton has 35463 states and 40045 transitions. Word has length 326 [2018-10-26 20:05:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:42,870 INFO L481 AbstractCegarLoop]: Abstraction has 35463 states and 40045 transitions. [2018-10-26 20:05:42,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 35463 states and 40045 transitions. [2018-10-26 20:05:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-26 20:05:42,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:42,893 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:42,893 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:42,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:42,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1874209680, now seen corresponding path program 1 times [2018-10-26 20:05:42,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:42,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:42,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:42,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:42,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-26 20:05:43,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:43,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:43,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:43,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:43,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:43,245 INFO L87 Difference]: Start difference. First operand 35463 states and 40045 transitions. Second operand 4 states. [2018-10-26 20:05:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:44,836 INFO L93 Difference]: Finished difference Result 70515 states and 79664 transitions. [2018-10-26 20:05:44,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:44,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-10-26 20:05:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:44,877 INFO L225 Difference]: With dead ends: 70515 [2018-10-26 20:05:44,877 INFO L226 Difference]: Without dead ends: 35054 [2018-10-26 20:05:44,899 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-26 20:05:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35054 states. [2018-10-26 20:05:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35054 to 35053. [2018-10-26 20:05:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35053 states. [2018-10-26 20:05:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35053 states to 35053 states and 38475 transitions. [2018-10-26 20:05:45,267 INFO L78 Accepts]: Start accepts. Automaton has 35053 states and 38475 transitions. Word has length 342 [2018-10-26 20:05:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:45,267 INFO L481 AbstractCegarLoop]: Abstraction has 35053 states and 38475 transitions. [2018-10-26 20:05:45,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 35053 states and 38475 transitions. [2018-10-26 20:05:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-26 20:05:45,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:45,291 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:05:45,292 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:45,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash -71967826, now seen corresponding path program 1 times [2018-10-26 20:05:45,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:45,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:45,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:45,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:45,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 20:05:45,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:45,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:45,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:45,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:45,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:45,741 INFO L87 Difference]: Start difference. First operand 35053 states and 38475 transitions. Second operand 4 states. [2018-10-26 20:05:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:48,517 INFO L93 Difference]: Finished difference Result 71140 states and 78180 transitions. [2018-10-26 20:05:48,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:48,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-10-26 20:05:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:48,566 INFO L225 Difference]: With dead ends: 71140 [2018-10-26 20:05:48,566 INFO L226 Difference]: Without dead ends: 37316 [2018-10-26 20:05:48,591 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-26 20:05:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37316 states. [2018-10-26 20:05:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37316 to 37303. [2018-10-26 20:05:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37303 states. [2018-10-26 20:05:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37303 states to 37303 states and 40895 transitions. [2018-10-26 20:05:48,986 INFO L78 Accepts]: Start accepts. Automaton has 37303 states and 40895 transitions. Word has length 342 [2018-10-26 20:05:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:48,987 INFO L481 AbstractCegarLoop]: Abstraction has 37303 states and 40895 transitions. [2018-10-26 20:05:48,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 37303 states and 40895 transitions. [2018-10-26 20:05:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-26 20:05:49,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:49,003 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:49,003 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:49,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:49,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1553900648, now seen corresponding path program 1 times [2018-10-26 20:05:49,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:49,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:49,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:49,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:49,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-10-26 20:05:49,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:49,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:49,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:49,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:49,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:49,151 INFO L87 Difference]: Start difference. First operand 37303 states and 40895 transitions. Second operand 3 states. [2018-10-26 20:05:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:50,551 INFO L93 Difference]: Finished difference Result 91825 states and 100517 transitions. [2018-10-26 20:05:50,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:50,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-26 20:05:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:50,604 INFO L225 Difference]: With dead ends: 91825 [2018-10-26 20:05:50,604 INFO L226 Difference]: Without dead ends: 55751 [2018-10-26 20:05:50,628 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-26 20:05:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55751 states. [2018-10-26 20:05:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55751 to 55748. [2018-10-26 20:05:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55748 states. [2018-10-26 20:05:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55748 states to 55748 states and 60878 transitions. [2018-10-26 20:05:51,194 INFO L78 Accepts]: Start accepts. Automaton has 55748 states and 60878 transitions. Word has length 348 [2018-10-26 20:05:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:51,195 INFO L481 AbstractCegarLoop]: Abstraction has 55748 states and 60878 transitions. [2018-10-26 20:05:51,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 55748 states and 60878 transitions. [2018-10-26 20:05:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-26 20:05:51,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:51,216 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:05:51,217 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:51,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:51,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2132933612, now seen corresponding path program 1 times [2018-10-26 20:05:51,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:51,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:51,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:51,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:51,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:51,605 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:05:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-10-26 20:05:52,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:52,265 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-26 20:05:52,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:52,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-26 20:05:52,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:05:52,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 20:05:52,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:05:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:05:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:05:52,797 INFO L87 Difference]: Start difference. First operand 55748 states and 60878 transitions. Second operand 6 states. [2018-10-26 20:06:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:00,700 INFO L93 Difference]: Finished difference Result 159029 states and 174177 transitions. [2018-10-26 20:06:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:06:00,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 356 [2018-10-26 20:06:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:00,835 INFO L225 Difference]: With dead ends: 159029 [2018-10-26 20:06:00,835 INFO L226 Difference]: Without dead ends: 104714 [2018-10-26 20:06:00,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:06:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104714 states. [2018-10-26 20:06:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104714 to 92259. [2018-10-26 20:06:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92259 states. [2018-10-26 20:06:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92259 states to 92259 states and 99762 transitions. [2018-10-26 20:06:02,894 INFO L78 Accepts]: Start accepts. Automaton has 92259 states and 99762 transitions. Word has length 356 [2018-10-26 20:06:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:02,895 INFO L481 AbstractCegarLoop]: Abstraction has 92259 states and 99762 transitions. [2018-10-26 20:06:02,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:06:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 92259 states and 99762 transitions. [2018-10-26 20:06:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-26 20:06:02,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:02,944 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:06:02,944 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:02,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash -232365187, now seen corresponding path program 1 times [2018-10-26 20:06:02,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:02,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:02,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:02,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:02,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-10-26 20:06:04,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:04,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:04,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:04,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:04,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:04,142 INFO L87 Difference]: Start difference. First operand 92259 states and 99762 transitions. Second operand 4 states. [2018-10-26 20:06:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:05,910 INFO L93 Difference]: Finished difference Result 342810 states and 371050 transitions. [2018-10-26 20:06:05,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:05,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 457 [2018-10-26 20:06:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:06,201 INFO L225 Difference]: With dead ends: 342810 [2018-10-26 20:06:06,202 INFO L226 Difference]: Without dead ends: 251984 [2018-10-26 20:06:06,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251984 states. [2018-10-26 20:06:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251984 to 162590. [2018-10-26 20:06:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162590 states. [2018-10-26 20:06:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162590 states to 162590 states and 176047 transitions. [2018-10-26 20:06:09,584 INFO L78 Accepts]: Start accepts. Automaton has 162590 states and 176047 transitions. Word has length 457 [2018-10-26 20:06:09,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:09,585 INFO L481 AbstractCegarLoop]: Abstraction has 162590 states and 176047 transitions. [2018-10-26 20:06:09,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 162590 states and 176047 transitions. [2018-10-26 20:06:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-26 20:06:09,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:09,630 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:09,630 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:09,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:09,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1170531438, now seen corresponding path program 1 times [2018-10-26 20:06:09,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:09,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:09,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-26 20:06:10,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:10,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:10,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:10,045 INFO L87 Difference]: Start difference. First operand 162590 states and 176047 transitions. Second operand 3 states. [2018-10-26 20:06:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:12,417 INFO L93 Difference]: Finished difference Result 433844 states and 468648 transitions. [2018-10-26 20:06:12,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:12,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2018-10-26 20:06:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:12,786 INFO L225 Difference]: With dead ends: 433844 [2018-10-26 20:06:12,786 INFO L226 Difference]: Without dead ends: 272687 [2018-10-26 20:06:12,922 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-26 20:06:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272687 states. [2018-10-26 20:06:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272687 to 272685. [2018-10-26 20:06:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272685 states. [2018-10-26 20:06:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272685 states to 272685 states and 292971 transitions. [2018-10-26 20:06:17,445 INFO L78 Accepts]: Start accepts. Automaton has 272685 states and 292971 transitions. Word has length 479 [2018-10-26 20:06:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:17,445 INFO L481 AbstractCegarLoop]: Abstraction has 272685 states and 292971 transitions. [2018-10-26 20:06:17,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 272685 states and 292971 transitions. [2018-10-26 20:06:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-10-26 20:06:17,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:17,521 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:06:17,521 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:17,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash 208632150, now seen corresponding path program 1 times [2018-10-26 20:06:17,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:17,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:17,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:17,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:17,984 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:06:18,196 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:06:18,456 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 20:06:18,813 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-10-26 20:06:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 396 proven. 29 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-26 20:06:20,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:20,191 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-26 20:06:20,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:20,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 350 proven. 52 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-26 20:06:20,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:06:20,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-10-26 20:06:20,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:06:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:06:20,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:06:20,831 INFO L87 Difference]: Start difference. First operand 272685 states and 292971 transitions. Second operand 12 states. [2018-10-26 20:06:21,236 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:06:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:54,699 INFO L93 Difference]: Finished difference Result 2094409 states and 2248871 transitions. [2018-10-26 20:06:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-26 20:06:54,700 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 481 [2018-10-26 20:06:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:58,224 INFO L225 Difference]: With dead ends: 2094409 [2018-10-26 20:06:58,225 INFO L226 Difference]: Without dead ends: 1821715 [2018-10-26 20:07:00,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 479 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 20:07:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821715 states. [2018-10-26 20:07:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821715 to 1819564. [2018-10-26 20:07:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819564 states. [2018-10-26 20:07:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819564 states to 1819564 states and 1941351 transitions. [2018-10-26 20:07:54,087 INFO L78 Accepts]: Start accepts. Automaton has 1819564 states and 1941351 transitions. Word has length 481 [2018-10-26 20:07:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:54,088 INFO L481 AbstractCegarLoop]: Abstraction has 1819564 states and 1941351 transitions. [2018-10-26 20:07:54,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 20:07:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1819564 states and 1941351 transitions. [2018-10-26 20:07:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2018-10-26 20:07:54,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:54,391 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 20:07:54,391 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:54,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1947764577, now seen corresponding path program 1 times [2018-10-26 20:07:54,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:54,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:54,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-10-26 20:07:55,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:07:55,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:07:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:07:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:55,025 INFO L87 Difference]: Start difference. First operand 1819564 states and 1941351 transitions. Second operand 3 states. Received shutdown request... [2018-10-26 20:08:11,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:08:11,003 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:08:11,008 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:08:11,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:08:11 BoogieIcfgContainer [2018-10-26 20:08:11,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:08:11,009 INFO L168 Benchmark]: Toolchain (without parser) took 192056.16 ms. Allocated memory was 1.5 GB in the beginning and 6.5 GB in the end (delta: 4.9 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 5.6 GB. Max. memory is 7.1 GB. [2018-10-26 20:08:11,011 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:08:11,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1176.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-26 20:08:11,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 317.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 765.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -877.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-26 20:08:11,013 INFO L168 Benchmark]: Boogie Preprocessor took 176.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-26 20:08:11,014 INFO L168 Benchmark]: RCFGBuilder took 5333.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 256.0 MB). Peak memory consumption was 256.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:08:11,014 INFO L168 Benchmark]: TraceAbstraction took 185046.44 ms. Allocated memory was 2.3 GB in the beginning and 6.5 GB in the end (delta: 4.2 GB). Free memory was 2.0 GB in the beginning and 3.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 5.4 GB. Max. memory is 7.1 GB. [2018-10-26 20:08:11,022 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1176.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 317.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 765.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -877.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 176.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5333.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 256.0 MB). Peak memory consumption was 256.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 185046.44 ms. Allocated memory was 2.3 GB in the beginning and 6.5 GB in the end (delta: 4.2 GB). Free memory was 2.0 GB in the beginning and 3.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 5.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1617]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1617). Cancelled while BasicCegarLoop was constructing difference of abstraction (1819564states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (445757 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 184.9s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 102.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5318 SDtfs, 20054 SDslu, 3917 SDs, 0 SdLazy, 23510 SolverSat, 5341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 937 GetRequests, 861 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1819564occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 68.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 111420 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 7162 NumberOfCodeBlocks, 7162 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7140 ConstructedInterpolants, 0 QuantifiedInterpolants, 6321400 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1528 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 5089/5174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown