java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:50:02,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:50:02,774 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:50:02,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:50:02,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:50:02,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:50:02,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:50:02,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:50:02,801 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:50:02,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:50:02,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:50:02,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:50:02,812 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:50:02,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:50:02,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:50:02,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:50:02,819 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:50:02,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:50:02,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:50:02,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:50:02,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:50:02,832 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:50:02,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:50:02,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:50:02,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:50:02,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:50:02,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:50:02,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:50:02,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:50:02,840 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:50:02,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:50:02,841 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:50:02,841 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:50:02,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:50:02,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:50:02,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:50:02,845 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-23 18:50:02,870 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:50:02,870 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:50:02,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:50:02,875 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:50:02,876 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:50:02,879 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:50:02,879 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:50:02,879 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:50:02,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:50:02,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:50:02,880 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:50:02,880 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:50:02,880 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:50:02,880 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:50:02,881 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:50:02,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:50:02,881 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:50:02,881 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:50:02,882 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:50:02,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:50:02,882 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:50:02,882 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:50:02,882 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:50:02,884 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:50:02,884 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:50:02,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:50:02,884 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:50:02,885 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:50:02,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:50:02,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:50:02,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:50:02,969 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:50:02,970 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:50:02,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c [2018-10-23 18:50:03,034 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e0541aecc/8ce46cb5c1ed4a9ea5248d6b2769215c/FLAG49754cc43 [2018-10-23 18:50:03,712 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:50:03,715 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c [2018-10-23 18:50:03,736 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e0541aecc/8ce46cb5c1ed4a9ea5248d6b2769215c/FLAG49754cc43 [2018-10-23 18:50:03,753 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e0541aecc/8ce46cb5c1ed4a9ea5248d6b2769215c [2018-10-23 18:50:03,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:50:03,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:50:03,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:50:03,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:50:03,770 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:50:03,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:50:03" (1/1) ... [2018-10-23 18:50:03,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ed544a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:03, skipping insertion in model container [2018-10-23 18:50:03,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:50:03" (1/1) ... [2018-10-23 18:50:03,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:50:03,874 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:50:04,687 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:50:04,693 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:50:05,043 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:50:05,069 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:50:05,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05 WrapperNode [2018-10-23 18:50:05,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:50:05,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:50:05,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:50:05,071 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:50:05,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (1/1) ... [2018-10-23 18:50:05,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (1/1) ... [2018-10-23 18:50:05,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:50:05,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:50:05,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:50:05,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:50:05,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (1/1) ... [2018-10-23 18:50:05,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (1/1) ... [2018-10-23 18:50:05,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (1/1) ... [2018-10-23 18:50:05,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (1/1) ... [2018-10-23 18:50:05,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (1/1) ... [2018-10-23 18:50:05,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (1/1) ... [2018-10-23 18:50:05,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (1/1) ... [2018-10-23 18:50:05,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:50:05,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:50:05,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:50:05,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:50:05,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (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-23 18:50:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:50:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:50:05,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:50:10,869 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:50:10,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:50:10 BoogieIcfgContainer [2018-10-23 18:50:10,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:50:10,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:50:10,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:50:10,875 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:50:10,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:50:03" (1/3) ... [2018-10-23 18:50:10,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682e06ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:50:10, skipping insertion in model container [2018-10-23 18:50:10,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:05" (2/3) ... [2018-10-23 18:50:10,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682e06ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:50:10, skipping insertion in model container [2018-10-23 18:50:10,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:50:10" (3/3) ... [2018-10-23 18:50:10,879 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label07_true-unreach-call.c [2018-10-23 18:50:10,890 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:50:10,901 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:50:10,920 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:50:10,959 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:50:10,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:50:10,960 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:50:10,960 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:50:10,960 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:50:10,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:50:10,961 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:50:10,961 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:50:10,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:50:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:50:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-23 18:50:11,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:11,008 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:11,011 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:11,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash 418458546, now seen corresponding path program 1 times [2018-10-23 18:50:11,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:11,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:11,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:11,952 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-23 18:50:11,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:11,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:11,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:11,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:11,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:11,983 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:50:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:15,927 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-23 18:50:15,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:15,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-10-23 18:50:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:15,955 INFO L225 Difference]: With dead ends: 1027 [2018-10-23 18:50:15,955 INFO L226 Difference]: Without dead ends: 717 [2018-10-23 18:50:15,961 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-23 18:50:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-23 18:50:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-23 18:50:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-23 18:50:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-23 18:50:16,080 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 173 [2018-10-23 18:50:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:16,081 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-23 18:50:16,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-23 18:50:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-23 18:50:16,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:16,104 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:16,104 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:16,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash 72085267, now seen corresponding path program 1 times [2018-10-23 18:50:16,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:16,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:16,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:16,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:16,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:16,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:16,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:16,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:16,273 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-23 18:50:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:18,628 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-23 18:50:18,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:18,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-23 18:50:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:18,638 INFO L225 Difference]: With dead ends: 2058 [2018-10-23 18:50:18,638 INFO L226 Difference]: Without dead ends: 1345 [2018-10-23 18:50:18,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-23 18:50:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-23 18:50:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-23 18:50:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-23 18:50:18,688 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 182 [2018-10-23 18:50:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:18,688 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-23 18:50:18,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-23 18:50:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-23 18:50:18,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:18,693 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:18,693 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:18,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2004095041, now seen corresponding path program 1 times [2018-10-23 18:50:18,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:18,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:18,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:18,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:18,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:18,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:18,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:18,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:18,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:18,988 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-23 18:50:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:22,432 INFO L93 Difference]: Finished difference Result 3896 states and 6120 transitions. [2018-10-23 18:50:22,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:22,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-23 18:50:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:22,448 INFO L225 Difference]: With dead ends: 3896 [2018-10-23 18:50:22,448 INFO L226 Difference]: Without dead ends: 2567 [2018-10-23 18:50:22,451 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-23 18:50:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2018-10-23 18:50:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2565. [2018-10-23 18:50:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2018-10-23 18:50:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3748 transitions. [2018-10-23 18:50:22,511 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3748 transitions. Word has length 190 [2018-10-23 18:50:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:22,512 INFO L481 AbstractCegarLoop]: Abstraction has 2565 states and 3748 transitions. [2018-10-23 18:50:22,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3748 transitions. [2018-10-23 18:50:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-23 18:50:22,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:22,520 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:22,520 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:22,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash 704749675, now seen corresponding path program 1 times [2018-10-23 18:50:22,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:22,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:22,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:22,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:22,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:22,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:22,700 INFO L87 Difference]: Start difference. First operand 2565 states and 3748 transitions. Second operand 4 states. [2018-10-23 18:50:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:24,295 INFO L93 Difference]: Finished difference Result 5099 states and 7455 transitions. [2018-10-23 18:50:24,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:24,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-10-23 18:50:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:24,311 INFO L225 Difference]: With dead ends: 5099 [2018-10-23 18:50:24,311 INFO L226 Difference]: Without dead ends: 2536 [2018-10-23 18:50:24,315 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-23 18:50:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2018-10-23 18:50:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2018-10-23 18:50:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2018-10-23 18:50:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3609 transitions. [2018-10-23 18:50:24,362 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3609 transitions. Word has length 201 [2018-10-23 18:50:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:24,362 INFO L481 AbstractCegarLoop]: Abstraction has 2536 states and 3609 transitions. [2018-10-23 18:50:24,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3609 transitions. [2018-10-23 18:50:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-23 18:50:24,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:24,369 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:24,369 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:24,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:24,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1273453360, now seen corresponding path program 1 times [2018-10-23 18:50:24,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:24,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:24,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:24,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:24,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:24,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:24,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:24,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:24,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:24,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:24,573 INFO L87 Difference]: Start difference. First operand 2536 states and 3609 transitions. Second operand 4 states. [2018-10-23 18:50:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:26,871 INFO L93 Difference]: Finished difference Result 10131 states and 14422 transitions. [2018-10-23 18:50:26,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:26,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-10-23 18:50:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:26,903 INFO L225 Difference]: With dead ends: 10131 [2018-10-23 18:50:26,903 INFO L226 Difference]: Without dead ends: 7597 [2018-10-23 18:50:26,909 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-23 18:50:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2018-10-23 18:50:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 7593. [2018-10-23 18:50:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-23 18:50:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 10758 transitions. [2018-10-23 18:50:27,049 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 10758 transitions. Word has length 203 [2018-10-23 18:50:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:27,050 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 10758 transitions. [2018-10-23 18:50:27,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 10758 transitions. [2018-10-23 18:50:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-23 18:50:27,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:27,060 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:27,061 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:27,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2049995315, now seen corresponding path program 1 times [2018-10-23 18:50:27,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:27,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:27,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:27,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:27,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-23 18:50:27,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:27,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:27,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:27,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:27,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:27,194 INFO L87 Difference]: Start difference. First operand 7593 states and 10758 transitions. Second operand 3 states. [2018-10-23 18:50:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:28,688 INFO L93 Difference]: Finished difference Result 15190 states and 21526 transitions. [2018-10-23 18:50:28,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:28,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-10-23 18:50:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:28,712 INFO L225 Difference]: With dead ends: 15190 [2018-10-23 18:50:28,712 INFO L226 Difference]: Without dead ends: 7599 [2018-10-23 18:50:28,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-10-23 18:50:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 7593. [2018-10-23 18:50:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-23 18:50:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 9699 transitions. [2018-10-23 18:50:28,876 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 9699 transitions. Word has length 208 [2018-10-23 18:50:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:28,876 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 9699 transitions. [2018-10-23 18:50:28,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 9699 transitions. [2018-10-23 18:50:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-23 18:50:28,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:28,885 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:50:28,886 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:28,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:28,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1773650990, now seen corresponding path program 1 times [2018-10-23 18:50:28,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:28,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:28,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:28,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:29,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:29,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:29,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:29,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:29,115 INFO L87 Difference]: Start difference. First operand 7593 states and 9699 transitions. Second operand 3 states. [2018-10-23 18:50:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:30,876 INFO L93 Difference]: Finished difference Result 22543 states and 28853 transitions. [2018-10-23 18:50:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:30,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-10-23 18:50:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:30,924 INFO L225 Difference]: With dead ends: 22543 [2018-10-23 18:50:30,925 INFO L226 Difference]: Without dead ends: 14952 [2018-10-23 18:50:30,934 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-23 18:50:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14952 states. [2018-10-23 18:50:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14952 to 14943. [2018-10-23 18:50:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-23 18:50:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 18430 transitions. [2018-10-23 18:50:31,147 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 18430 transitions. Word has length 225 [2018-10-23 18:50:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:31,147 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 18430 transitions. [2018-10-23 18:50:31,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 18430 transitions. [2018-10-23 18:50:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-23 18:50:31,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:31,158 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:50:31,159 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:31,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1682463316, now seen corresponding path program 1 times [2018-10-23 18:50:31,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:31,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:31,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:31,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:31,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:31,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:31,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:31,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:31,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:31,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:31,347 INFO L87 Difference]: Start difference. First operand 14943 states and 18430 transitions. Second operand 4 states. [2018-10-23 18:50:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:32,551 INFO L93 Difference]: Finished difference Result 29884 states and 36858 transitions. [2018-10-23 18:50:32,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:32,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-10-23 18:50:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:32,582 INFO L225 Difference]: With dead ends: 29884 [2018-10-23 18:50:32,582 INFO L226 Difference]: Without dead ends: 14943 [2018-10-23 18:50:32,596 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-23 18:50:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14943 states. [2018-10-23 18:50:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14943 to 14943. [2018-10-23 18:50:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-23 18:50:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 17684 transitions. [2018-10-23 18:50:32,786 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 17684 transitions. Word has length 228 [2018-10-23 18:50:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:32,787 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 17684 transitions. [2018-10-23 18:50:32,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 17684 transitions. [2018-10-23 18:50:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-23 18:50:32,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:32,798 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, 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] [2018-10-23 18:50:32,798 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:32,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:32,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1318810977, now seen corresponding path program 1 times [2018-10-23 18:50:32,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:32,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:32,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:32,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:32,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-23 18:50:32,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:32,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:32,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:32,995 INFO L87 Difference]: Start difference. First operand 14943 states and 17684 transitions. Second operand 3 states. [2018-10-23 18:50:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:34,496 INFO L93 Difference]: Finished difference Result 37363 states and 44044 transitions. [2018-10-23 18:50:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:34,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-23 18:50:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:34,541 INFO L225 Difference]: With dead ends: 37363 [2018-10-23 18:50:34,542 INFO L226 Difference]: Without dead ends: 22422 [2018-10-23 18:50:34,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22422 states. [2018-10-23 18:50:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22422 to 22417. [2018-10-23 18:50:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22417 states. [2018-10-23 18:50:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22417 states to 22417 states and 26323 transitions. [2018-10-23 18:50:34,829 INFO L78 Accepts]: Start accepts. Automaton has 22417 states and 26323 transitions. Word has length 237 [2018-10-23 18:50:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:34,829 INFO L481 AbstractCegarLoop]: Abstraction has 22417 states and 26323 transitions. [2018-10-23 18:50:34,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 22417 states and 26323 transitions. [2018-10-23 18:50:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-23 18:50:34,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:34,849 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-23 18:50:34,850 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:34,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash -757390539, now seen corresponding path program 1 times [2018-10-23 18:50:34,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:34,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:34,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:34,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:34,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:35,199 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:50:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-23 18:50:35,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:50:35,382 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-23 18:50:35,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:35,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:50:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-23 18:50:35,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:50:35,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-23 18:50:35,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:50:35,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:50:35,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:50:35,806 INFO L87 Difference]: Start difference. First operand 22417 states and 26323 transitions. Second operand 6 states. [2018-10-23 18:50:38,710 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-23 18:50:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:44,463 INFO L93 Difference]: Finished difference Result 130790 states and 153530 transitions. [2018-10-23 18:50:44,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 18:50:44,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2018-10-23 18:50:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:44,656 INFO L225 Difference]: With dead ends: 130790 [2018-10-23 18:50:44,656 INFO L226 Difference]: Without dead ends: 108375 [2018-10-23 18:50:44,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:50:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108375 states. [2018-10-23 18:50:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108375 to 106497. [2018-10-23 18:50:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106497 states. [2018-10-23 18:50:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106497 states to 106497 states and 119844 transitions. [2018-10-23 18:50:46,132 INFO L78 Accepts]: Start accepts. Automaton has 106497 states and 119844 transitions. Word has length 245 [2018-10-23 18:50:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:46,132 INFO L481 AbstractCegarLoop]: Abstraction has 106497 states and 119844 transitions. [2018-10-23 18:50:46,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:50:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 106497 states and 119844 transitions. [2018-10-23 18:50:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-23 18:50:46,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:46,201 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:50:46,202 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:46,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash 778143398, now seen corresponding path program 1 times [2018-10-23 18:50:46,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:46,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:46,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:46,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:46,542 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:50:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-23 18:50:46,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:46,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:46,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:46,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:46,636 INFO L87 Difference]: Start difference. First operand 106497 states and 119844 transitions. Second operand 4 states. [2018-10-23 18:50:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:50,430 INFO L93 Difference]: Finished difference Result 352610 states and 394075 transitions. [2018-10-23 18:50:50,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:50,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-10-23 18:50:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:50,904 INFO L225 Difference]: With dead ends: 352610 [2018-10-23 18:50:50,904 INFO L226 Difference]: Without dead ends: 246115 [2018-10-23 18:50:51,012 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-23 18:50:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246115 states. [2018-10-23 18:50:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246115 to 184592. [2018-10-23 18:50:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184592 states. [2018-10-23 18:50:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184592 states to 184592 states and 204846 transitions. [2018-10-23 18:50:54,159 INFO L78 Accepts]: Start accepts. Automaton has 184592 states and 204846 transitions. Word has length 315 [2018-10-23 18:50:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:54,160 INFO L481 AbstractCegarLoop]: Abstraction has 184592 states and 204846 transitions. [2018-10-23 18:50:54,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 184592 states and 204846 transitions. [2018-10-23 18:50:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-23 18:50:54,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:54,201 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:54,202 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:54,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:54,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1158786570, now seen corresponding path program 1 times [2018-10-23 18:50:54,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:54,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-23 18:50:54,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:54,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:54,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:54,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:54,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:54,674 INFO L87 Difference]: Start difference. First operand 184592 states and 204846 transitions. Second operand 3 states. [2018-10-23 18:50:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:58,506 INFO L93 Difference]: Finished difference Result 430750 states and 479158 transitions. [2018-10-23 18:50:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:58,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-10-23 18:50:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:58,908 INFO L225 Difference]: With dead ends: 430750 [2018-10-23 18:50:58,908 INFO L226 Difference]: Without dead ends: 246160 [2018-10-23 18:50:59,047 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-23 18:50:59,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246160 states. [2018-10-23 18:51:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246160 to 234843. [2018-10-23 18:51:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234843 states. [2018-10-23 18:51:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234843 states to 234843 states and 262264 transitions. [2018-10-23 18:51:02,879 INFO L78 Accepts]: Start accepts. Automaton has 234843 states and 262264 transitions. Word has length 330 [2018-10-23 18:51:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:02,880 INFO L481 AbstractCegarLoop]: Abstraction has 234843 states and 262264 transitions. [2018-10-23 18:51:02,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:51:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 234843 states and 262264 transitions. [2018-10-23 18:51:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-23 18:51:02,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:02,922 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:51:02,922 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:02,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1828150633, now seen corresponding path program 1 times [2018-10-23 18:51:02,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:02,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:02,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-23 18:51:03,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:03,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:51:03,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:51:03,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:51:03,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:03,157 INFO L87 Difference]: Start difference. First operand 234843 states and 262264 transitions. Second operand 3 states. [2018-10-23 18:51:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:05,154 INFO L93 Difference]: Finished difference Result 469669 states and 524511 transitions. [2018-10-23 18:51:05,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:51:05,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2018-10-23 18:51:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:05,465 INFO L225 Difference]: With dead ends: 469669 [2018-10-23 18:51:05,465 INFO L226 Difference]: Without dead ends: 234828 [2018-10-23 18:51:07,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234828 states. [2018-10-23 18:51:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234828 to 234828. [2018-10-23 18:51:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234828 states. [2018-10-23 18:51:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234828 states to 234828 states and 262234 transitions. [2018-10-23 18:51:16,616 INFO L78 Accepts]: Start accepts. Automaton has 234828 states and 262234 transitions. Word has length 336 [2018-10-23 18:51:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:16,617 INFO L481 AbstractCegarLoop]: Abstraction has 234828 states and 262234 transitions. [2018-10-23 18:51:16,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:51:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 234828 states and 262234 transitions. [2018-10-23 18:51:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-23 18:51:16,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:16,666 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:16,666 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:16,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:16,667 INFO L82 PathProgramCache]: Analyzing trace with hash 312285425, now seen corresponding path program 1 times [2018-10-23 18:51:16,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:16,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:16,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:16,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:16,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-23 18:51:16,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:16,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:16,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:51:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:51:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:17,000 INFO L87 Difference]: Start difference. First operand 234828 states and 262234 transitions. Second operand 3 states. [2018-10-23 18:51:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:21,065 INFO L93 Difference]: Finished difference Result 457996 states and 511131 transitions. [2018-10-23 18:51:21,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:51:21,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-23 18:51:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:21,374 INFO L225 Difference]: With dead ends: 457996 [2018-10-23 18:51:21,375 INFO L226 Difference]: Without dead ends: 223170 [2018-10-23 18:51:21,480 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-23 18:51:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223170 states. [2018-10-23 18:51:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223170 to 213295. [2018-10-23 18:51:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213295 states. [2018-10-23 18:51:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213295 states to 213295 states and 231973 transitions. [2018-10-23 18:51:24,713 INFO L78 Accepts]: Start accepts. Automaton has 213295 states and 231973 transitions. Word has length 347 [2018-10-23 18:51:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:24,714 INFO L481 AbstractCegarLoop]: Abstraction has 213295 states and 231973 transitions. [2018-10-23 18:51:24,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:51:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 213295 states and 231973 transitions. [2018-10-23 18:51:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-23 18:51:24,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:24,742 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:24,742 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:24,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1408009665, now seen corresponding path program 1 times [2018-10-23 18:51:24,743 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:24,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:24,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:24,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:24,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:25,416 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-23 18:51:25,623 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-10-23 18:51:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-23 18:51:25,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:51:25,801 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-23 18:51:25,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:25,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:51:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-23 18:51:26,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:51:26,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-23 18:51:26,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:51:26,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:51:26,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:51:26,997 INFO L87 Difference]: Start difference. First operand 213295 states and 231973 transitions. Second operand 6 states. [2018-10-23 18:51:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:34,186 INFO L93 Difference]: Finished difference Result 902872 states and 981569 transitions. [2018-10-23 18:51:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 18:51:34,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2018-10-23 18:51:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:35,198 INFO L225 Difference]: With dead ends: 902872 [2018-10-23 18:51:35,198 INFO L226 Difference]: Without dead ends: 689579 [2018-10-23 18:51:35,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:51:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689579 states. [2018-10-23 18:51:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689579 to 432775. [2018-10-23 18:51:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432775 states. [2018-10-23 18:51:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432775 states to 432775 states and 470790 transitions. [2018-10-23 18:51:45,017 INFO L78 Accepts]: Start accepts. Automaton has 432775 states and 470790 transitions. Word has length 362 [2018-10-23 18:51:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:45,017 INFO L481 AbstractCegarLoop]: Abstraction has 432775 states and 470790 transitions. [2018-10-23 18:51:45,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:51:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 432775 states and 470790 transitions. [2018-10-23 18:51:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-23 18:51:45,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:45,055 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:51:45,055 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:45,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash -185387452, now seen corresponding path program 1 times [2018-10-23 18:51:45,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:45,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:45,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:45,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:45,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-23 18:51:45,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:45,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:45,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:45,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:45,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:45,484 INFO L87 Difference]: Start difference. First operand 432775 states and 470790 transitions. Second operand 4 states. [2018-10-23 18:51:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:54,997 INFO L93 Difference]: Finished difference Result 874644 states and 951201 transitions. [2018-10-23 18:51:54,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:51:54,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-10-23 18:51:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:55,654 INFO L225 Difference]: With dead ends: 874644 [2018-10-23 18:51:55,654 INFO L226 Difference]: Without dead ends: 441871 [2018-10-23 18:51:55,888 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-23 18:51:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441871 states. [2018-10-23 18:52:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441871 to 441362. [2018-10-23 18:52:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441362 states. [2018-10-23 18:52:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441362 states to 441362 states and 478308 transitions. [2018-10-23 18:52:03,761 INFO L78 Accepts]: Start accepts. Automaton has 441362 states and 478308 transitions. Word has length 374 [2018-10-23 18:52:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:03,762 INFO L481 AbstractCegarLoop]: Abstraction has 441362 states and 478308 transitions. [2018-10-23 18:52:03,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 441362 states and 478308 transitions. [2018-10-23 18:52:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-23 18:52:03,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:03,822 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, 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, 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-23 18:52:03,823 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:03,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1184387920, now seen corresponding path program 1 times [2018-10-23 18:52:03,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:03,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:03,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-23 18:52:04,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:04,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:04,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:52:04,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:52:04,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:52:04,229 INFO L87 Difference]: Start difference. First operand 441362 states and 478308 transitions. Second operand 3 states. [2018-10-23 18:52:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:09,438 INFO L93 Difference]: Finished difference Result 912615 states and 988718 transitions. [2018-10-23 18:52:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:09,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 407 [2018-10-23 18:52:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:10,156 INFO L225 Difference]: With dead ends: 912615 [2018-10-23 18:52:10,156 INFO L226 Difference]: Without dead ends: 471255 [2018-10-23 18:52:10,397 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-23 18:52:10,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471255 states. [2018-10-23 18:52:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471255 to 457308. [2018-10-23 18:52:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457308 states. [2018-10-23 18:52:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457308 states to 457308 states and 495106 transitions. [2018-10-23 18:52:18,683 INFO L78 Accepts]: Start accepts. Automaton has 457308 states and 495106 transitions. Word has length 407 [2018-10-23 18:52:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:18,683 INFO L481 AbstractCegarLoop]: Abstraction has 457308 states and 495106 transitions. [2018-10-23 18:52:18,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 457308 states and 495106 transitions. [2018-10-23 18:52:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-23 18:52:18,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:18,724 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:52:18,725 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:18,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1886071870, now seen corresponding path program 1 times [2018-10-23 18:52:18,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:18,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:18,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:18,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:18,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 391 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-23 18:52:19,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:52:19,242 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-23 18:52:19,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:19,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:52:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 35 proven. 225 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-23 18:52:26,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 18:52:26,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-23 18:52:26,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 18:52:26,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 18:52:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-23 18:52:26,680 INFO L87 Difference]: Start difference. First operand 457308 states and 495106 transitions. Second operand 8 states. [2018-10-23 18:52:33,498 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-23 18:52:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:42,207 INFO L93 Difference]: Finished difference Result 1402132 states and 1509921 transitions. [2018-10-23 18:52:42,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-23 18:52:42,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 410 [2018-10-23 18:52:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:43,818 INFO L225 Difference]: With dead ends: 1402132 [2018-10-23 18:52:43,818 INFO L226 Difference]: Without dead ends: 944826 [2018-10-23 18:52:44,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-10-23 18:52:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944826 states. [2018-10-23 18:52:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944826 to 806296. [2018-10-23 18:52:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806296 states. [2018-10-23 18:53:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806296 states to 806296 states and 867766 transitions. [2018-10-23 18:53:01,068 INFO L78 Accepts]: Start accepts. Automaton has 806296 states and 867766 transitions. Word has length 410 [2018-10-23 18:53:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:01,069 INFO L481 AbstractCegarLoop]: Abstraction has 806296 states and 867766 transitions. [2018-10-23 18:53:01,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 18:53:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 806296 states and 867766 transitions. [2018-10-23 18:53:01,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-23 18:53:01,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:01,139 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:53:01,139 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:01,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:01,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1765344062, now seen corresponding path program 1 times [2018-10-23 18:53:01,140 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:01,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:01,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:01,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:01,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-10-23 18:53:01,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:01,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:01,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:01,866 INFO L87 Difference]: Start difference. First operand 806296 states and 867766 transitions. Second operand 4 states. [2018-10-23 18:53:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:21,937 INFO L93 Difference]: Finished difference Result 2048527 states and 2204815 transitions. [2018-10-23 18:53:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:21,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 424 [2018-10-23 18:53:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:24,187 INFO L225 Difference]: With dead ends: 2048527 [2018-10-23 18:53:24,187 INFO L226 Difference]: Without dead ends: 1242233 Received shutdown request... [2018-10-23 18:53:26,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242233 states. [2018-10-23 18:53:27,047 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:53:27,050 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:53:27,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:53:27 BoogieIcfgContainer [2018-10-23 18:53:27,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:53:27,052 INFO L168 Benchmark]: Toolchain (without parser) took 203287.83 ms. Allocated memory was 1.6 GB in the beginning and 6.4 GB in the end (delta: 4.9 GB). Free memory was 1.4 GB in the beginning and 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:27,053 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:53:27,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1304.38 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:27,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 299.58 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -886.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:27,055 INFO L168 Benchmark]: Boogie Preprocessor took 156.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:27,056 INFO L168 Benchmark]: RCFGBuilder took 5342.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 271.2 MB). Peak memory consumption was 271.2 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:27,057 INFO L168 Benchmark]: TraceAbstraction took 196179.82 ms. Allocated memory was 2.3 GB in the beginning and 6.4 GB in the end (delta: 4.1 GB). Free memory was 2.0 GB in the beginning and 4.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:27,062 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.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1304.38 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 299.58 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -886.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 156.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5342.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 271.2 MB). Peak memory consumption was 271.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196179.82 ms. Allocated memory was 2.3 GB in the beginning and 6.4 GB in the end (delta: 4.1 GB). Free memory was 2.0 GB in the beginning and 4.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1551]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1551). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 196.1s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 113.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4835 SDtfs, 17120 SDslu, 2883 SDs, 0 SdLazy, 22520 SolverSat, 4280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1112 GetRequests, 1052 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806296occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 65.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 494425 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 6414 NumberOfCodeBlocks, 6414 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6392 ConstructedInterpolants, 0 QuantifiedInterpolants, 6435003 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1768 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 3848/4103 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown