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/Problem18_label31_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:38:10,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:38:10,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:38:10,195 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:38:10,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:38:10,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:38:10,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:38:10,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:38:10,202 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:38:10,203 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:38:10,204 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:38:10,204 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:38:10,205 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:38:10,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:38:10,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:38:10,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:38:10,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:38:10,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:38:10,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:38:10,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:38:10,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:38:10,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:38:10,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:38:10,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:38:10,226 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:38:10,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:38:10,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:38:10,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:38:10,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:38:10,233 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:38:10,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:38:10,234 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:38:10,234 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:38:10,235 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:38:10,236 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:38:10,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:38:10,238 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:38:10,266 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:38:10,267 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:38:10,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:38:10,268 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:38:10,269 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:38:10,269 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:38:10,269 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:38:10,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:38:10,270 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:38:10,270 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:38:10,270 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:38:10,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:38:10,270 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:38:10,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:38:10,272 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:38:10,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:38:10,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:38:10,272 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:38:10,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:38:10,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:38:10,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:38:10,274 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:38:10,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:38:10,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:38:10,275 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:38:10,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:38:10,275 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:38:10,275 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:38:10,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:38:10,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:38:10,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:38:10,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:38:10,351 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:38:10,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label31_false-unreach-call.c [2018-10-24 14:38:10,428 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0bf481b96/1ec6aaac3b4146339736fec22e1497b1/FLAG879a74734 [2018-10-24 14:38:11,199 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:38:11,200 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label31_false-unreach-call.c [2018-10-24 14:38:11,223 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0bf481b96/1ec6aaac3b4146339736fec22e1497b1/FLAG879a74734 [2018-10-24 14:38:11,240 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0bf481b96/1ec6aaac3b4146339736fec22e1497b1 [2018-10-24 14:38:11,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:38:11,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:38:11,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:38:11,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:38:11,260 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:38:11,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:11" (1/1) ... [2018-10-24 14:38:11,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a79e33f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:11, skipping insertion in model container [2018-10-24 14:38:11,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:11" (1/1) ... [2018-10-24 14:38:11,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:38:11,412 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:38:12,447 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:38:12,453 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:38:12,915 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:38:12,945 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:38:12,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12 WrapperNode [2018-10-24 14:38:12,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:38:12,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:38:12,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:38:12,947 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:38:12,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... [2018-10-24 14:38:13,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... [2018-10-24 14:38:13,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:38:13,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:38:13,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:38:13,478 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:38:13,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... [2018-10-24 14:38:13,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... [2018-10-24 14:38:13,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... [2018-10-24 14:38:13,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... [2018-10-24 14:38:13,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... [2018-10-24 14:38:13,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... [2018-10-24 14:38:13,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... [2018-10-24 14:38:13,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:38:13,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:38:13,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:38:13,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:38:13,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:38:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:38:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:38:13,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:38:20,900 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:38:20,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:20 BoogieIcfgContainer [2018-10-24 14:38:20,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:38:20,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:38:20,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:38:20,906 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:38:20,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:38:11" (1/3) ... [2018-10-24 14:38:20,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0bc978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:20, skipping insertion in model container [2018-10-24 14:38:20,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:12" (2/3) ... [2018-10-24 14:38:20,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0bc978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:20, skipping insertion in model container [2018-10-24 14:38:20,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:20" (3/3) ... [2018-10-24 14:38:20,910 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label31_false-unreach-call.c [2018-10-24 14:38:20,921 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:38:20,930 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:38:20,948 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:38:20,993 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:38:20,993 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:38:20,993 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:38:20,994 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:38:20,994 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:38:20,994 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:38:20,994 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:38:20,994 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:38:20,994 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:38:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2018-10-24 14:38:21,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 14:38:21,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:21,039 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:38:21,041 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:21,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 666618706, now seen corresponding path program 1 times [2018-10-24 14:38:21,050 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:21,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:21,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:38:21,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:21,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:38:21,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:38:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:38:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:38:21,401 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2018-10-24 14:38:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:32,825 INFO L93 Difference]: Finished difference Result 2918 states and 5666 transitions. [2018-10-24 14:38:32,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:38:32,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-24 14:38:32,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:32,871 INFO L225 Difference]: With dead ends: 2918 [2018-10-24 14:38:32,871 INFO L226 Difference]: Without dead ends: 2153 [2018-10-24 14:38:32,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:38:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2018-10-24 14:38:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2153. [2018-10-24 14:38:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2018-10-24 14:38:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 3448 transitions. [2018-10-24 14:38:33,064 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 3448 transitions. Word has length 16 [2018-10-24 14:38:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:33,064 INFO L481 AbstractCegarLoop]: Abstraction has 2153 states and 3448 transitions. [2018-10-24 14:38:33,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:38:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 3448 transitions. [2018-10-24 14:38:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-24 14:38:33,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:33,070 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:38:33,070 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:33,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:33,071 INFO L82 PathProgramCache]: Analyzing trace with hash 880957250, now seen corresponding path program 1 times [2018-10-24 14:38:33,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:33,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:33,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:38:33,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:33,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:38:33,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:38:33,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:38:33,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:38:33,380 INFO L87 Difference]: Start difference. First operand 2153 states and 3448 transitions. Second operand 4 states. [2018-10-24 14:38:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:40,572 INFO L93 Difference]: Finished difference Result 6377 states and 10263 transitions. [2018-10-24 14:38:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:38:40,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-10-24 14:38:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:40,598 INFO L225 Difference]: With dead ends: 6377 [2018-10-24 14:38:40,598 INFO L226 Difference]: Without dead ends: 4226 [2018-10-24 14:38:40,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:38:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2018-10-24 14:38:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 4226. [2018-10-24 14:38:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4226 states. [2018-10-24 14:38:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 5833 transitions. [2018-10-24 14:38:40,690 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 5833 transitions. Word has length 82 [2018-10-24 14:38:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:40,690 INFO L481 AbstractCegarLoop]: Abstraction has 4226 states and 5833 transitions. [2018-10-24 14:38:40,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:38:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5833 transitions. [2018-10-24 14:38:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-24 14:38:40,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:40,705 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:38:40,705 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:40,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:40,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1144334006, now seen corresponding path program 1 times [2018-10-24 14:38:40,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:40,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:40,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:40,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:40,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:41,399 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-24 14:38:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:38:41,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:41,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:38:41,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:38:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:38:41,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:38:41,630 INFO L87 Difference]: Start difference. First operand 4226 states and 5833 transitions. Second operand 5 states. [2018-10-24 14:38:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:50,683 INFO L93 Difference]: Finished difference Result 15360 states and 20468 transitions. [2018-10-24 14:38:50,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:38:50,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2018-10-24 14:38:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:50,733 INFO L225 Difference]: With dead ends: 15360 [2018-10-24 14:38:50,734 INFO L226 Difference]: Without dead ends: 11136 [2018-10-24 14:38:50,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:38:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11136 states. [2018-10-24 14:38:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11136 to 10445. [2018-10-24 14:38:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10445 states. [2018-10-24 14:38:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10445 states to 10445 states and 12444 transitions. [2018-10-24 14:38:50,913 INFO L78 Accepts]: Start accepts. Automaton has 10445 states and 12444 transitions. Word has length 201 [2018-10-24 14:38:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:50,914 INFO L481 AbstractCegarLoop]: Abstraction has 10445 states and 12444 transitions. [2018-10-24 14:38:50,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:38:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10445 states and 12444 transitions. [2018-10-24 14:38:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-24 14:38:50,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:50,925 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:38:50,925 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:50,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash 52890338, now seen corresponding path program 1 times [2018-10-24 14:38:50,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:50,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:50,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 258 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 14:38:51,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:38:51,646 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:38:51,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:51,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:38:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 14:38:51,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:38:51,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:38:51,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:38:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:38:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:38:51,972 INFO L87 Difference]: Start difference. First operand 10445 states and 12444 transitions. Second operand 6 states. [2018-10-24 14:39:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:07,118 INFO L93 Difference]: Finished difference Result 31269 states and 37248 transitions. [2018-10-24 14:39:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:39:07,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 384 [2018-10-24 14:39:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:07,180 INFO L225 Difference]: With dead ends: 31269 [2018-10-24 14:39:07,180 INFO L226 Difference]: Without dead ends: 18750 [2018-10-24 14:39:07,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 384 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:39:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18750 states. [2018-10-24 14:39:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18750 to 13883. [2018-10-24 14:39:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13883 states. [2018-10-24 14:39:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13883 states to 13883 states and 15539 transitions. [2018-10-24 14:39:07,413 INFO L78 Accepts]: Start accepts. Automaton has 13883 states and 15539 transitions. Word has length 384 [2018-10-24 14:39:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:07,414 INFO L481 AbstractCegarLoop]: Abstraction has 13883 states and 15539 transitions. [2018-10-24 14:39:07,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:39:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13883 states and 15539 transitions. [2018-10-24 14:39:07,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-24 14:39:07,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:07,420 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:07,420 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:07,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:07,421 INFO L82 PathProgramCache]: Analyzing trace with hash -396150073, now seen corresponding path program 1 times [2018-10-24 14:39:07,421 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:07,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:07,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-24 14:39:07,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:07,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:39:07,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:39:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:39:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:07,868 INFO L87 Difference]: Start difference. First operand 13883 states and 15539 transitions. Second operand 4 states. [2018-10-24 14:39:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:14,038 INFO L93 Difference]: Finished difference Result 31925 states and 36879 transitions. [2018-10-24 14:39:14,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:39:14,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2018-10-24 14:39:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:14,070 INFO L225 Difference]: With dead ends: 31925 [2018-10-24 14:39:14,071 INFO L226 Difference]: Without dead ends: 18044 [2018-10-24 14:39:14,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18044 states. [2018-10-24 14:39:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18044 to 15956. [2018-10-24 14:39:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15956 states. [2018-10-24 14:39:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15956 states to 15956 states and 17936 transitions. [2018-10-24 14:39:14,286 INFO L78 Accepts]: Start accepts. Automaton has 15956 states and 17936 transitions. Word has length 389 [2018-10-24 14:39:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:14,287 INFO L481 AbstractCegarLoop]: Abstraction has 15956 states and 17936 transitions. [2018-10-24 14:39:14,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:39:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 15956 states and 17936 transitions. [2018-10-24 14:39:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-10-24 14:39:14,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:14,299 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:14,300 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:14,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash -428093327, now seen corresponding path program 1 times [2018-10-24 14:39:14,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:14,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:14,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:14,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:14,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:14,699 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:39:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-10-24 14:39:14,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:14,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:39:14,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:39:14,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:39:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:14,915 INFO L87 Difference]: Start difference. First operand 15956 states and 17936 transitions. Second operand 4 states. [2018-10-24 14:39:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:21,301 INFO L93 Difference]: Finished difference Result 48494 states and 55980 transitions. [2018-10-24 14:39:21,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:39:21,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 483 [2018-10-24 14:39:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:21,348 INFO L225 Difference]: With dead ends: 48494 [2018-10-24 14:39:21,349 INFO L226 Difference]: Without dead ends: 29066 [2018-10-24 14:39:21,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:21,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29066 states. [2018-10-24 14:39:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29066 to 29066. [2018-10-24 14:39:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29066 states. [2018-10-24 14:39:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29066 states to 29066 states and 31982 transitions. [2018-10-24 14:39:21,703 INFO L78 Accepts]: Start accepts. Automaton has 29066 states and 31982 transitions. Word has length 483 [2018-10-24 14:39:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:21,704 INFO L481 AbstractCegarLoop]: Abstraction has 29066 states and 31982 transitions. [2018-10-24 14:39:21,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:39:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 29066 states and 31982 transitions. [2018-10-24 14:39:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2018-10-24 14:39:21,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:21,724 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:39:21,724 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:21,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:21,725 INFO L82 PathProgramCache]: Analyzing trace with hash 171577271, now seen corresponding path program 1 times [2018-10-24 14:39:21,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:21,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:21,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:21,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:21,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:22,377 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:39:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:39:22,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:22,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:39:22,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:39:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:39:22,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:22,591 INFO L87 Difference]: Start difference. First operand 29066 states and 31982 transitions. Second operand 4 states. [2018-10-24 14:39:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:27,993 INFO L93 Difference]: Finished difference Result 101663 states and 112527 transitions. [2018-10-24 14:39:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:39:27,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 616 [2018-10-24 14:39:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:28,081 INFO L225 Difference]: With dead ends: 101663 [2018-10-24 14:39:28,081 INFO L226 Difference]: Without dead ends: 72599 [2018-10-24 14:39:28,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72599 states. [2018-10-24 14:39:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72599 to 70526. [2018-10-24 14:39:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70526 states. [2018-10-24 14:39:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70526 states to 70526 states and 76349 transitions. [2018-10-24 14:39:28,904 INFO L78 Accepts]: Start accepts. Automaton has 70526 states and 76349 transitions. Word has length 616 [2018-10-24 14:39:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:28,905 INFO L481 AbstractCegarLoop]: Abstraction has 70526 states and 76349 transitions. [2018-10-24 14:39:28,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:39:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 70526 states and 76349 transitions. [2018-10-24 14:39:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2018-10-24 14:39:28,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:28,952 INFO L375 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:28,952 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:28,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:28,954 INFO L82 PathProgramCache]: Analyzing trace with hash -11842296, now seen corresponding path program 1 times [2018-10-24 14:39:28,954 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:28,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:28,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:28,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:28,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2018-10-24 14:39:30,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:30,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:39:30,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:39:30,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:39:30,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:39:30,156 INFO L87 Difference]: Start difference. First operand 70526 states and 76349 transitions. Second operand 3 states. [2018-10-24 14:39:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:33,407 INFO L93 Difference]: Finished difference Result 141050 states and 152696 transitions. [2018-10-24 14:39:33,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:39:33,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 791 [2018-10-24 14:39:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:33,483 INFO L225 Difference]: With dead ends: 141050 [2018-10-24 14:39:33,483 INFO L226 Difference]: Without dead ends: 70526 [2018-10-24 14:39:33,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:39:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70526 states. [2018-10-24 14:39:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70526 to 70526. [2018-10-24 14:39:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70526 states. [2018-10-24 14:39:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70526 states to 70526 states and 75156 transitions. [2018-10-24 14:39:34,282 INFO L78 Accepts]: Start accepts. Automaton has 70526 states and 75156 transitions. Word has length 791 [2018-10-24 14:39:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:34,283 INFO L481 AbstractCegarLoop]: Abstraction has 70526 states and 75156 transitions. [2018-10-24 14:39:34,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:39:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 70526 states and 75156 transitions. [2018-10-24 14:39:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-10-24 14:39:34,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:34,312 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:34,312 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:34,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash -216092287, now seen corresponding path program 1 times [2018-10-24 14:39:34,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:34,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:34,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-10-24 14:39:35,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:35,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:39:35,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:39:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:39:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:35,426 INFO L87 Difference]: Start difference. First operand 70526 states and 75156 transitions. Second operand 4 states. [2018-10-24 14:39:40,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:40,694 INFO L93 Difference]: Finished difference Result 159707 states and 170262 transitions. [2018-10-24 14:39:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:39:40,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 879 [2018-10-24 14:39:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:40,776 INFO L225 Difference]: With dead ends: 159707 [2018-10-24 14:39:40,776 INFO L226 Difference]: Without dead ends: 82949 [2018-10-24 14:39:40,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82949 states. [2018-10-24 14:39:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82949 to 82949. [2018-10-24 14:39:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82949 states. [2018-10-24 14:39:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82949 states to 82949 states and 86634 transitions. [2018-10-24 14:39:42,110 INFO L78 Accepts]: Start accepts. Automaton has 82949 states and 86634 transitions. Word has length 879 [2018-10-24 14:39:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:42,111 INFO L481 AbstractCegarLoop]: Abstraction has 82949 states and 86634 transitions. [2018-10-24 14:39:42,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:39:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 82949 states and 86634 transitions. [2018-10-24 14:39:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-10-24 14:39:42,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:42,152 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:42,152 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:42,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:42,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1310648929, now seen corresponding path program 1 times [2018-10-24 14:39:42,153 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:42,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:42,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:42,810 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:39:43,133 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2018-10-24 14:39:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 945 proven. 201 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-10-24 14:39:44,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:39:44,805 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:39:44,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:45,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:39:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-10-24 14:39:46,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:39:46,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2018-10-24 14:39:46,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 14:39:46,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 14:39:46,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:39:46,101 INFO L87 Difference]: Start difference. First operand 82949 states and 86634 transitions. Second operand 10 states. [2018-10-24 14:39:55,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:55,964 INFO L93 Difference]: Finished difference Result 169637 states and 177110 transitions. [2018-10-24 14:39:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:39:55,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 988 [2018-10-24 14:39:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:56,040 INFO L225 Difference]: With dead ends: 169637 [2018-10-24 14:39:56,040 INFO L226 Difference]: Without dead ends: 86690 [2018-10-24 14:39:56,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 987 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:39:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86690 states. [2018-10-24 14:39:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86690 to 86404. [2018-10-24 14:39:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86404 states. [2018-10-24 14:39:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86404 states to 86404 states and 89737 transitions. [2018-10-24 14:39:56,741 INFO L78 Accepts]: Start accepts. Automaton has 86404 states and 89737 transitions. Word has length 988 [2018-10-24 14:39:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:56,742 INFO L481 AbstractCegarLoop]: Abstraction has 86404 states and 89737 transitions. [2018-10-24 14:39:56,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 14:39:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 86404 states and 89737 transitions. [2018-10-24 14:39:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1540 [2018-10-24 14:39:56,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:56,787 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:56,788 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:56,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash -181847221, now seen corresponding path program 1 times [2018-10-24 14:39:56,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:56,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:56,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 2523 trivial. 0 not checked. [2018-10-24 14:39:59,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:59,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:39:59,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:39:59,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:39:59,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:59,122 INFO L87 Difference]: Start difference. First operand 86404 states and 89737 transitions. Second operand 4 states. [2018-10-24 14:40:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:02,882 INFO L93 Difference]: Finished difference Result 185935 states and 193309 transitions. [2018-10-24 14:40:02,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:40:02,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1539 [2018-10-24 14:40:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:02,977 INFO L225 Difference]: With dead ends: 185935 [2018-10-24 14:40:02,977 INFO L226 Difference]: Without dead ends: 98149 [2018-10-24 14:40:03,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98149 states. [2018-10-24 14:40:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98149 to 97458. [2018-10-24 14:40:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97458 states. [2018-10-24 14:40:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97458 states to 97458 states and 100959 transitions. [2018-10-24 14:40:03,784 INFO L78 Accepts]: Start accepts. Automaton has 97458 states and 100959 transitions. Word has length 1539 [2018-10-24 14:40:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:03,785 INFO L481 AbstractCegarLoop]: Abstraction has 97458 states and 100959 transitions. [2018-10-24 14:40:03,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:40:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 97458 states and 100959 transitions. [2018-10-24 14:40:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1689 [2018-10-24 14:40:03,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:03,831 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:40:03,831 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:03,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2081053523, now seen corresponding path program 1 times [2018-10-24 14:40:03,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:03,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2794 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1123 trivial. 0 not checked. [2018-10-24 14:40:06,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:06,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:40:06,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:40:06,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:40:06,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:06,722 INFO L87 Difference]: Start difference. First operand 97458 states and 100959 transitions. Second operand 4 states. [2018-10-24 14:40:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:11,700 INFO L93 Difference]: Finished difference Result 194914 states and 201932 transitions. [2018-10-24 14:40:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:40:11,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1688 [2018-10-24 14:40:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:11,798 INFO L225 Difference]: With dead ends: 194914 [2018-10-24 14:40:11,798 INFO L226 Difference]: Without dead ends: 97457 [2018-10-24 14:40:11,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97457 states. [2018-10-24 14:40:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97457 to 96075. [2018-10-24 14:40:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96075 states. [2018-10-24 14:40:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96075 states to 96075 states and 98957 transitions. [2018-10-24 14:40:12,464 INFO L78 Accepts]: Start accepts. Automaton has 96075 states and 98957 transitions. Word has length 1688 [2018-10-24 14:40:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:12,464 INFO L481 AbstractCegarLoop]: Abstraction has 96075 states and 98957 transitions. [2018-10-24 14:40:12,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:40:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 96075 states and 98957 transitions. [2018-10-24 14:40:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1690 [2018-10-24 14:40:12,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:12,508 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:40:12,509 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:12,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash 928542765, now seen corresponding path program 1 times [2018-10-24 14:40:12,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:12,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:12,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:12,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:12,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:13,437 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-24 14:40:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2800 backedges. 1949 proven. 0 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2018-10-24 14:40:14,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:14,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:40:14,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:40:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:40:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:14,611 INFO L87 Difference]: Start difference. First operand 96075 states and 98957 transitions. Second operand 4 states. [2018-10-24 14:40:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:20,092 INFO L93 Difference]: Finished difference Result 205963 states and 212503 transitions. [2018-10-24 14:40:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:40:20,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1689 [2018-10-24 14:40:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:20,193 INFO L225 Difference]: With dead ends: 205963 [2018-10-24 14:40:20,194 INFO L226 Difference]: Without dead ends: 109197 [2018-10-24 14:40:20,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109197 states. [2018-10-24 14:40:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109197 to 105742. [2018-10-24 14:40:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105742 states. [2018-10-24 14:40:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105742 states to 105742 states and 108544 transitions. [2018-10-24 14:40:21,107 INFO L78 Accepts]: Start accepts. Automaton has 105742 states and 108544 transitions. Word has length 1689 [2018-10-24 14:40:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:21,108 INFO L481 AbstractCegarLoop]: Abstraction has 105742 states and 108544 transitions. [2018-10-24 14:40:21,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:40:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 105742 states and 108544 transitions. [2018-10-24 14:40:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1869 [2018-10-24 14:40:21,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:21,162 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:40:21,162 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:21,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash 896994845, now seen corresponding path program 1 times [2018-10-24 14:40:21,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:21,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:21,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:21,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:22,531 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:40:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3498 backedges. 2691 proven. 108 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2018-10-24 14:40:24,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:40:24,369 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:40:24,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:24,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:40:29,189 WARN L179 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 1877 DAG size of output: 26 [2018-10-24 14:40:29,553 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 32 [2018-10-24 14:40:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3498 backedges. 2277 proven. 320 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2018-10-24 14:40:39,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:40:39,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-24 14:40:39,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:40:39,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:40:39,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:40:39,372 INFO L87 Difference]: Start difference. First operand 105742 states and 108544 transitions. Second operand 8 states. [2018-10-24 14:41:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:41:33,743 INFO L93 Difference]: Finished difference Result 225299 states and 231201 transitions. [2018-10-24 14:41:33,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:41:33,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1868 [2018-10-24 14:41:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:41:33,858 INFO L225 Difference]: With dead ends: 225299 [2018-10-24 14:41:33,858 INFO L226 Difference]: Without dead ends: 120250 [2018-10-24 14:41:33,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1876 GetRequests, 1868 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:41:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120250 states. [2018-10-24 14:41:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120250 to 107120. [2018-10-24 14:41:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107120 states. [2018-10-24 14:41:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107120 states to 107120 states and 109629 transitions. [2018-10-24 14:41:34,781 INFO L78 Accepts]: Start accepts. Automaton has 107120 states and 109629 transitions. Word has length 1868 [2018-10-24 14:41:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:41:34,782 INFO L481 AbstractCegarLoop]: Abstraction has 107120 states and 109629 transitions. [2018-10-24 14:41:34,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:41:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 107120 states and 109629 transitions. [2018-10-24 14:41:34,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1898 [2018-10-24 14:41:34,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:41:34,828 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:41:34,828 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:41:34,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:41:34,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1771248917, now seen corresponding path program 1 times [2018-10-24 14:41:34,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:41:34,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:41:34,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:41:34,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:41:34,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:41:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:41:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 2715 proven. 69 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2018-10-24 14:41:37,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:41:37,778 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:41:37,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:41:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:41:38,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:41:38,552 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 24 [2018-10-24 14:41:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 1808 proven. 93 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-10-24 14:41:45,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:41:45,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-10-24 14:41:45,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:41:45,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:41:45,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:41:45,609 INFO L87 Difference]: Start difference. First operand 107120 states and 109629 transitions. Second operand 7 states. Received shutdown request... [2018-10-24 14:42:00,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 14:42:00,484 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:42:00,491 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:42:00,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:42:00 BoogieIcfgContainer [2018-10-24 14:42:00,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:42:00,493 INFO L168 Benchmark]: Toolchain (without parser) took 229239.76 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 939.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:00,494 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:42:00,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1691.11 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: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:00,495 INFO L168 Benchmark]: Boogie Procedure Inliner took 530.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -937.9 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:00,496 INFO L168 Benchmark]: Boogie Preprocessor took 208.66 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:00,497 INFO L168 Benchmark]: RCFGBuilder took 7215.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 522.7 MB). Peak memory consumption was 522.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:00,497 INFO L168 Benchmark]: TraceAbstraction took 219589.34 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 1.7 GB in the beginning and 2.9 GB in the end (delta: -1.2 GB). Peak memory consumption was 401.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:00,503 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 1691.11 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: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 530.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -937.9 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 208.66 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7215.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 522.7 MB). Peak memory consumption was 522.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 219589.34 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 1.7 GB in the beginning and 2.9 GB in the end (delta: -1.2 GB). Peak memory consumption was 401.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (107120states) and FLOYD_HOARE automaton (currently 8 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (102497 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 758 locations, 1 error locations. TIMEOUT Result, 219.5s OverallTime, 15 OverallIterations, 8 TraceHistogramMax, 164.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8522 SDtfs, 29642 SDslu, 1282 SDs, 0 SdLazy, 84628 SolverSat, 9993 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 137.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5226 GetRequests, 5158 SyntacticMatches, 16 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107120occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 28663 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 18647 NumberOfCodeBlocks, 18647 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 18628 ConstructedInterpolants, 1120 QuantifiedInterpolants, 125185125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5896 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 27916/28711 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown