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/Problem13_label33_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:27:40,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:27:40,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:27:40,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:27:40,145 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:27:40,146 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:27:40,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:27:40,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:27:40,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:27:40,153 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:27:40,154 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:27:40,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:27:40,155 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:27:40,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:27:40,157 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:27:40,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:27:40,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:27:40,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:27:40,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:27:40,165 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:27:40,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:27:40,168 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:27:40,170 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:27:40,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:27:40,171 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:27:40,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:27:40,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:27:40,174 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:27:40,175 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:27:40,176 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:27:40,176 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:27:40,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:27:40,177 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:27:40,177 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:27:40,178 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:27:40,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:27:40,179 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 21:27:40,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:27:40,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:27:40,196 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:27:40,196 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:27:40,197 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:27:40,197 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:27:40,197 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:27:40,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:27:40,198 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:27:40,198 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:27:40,198 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:27:40,199 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:27:40,199 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:27:40,199 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:27:40,199 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:27:40,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:27:40,200 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:27:40,200 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:27:40,200 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:27:40,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:27:40,201 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:27:40,201 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:27:40,201 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:27:40,201 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:27:40,201 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:27:40,202 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:27:40,202 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:27:40,202 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:27:40,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:27:40,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:27:40,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:27:40,266 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:27:40,267 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:27:40,267 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label33_true-unreach-call.c [2018-10-26 21:27:40,342 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0aa22cfa5/e447f0e2c18347379e700678caa65d37/FLAG401bb4b2e [2018-10-26 21:27:41,247 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:27:41,248 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label33_true-unreach-call.c [2018-10-26 21:27:41,286 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0aa22cfa5/e447f0e2c18347379e700678caa65d37/FLAG401bb4b2e [2018-10-26 21:27:41,311 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0aa22cfa5/e447f0e2c18347379e700678caa65d37 [2018-10-26 21:27:41,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:27:41,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:27:41,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:27:41,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:27:41,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:27:41,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:27:41" (1/1) ... [2018-10-26 21:27:41,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e111934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:41, skipping insertion in model container [2018-10-26 21:27:41,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:27:41" (1/1) ... [2018-10-26 21:27:41,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:27:41,551 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:27:43,057 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:27:43,062 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:27:43,839 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:27:43,882 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:27:43,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43 WrapperNode [2018-10-26 21:27:43,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:27:43,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:27:43,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:27:43,888 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:27:43,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:43,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:27:44,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:27:44,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:27:44,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:27:44,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:44,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:45,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:45,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:45,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... [2018-10-26 21:27:45,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:27:45,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:27:45,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:27:45,286 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:27:45,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:27:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:27:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:27:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:28:00,848 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:28:00,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:28:00 BoogieIcfgContainer [2018-10-26 21:28:00,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:28:00,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:28:00,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:28:00,855 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:28:00,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:27:41" (1/3) ... [2018-10-26 21:28:00,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5915cf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:28:00, skipping insertion in model container [2018-10-26 21:28:00,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:27:43" (2/3) ... [2018-10-26 21:28:00,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5915cf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:28:00, skipping insertion in model container [2018-10-26 21:28:00,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:28:00" (3/3) ... [2018-10-26 21:28:00,859 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label33_true-unreach-call.c [2018-10-26 21:28:00,868 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:28:00,878 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:28:00,896 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:28:00,944 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:28:00,945 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:28:00,945 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:28:00,945 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:28:00,945 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:28:00,945 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:28:00,945 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:28:00,946 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:28:00,946 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:28:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-26 21:28:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 21:28:00,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:00,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:01,000 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:01,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1502078046, now seen corresponding path program 1 times [2018-10-26 21:28:01,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:28:01,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:28:01,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:01,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:01,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:01,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:28:01,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:28:01,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:28:01,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:01,647 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-26 21:28:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:22,604 INFO L93 Difference]: Finished difference Result 3870 states and 7276 transitions. [2018-10-26 21:28:22,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:28:22,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-10-26 21:28:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:22,654 INFO L225 Difference]: With dead ends: 3870 [2018-10-26 21:28:22,654 INFO L226 Difference]: Without dead ends: 2764 [2018-10-26 21:28:22,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2018-10-26 21:28:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2736. [2018-10-26 21:28:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2736 states. [2018-10-26 21:28:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 4487 transitions. [2018-10-26 21:28:22,841 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 4487 transitions. Word has length 36 [2018-10-26 21:28:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:22,841 INFO L481 AbstractCegarLoop]: Abstraction has 2736 states and 4487 transitions. [2018-10-26 21:28:22,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:28:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 4487 transitions. [2018-10-26 21:28:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-26 21:28:22,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:22,851 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:22,851 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:22,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1804251206, now seen corresponding path program 1 times [2018-10-26 21:28:22,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:28:22,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:28:22,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:22,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:22,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:23,302 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 21:28:24,033 WARN L179 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-26 21:28:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:24,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:24,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:28:24,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:28:24,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:28:24,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:28:24,356 INFO L87 Difference]: Start difference. First operand 2736 states and 4487 transitions. Second operand 5 states. [2018-10-26 21:28:24,559 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 21:28:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:41,083 INFO L93 Difference]: Finished difference Result 9428 states and 14930 transitions. [2018-10-26 21:28:41,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:28:41,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-26 21:28:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:41,115 INFO L225 Difference]: With dead ends: 9428 [2018-10-26 21:28:41,115 INFO L226 Difference]: Without dead ends: 6694 [2018-10-26 21:28:41,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:28:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2018-10-26 21:28:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6693. [2018-10-26 21:28:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6693 states. [2018-10-26 21:28:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6693 states to 6693 states and 9417 transitions. [2018-10-26 21:28:41,245 INFO L78 Accepts]: Start accepts. Automaton has 6693 states and 9417 transitions. Word has length 142 [2018-10-26 21:28:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:41,246 INFO L481 AbstractCegarLoop]: Abstraction has 6693 states and 9417 transitions. [2018-10-26 21:28:41,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:28:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6693 states and 9417 transitions. [2018-10-26 21:28:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-26 21:28:41,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:41,261 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:28:41,264 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:41,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:41,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1951560992, now seen corresponding path program 1 times [2018-10-26 21:28:41,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:28:41,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:28:41,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:41,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:41,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:41,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:41,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:28:41,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:28:41,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:28:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:41,717 INFO L87 Difference]: Start difference. First operand 6693 states and 9417 transitions. Second operand 4 states. [2018-10-26 21:28:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:53,210 INFO L93 Difference]: Finished difference Result 15792 states and 23310 transitions. [2018-10-26 21:28:53,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:28:53,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2018-10-26 21:28:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:53,254 INFO L225 Difference]: With dead ends: 15792 [2018-10-26 21:28:53,254 INFO L226 Difference]: Without dead ends: 9889 [2018-10-26 21:28:53,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9889 states. [2018-10-26 21:28:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9889 to 9863. [2018-10-26 21:28:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9863 states. [2018-10-26 21:28:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 13541 transitions. [2018-10-26 21:28:53,450 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 13541 transitions. Word has length 212 [2018-10-26 21:28:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:53,451 INFO L481 AbstractCegarLoop]: Abstraction has 9863 states and 13541 transitions. [2018-10-26 21:28:53,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:28:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 13541 transitions. [2018-10-26 21:28:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-26 21:28:53,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:53,455 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:28:53,455 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:53,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:53,456 INFO L82 PathProgramCache]: Analyzing trace with hash -818940230, now seen corresponding path program 1 times [2018-10-26 21:28:53,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:28:53,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:28:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:53,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:53,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:28:53,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:28:53,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:28:53,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:28:53,854 INFO L87 Difference]: Start difference. First operand 9863 states and 13541 transitions. Second operand 5 states. [2018-10-26 21:29:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:29:16,633 INFO L93 Difference]: Finished difference Result 43673 states and 61710 transitions. [2018-10-26 21:29:16,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:29:16,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2018-10-26 21:29:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:29:16,732 INFO L225 Difference]: With dead ends: 43673 [2018-10-26 21:29:16,732 INFO L226 Difference]: Without dead ends: 34600 [2018-10-26 21:29:16,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:29:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34600 states. [2018-10-26 21:29:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34600 to 34418. [2018-10-26 21:29:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34418 states. [2018-10-26 21:29:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34418 states to 34418 states and 45210 transitions. [2018-10-26 21:29:17,256 INFO L78 Accepts]: Start accepts. Automaton has 34418 states and 45210 transitions. Word has length 219 [2018-10-26 21:29:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:29:17,256 INFO L481 AbstractCegarLoop]: Abstraction has 34418 states and 45210 transitions. [2018-10-26 21:29:17,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:29:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 34418 states and 45210 transitions. [2018-10-26 21:29:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-26 21:29:17,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:29:17,263 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:29:17,263 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:29:17,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:17,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1029542179, now seen corresponding path program 1 times [2018-10-26 21:29:17,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:29:17,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:29:17,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:17,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 21:29:17,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:29:17,642 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:29:17,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:17,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:29:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:29:17,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:29:17,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-26 21:29:17,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:29:17,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:29:17,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:29:17,880 INFO L87 Difference]: Start difference. First operand 34418 states and 45210 transitions. Second operand 4 states. [2018-10-26 21:29:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:29:33,195 INFO L93 Difference]: Finished difference Result 129564 states and 171627 transitions. [2018-10-26 21:29:33,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:29:33,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-10-26 21:29:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:29:33,507 INFO L225 Difference]: With dead ends: 129564 [2018-10-26 21:29:33,508 INFO L226 Difference]: Without dead ends: 95936 [2018-10-26 21:29:33,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:29:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95936 states. [2018-10-26 21:29:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95936 to 65145. [2018-10-26 21:29:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65145 states. [2018-10-26 21:29:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65145 states to 65145 states and 80870 transitions. [2018-10-26 21:29:34,835 INFO L78 Accepts]: Start accepts. Automaton has 65145 states and 80870 transitions. Word has length 242 [2018-10-26 21:29:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:29:34,836 INFO L481 AbstractCegarLoop]: Abstraction has 65145 states and 80870 transitions. [2018-10-26 21:29:34,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:29:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 65145 states and 80870 transitions. [2018-10-26 21:29:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-26 21:29:34,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:29:34,843 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:29:34,843 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:29:34,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:34,844 INFO L82 PathProgramCache]: Analyzing trace with hash -245088399, now seen corresponding path program 1 times [2018-10-26 21:29:34,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:29:34,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:29:34,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:34,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:34,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 21:29:35,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:29:35,570 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:29:35,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:35,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:29:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:29:35,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:29:35,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-26 21:29:35,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:29:35,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:29:35,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:29:35,759 INFO L87 Difference]: Start difference. First operand 65145 states and 80870 transitions. Second operand 4 states. [2018-10-26 21:29:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:29:47,761 INFO L93 Difference]: Finished difference Result 217025 states and 268981 transitions. [2018-10-26 21:29:47,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:29:47,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-10-26 21:29:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:29:47,948 INFO L225 Difference]: With dead ends: 217025 [2018-10-26 21:29:47,948 INFO L226 Difference]: Without dead ends: 152670 [2018-10-26 21:29:48,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:29:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152670 states. [2018-10-26 21:29:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152670 to 116363. [2018-10-26 21:29:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116363 states. [2018-10-26 21:29:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116363 states to 116363 states and 139926 transitions. [2018-10-26 21:29:50,164 INFO L78 Accepts]: Start accepts. Automaton has 116363 states and 139926 transitions. Word has length 248 [2018-10-26 21:29:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:29:50,165 INFO L481 AbstractCegarLoop]: Abstraction has 116363 states and 139926 transitions. [2018-10-26 21:29:50,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:29:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 116363 states and 139926 transitions. [2018-10-26 21:29:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-26 21:29:50,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:29:50,178 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:29:50,178 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:29:50,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 48914312, now seen corresponding path program 1 times [2018-10-26 21:29:50,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:29:50,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:29:50,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:50,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:50,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:29:50,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:29:50,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:29:50,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:29:50,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:29:50,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:29:50,462 INFO L87 Difference]: Start difference. First operand 116363 states and 139926 transitions. Second operand 3 states. [2018-10-26 21:29:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:29:57,487 INFO L93 Difference]: Finished difference Result 232705 states and 279679 transitions. [2018-10-26 21:29:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:29:57,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-10-26 21:29:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:29:57,633 INFO L225 Difference]: With dead ends: 232705 [2018-10-26 21:29:57,634 INFO L226 Difference]: Without dead ends: 117132 [2018-10-26 21:29:57,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:29:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117132 states. [2018-10-26 21:29:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117132 to 114762. [2018-10-26 21:29:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114762 states. [2018-10-26 21:29:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114762 states to 114762 states and 130187 transitions. [2018-10-26 21:29:58,911 INFO L78 Accepts]: Start accepts. Automaton has 114762 states and 130187 transitions. Word has length 277 [2018-10-26 21:29:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:29:58,911 INFO L481 AbstractCegarLoop]: Abstraction has 114762 states and 130187 transitions. [2018-10-26 21:29:58,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:29:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 114762 states and 130187 transitions. [2018-10-26 21:29:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-26 21:29:58,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:29:58,938 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:29:58,938 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:29:58,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2081388679, now seen corresponding path program 1 times [2018-10-26 21:29:58,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:29:58,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:29:58,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:58,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:58,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-10-26 21:29:59,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:29:59,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:29:59,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:29:59,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:29:59,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:29:59,449 INFO L87 Difference]: Start difference. First operand 114762 states and 130187 transitions. Second operand 3 states. [2018-10-26 21:30:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:08,774 INFO L93 Difference]: Finished difference Result 305954 states and 347425 transitions. [2018-10-26 21:30:08,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:30:08,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-10-26 21:30:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:09,057 INFO L225 Difference]: With dead ends: 305954 [2018-10-26 21:30:09,057 INFO L226 Difference]: Without dead ends: 191982 [2018-10-26 21:30:09,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:30:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191982 states. [2018-10-26 21:30:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191982 to 191981. [2018-10-26 21:30:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191981 states. [2018-10-26 21:30:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191981 states to 191981 states and 213227 transitions. [2018-10-26 21:30:10,931 INFO L78 Accepts]: Start accepts. Automaton has 191981 states and 213227 transitions. Word has length 392 [2018-10-26 21:30:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:10,932 INFO L481 AbstractCegarLoop]: Abstraction has 191981 states and 213227 transitions. [2018-10-26 21:30:10,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:30:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 191981 states and 213227 transitions. [2018-10-26 21:30:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-10-26 21:30:10,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:10,964 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:30:10,965 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:10,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:10,965 INFO L82 PathProgramCache]: Analyzing trace with hash -259977617, now seen corresponding path program 1 times [2018-10-26 21:30:10,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:30:10,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:30:10,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:10,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:10,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-10-26 21:30:11,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:30:11,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:30:11,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:30:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:30:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:11,359 INFO L87 Difference]: Start difference. First operand 191981 states and 213227 transitions. Second operand 4 states. [2018-10-26 21:30:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:22,870 INFO L93 Difference]: Finished difference Result 393407 states and 436904 transitions. [2018-10-26 21:30:22,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:30:22,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 462 [2018-10-26 21:30:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:23,088 INFO L225 Difference]: With dead ends: 393407 [2018-10-26 21:30:23,089 INFO L226 Difference]: Without dead ends: 195890 [2018-10-26 21:30:23,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195890 states. [2018-10-26 21:30:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195890 to 180120. [2018-10-26 21:30:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180120 states. [2018-10-26 21:30:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180120 states to 180120 states and 193018 transitions. [2018-10-26 21:30:25,975 INFO L78 Accepts]: Start accepts. Automaton has 180120 states and 193018 transitions. Word has length 462 [2018-10-26 21:30:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:25,976 INFO L481 AbstractCegarLoop]: Abstraction has 180120 states and 193018 transitions. [2018-10-26 21:30:25,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:30:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 180120 states and 193018 transitions. [2018-10-26 21:30:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-26 21:30:26,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:26,002 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:30:26,002 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:26,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2050105747, now seen corresponding path program 1 times [2018-10-26 21:30:26,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:30:26,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:30:26,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:26,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:26,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:26,503 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 21:30:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-26 21:30:26,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:30:26,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:30:26,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:30:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:30:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:26,808 INFO L87 Difference]: Start difference. First operand 180120 states and 193018 transitions. Second operand 4 states. [2018-10-26 21:30:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:43,313 INFO L93 Difference]: Finished difference Result 361044 states and 386974 transitions. [2018-10-26 21:30:43,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:30:43,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 520 [2018-10-26 21:30:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:43,549 INFO L225 Difference]: With dead ends: 361044 [2018-10-26 21:30:43,549 INFO L226 Difference]: Without dead ends: 176183 [2018-10-26 21:30:43,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176183 states. [2018-10-26 21:30:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176183 to 167488. [2018-10-26 21:30:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167488 states. [2018-10-26 21:30:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167488 states to 167488 states and 176393 transitions. [2018-10-26 21:30:45,287 INFO L78 Accepts]: Start accepts. Automaton has 167488 states and 176393 transitions. Word has length 520 [2018-10-26 21:30:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:45,288 INFO L481 AbstractCegarLoop]: Abstraction has 167488 states and 176393 transitions. [2018-10-26 21:30:45,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:30:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 167488 states and 176393 transitions. [2018-10-26 21:30:45,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-26 21:30:45,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:45,308 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:30:45,308 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:45,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:45,308 INFO L82 PathProgramCache]: Analyzing trace with hash -768125364, now seen corresponding path program 1 times [2018-10-26 21:30:45,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:30:45,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:30:45,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:45,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:45,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-10-26 21:30:45,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:30:45,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:30:45,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:30:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:30:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:45,723 INFO L87 Difference]: Start difference. First operand 167488 states and 176393 transitions. Second operand 4 states. [2018-10-26 21:30:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:57,193 INFO L93 Difference]: Finished difference Result 333433 states and 351219 transitions. [2018-10-26 21:30:57,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:30:57,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 530 [2018-10-26 21:30:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:57,365 INFO L225 Difference]: With dead ends: 333433 [2018-10-26 21:30:57,365 INFO L226 Difference]: Without dead ends: 161986 [2018-10-26 21:30:57,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:30:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161986 states. [2018-10-26 21:30:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161986 to 159581. [2018-10-26 21:30:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159581 states. [2018-10-26 21:30:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159581 states to 159581 states and 165831 transitions. [2018-10-26 21:30:59,498 INFO L78 Accepts]: Start accepts. Automaton has 159581 states and 165831 transitions. Word has length 530 [2018-10-26 21:30:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:59,499 INFO L481 AbstractCegarLoop]: Abstraction has 159581 states and 165831 transitions. [2018-10-26 21:30:59,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:30:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 159581 states and 165831 transitions. [2018-10-26 21:30:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2018-10-26 21:30:59,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:59,591 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:30:59,591 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:59,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:59,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1621587229, now seen corresponding path program 1 times [2018-10-26 21:30:59,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:30:59,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:30:59,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:59,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:59,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 21:31:00,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:31:00,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:31:00,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:31:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:31:00,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:31:00,987 INFO L87 Difference]: Start difference. First operand 159581 states and 165831 transitions. Second operand 4 states. [2018-10-26 21:31:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:31:09,103 INFO L93 Difference]: Finished difference Result 327041 states and 339758 transitions. [2018-10-26 21:31:09,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:31:09,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1012 [2018-10-26 21:31:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:31:09,268 INFO L225 Difference]: With dead ends: 327041 [2018-10-26 21:31:09,268 INFO L226 Difference]: Without dead ends: 155609 [2018-10-26 21:31:09,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:31:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155609 states. [2018-10-26 21:31:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155609 to 147728. [2018-10-26 21:31:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147728 states. [2018-10-26 21:31:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147728 states to 147728 states and 153100 transitions. [2018-10-26 21:31:11,129 INFO L78 Accepts]: Start accepts. Automaton has 147728 states and 153100 transitions. Word has length 1012 [2018-10-26 21:31:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:31:11,129 INFO L481 AbstractCegarLoop]: Abstraction has 147728 states and 153100 transitions. [2018-10-26 21:31:11,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:31:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 147728 states and 153100 transitions. [2018-10-26 21:31:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-10-26 21:31:11,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:31:11,208 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:31:11,209 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:31:11,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:31:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1108830039, now seen corresponding path program 1 times [2018-10-26 21:31:11,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:31:11,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:31:11,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:31:11,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:31:11,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:31:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:12,660 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 21:31:12,965 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2018-10-26 21:31:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 335 proven. 291 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-26 21:31:16,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:31:16,955 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-26 21:31:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:31:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:31:17,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:31:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-26 21:31:19,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:31:19,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-26 21:31:19,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:31:19,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:31:19,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:31:19,353 INFO L87 Difference]: Start difference. First operand 147728 states and 153100 transitions. Second operand 11 states. Received shutdown request... [2018-10-26 21:31:24,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:31:24,925 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 21:31:24,931 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 21:31:24,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:31:24 BoogieIcfgContainer [2018-10-26 21:31:24,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:31:24,932 INFO L168 Benchmark]: Toolchain (without parser) took 223604.43 ms. Allocated memory was 1.5 GB in the beginning and 4.5 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-26 21:31:24,934 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:31:24,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2553.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:31:24,935 INFO L168 Benchmark]: Boogie Procedure Inliner took 957.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 812.1 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:31:24,936 INFO L168 Benchmark]: Boogie Preprocessor took 442.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 72.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 7.1 GB. [2018-10-26 21:31:24,937 INFO L168 Benchmark]: RCFGBuilder took 15564.18 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 252.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 MB). Peak memory consumption was 622.9 MB. Max. memory is 7.1 GB. [2018-10-26 21:31:24,938 INFO L168 Benchmark]: TraceAbstraction took 204080.48 ms. Allocated memory was 2.6 GB in the beginning and 4.5 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -453.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-26 21:31:24,943 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2553.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 957.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 812.1 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 442.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 72.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 15564.18 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 252.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 MB). Peak memory consumption was 622.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 204080.48 ms. Allocated memory was 2.6 GB in the beginning and 4.5 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -453.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 117). Cancelled while BasicCegarLoop was constructing difference of abstraction (147728states) and FLOYD_HOARE automaton (currently 6 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (6776 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 203.9s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 171.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11352 SDtfs, 27432 SDslu, 3341 SDs, 0 SdLazy, 58459 SolverSat, 14544 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 139.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1590 GetRequests, 1543 SyntacticMatches, 10 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191981occurred in iteration=8, 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: 15.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 104457 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 6852 NumberOfCodeBlocks, 6852 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6836 ConstructedInterpolants, 0 QuantifiedInterpolants, 28170180 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1881 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 5689/5988 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown