java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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/Problem01_label12_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:49:07,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:49:07,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:49:07,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:49:07,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:49:07,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:49:07,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:49:07,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:49:07,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:49:07,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:49:07,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:49:07,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:49:07,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:49:07,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:49:07,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:49:07,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:49:07,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:49:07,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:49:07,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:49:07,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:49:07,073 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:49:07,075 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:49:07,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:49:07,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:49:07,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:49:07,082 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:49:07,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:49:07,085 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:49:07,085 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:49:07,086 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:49:07,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:49:07,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:49:07,087 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:49:07,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:49:07,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:49:07,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:49:07,092 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:49:07,121 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:49:07,121 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:49:07,122 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:49:07,122 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:49:07,127 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:49:07,127 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:49:07,127 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:49:07,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:49:07,128 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:49:07,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:49:07,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:49:07,129 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:49:07,130 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:49:07,130 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:49:07,130 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:49:07,130 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:49:07,130 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:49:07,131 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:49:07,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:49:07,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:49:07,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:49:07,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:49:07,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:49:07,133 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:49:07,133 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:49:07,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:49:07,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:49:07,134 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:49:07,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:49:07,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:49:07,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:49:07,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:49:07,211 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:49:07,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label12_true-unreach-call_false-termination.c [2018-11-06 19:49:07,274 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa4f8db3/0bdd0baec9c24c1eb3c992fb43318826/FLAGcb96270f7 [2018-11-06 19:49:07,915 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:49:07,916 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label12_true-unreach-call_false-termination.c [2018-11-06 19:49:07,935 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa4f8db3/0bdd0baec9c24c1eb3c992fb43318826/FLAGcb96270f7 [2018-11-06 19:49:07,958 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa4f8db3/0bdd0baec9c24c1eb3c992fb43318826 [2018-11-06 19:49:07,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:49:07,973 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:49:07,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:07,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:49:07,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:49:07,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:07" (1/1) ... [2018-11-06 19:49:07,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e1dcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:07, skipping insertion in model container [2018-11-06 19:49:07,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:07" (1/1) ... [2018-11-06 19:49:07,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:49:08,066 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:49:08,545 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:08,550 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:49:08,683 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:08,702 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:49:08,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08 WrapperNode [2018-11-06 19:49:08,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:08,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:08,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:49:08,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:49:08,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... [2018-11-06 19:49:08,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... [2018-11-06 19:49:08,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:08,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:49:08,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:49:08,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:49:08,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... [2018-11-06 19:49:08,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... [2018-11-06 19:49:08,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... [2018-11-06 19:49:08,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... [2018-11-06 19:49:08,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... [2018-11-06 19:49:08,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... [2018-11-06 19:49:08,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... [2018-11-06 19:49:09,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:49:09,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:49:09,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:49:09,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:49:09,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:49:09,111 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:49:09,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:49:09,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:49:12,043 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:49:12,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:12 BoogieIcfgContainer [2018-11-06 19:49:12,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:49:12,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:49:12,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:49:12,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:49:12,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:49:07" (1/3) ... [2018-11-06 19:49:12,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65480198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:12, skipping insertion in model container [2018-11-06 19:49:12,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:08" (2/3) ... [2018-11-06 19:49:12,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65480198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:12, skipping insertion in model container [2018-11-06 19:49:12,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:12" (3/3) ... [2018-11-06 19:49:12,059 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label12_true-unreach-call_false-termination.c [2018-11-06 19:49:12,072 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:49:12,088 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:49:12,108 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:49:12,154 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:49:12,155 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:49:12,155 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:49:12,155 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:49:12,156 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:49:12,156 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:49:12,156 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:49:12,156 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:49:12,156 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:49:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:49:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-06 19:49:12,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:12,218 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] [2018-11-06 19:49:12,220 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:12,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:12,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2010636303, now seen corresponding path program 1 times [2018-11-06 19:49:12,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:12,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:12,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:12,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:12,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:12,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:12,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:12,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:12,990 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-11-06 19:49:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:15,565 INFO L93 Difference]: Finished difference Result 691 states and 1207 transitions. [2018-11-06 19:49:15,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:15,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-06 19:49:15,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:15,596 INFO L225 Difference]: With dead ends: 691 [2018-11-06 19:49:15,597 INFO L226 Difference]: Without dead ends: 485 [2018-11-06 19:49:15,605 INFO L604 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-11-06 19:49:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-11-06 19:49:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 328. [2018-11-06 19:49:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-06 19:49:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-11-06 19:49:15,706 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 121 [2018-11-06 19:49:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:15,708 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-11-06 19:49:15,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-11-06 19:49:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-06 19:49:15,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:15,714 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:49:15,715 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:15,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1789914980, now seen corresponding path program 1 times [2018-11-06 19:49:15,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:15,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:15,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:15,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:15,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:15,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:15,998 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 4 states. [2018-11-06 19:49:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:17,277 INFO L93 Difference]: Finished difference Result 1182 states and 1980 transitions. [2018-11-06 19:49:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:17,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-06 19:49:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:17,285 INFO L225 Difference]: With dead ends: 1182 [2018-11-06 19:49:17,285 INFO L226 Difference]: Without dead ends: 856 [2018-11-06 19:49:17,288 INFO L604 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-11-06 19:49:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-06 19:49:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-06 19:49:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-06 19:49:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1303 transitions. [2018-11-06 19:49:17,331 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1303 transitions. Word has length 128 [2018-11-06 19:49:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:17,331 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1303 transitions. [2018-11-06 19:49:17,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1303 transitions. [2018-11-06 19:49:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-06 19:49:17,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:17,339 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:49:17,339 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:17,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:17,340 INFO L82 PathProgramCache]: Analyzing trace with hash -576316677, now seen corresponding path program 1 times [2018-11-06 19:49:17,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:17,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:17,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:17,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:17,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:17,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:17,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:17,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:17,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:17,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:17,831 INFO L87 Difference]: Start difference. First operand 856 states and 1303 transitions. Second operand 4 states. [2018-11-06 19:49:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:21,763 INFO L93 Difference]: Finished difference Result 2634 states and 4077 transitions. [2018-11-06 19:49:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:21,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-11-06 19:49:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:21,776 INFO L225 Difference]: With dead ends: 2634 [2018-11-06 19:49:21,776 INFO L226 Difference]: Without dead ends: 1647 [2018-11-06 19:49:21,778 INFO L604 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-11-06 19:49:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2018-11-06 19:49:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2018-11-06 19:49:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2018-11-06 19:49:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2068 transitions. [2018-11-06 19:49:21,816 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2068 transitions. Word has length 129 [2018-11-06 19:49:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:21,816 INFO L480 AbstractCegarLoop]: Abstraction has 1647 states and 2068 transitions. [2018-11-06 19:49:21,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2068 transitions. [2018-11-06 19:49:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-06 19:49:21,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:21,822 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:49:21,822 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:21,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash -859831251, now seen corresponding path program 1 times [2018-11-06 19:49:21,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:21,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:21,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-06 19:49:22,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:22,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:22,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:22,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:22,096 INFO L87 Difference]: Start difference. First operand 1647 states and 2068 transitions. Second operand 4 states. [2018-11-06 19:49:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:23,897 INFO L93 Difference]: Finished difference Result 4084 states and 5286 transitions. [2018-11-06 19:49:23,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:23,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-11-06 19:49:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:23,910 INFO L225 Difference]: With dead ends: 4084 [2018-11-06 19:49:23,910 INFO L226 Difference]: Without dead ends: 2439 [2018-11-06 19:49:23,914 INFO L604 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-11-06 19:49:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2018-11-06 19:49:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2439. [2018-11-06 19:49:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2439 states. [2018-11-06 19:49:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 3072 transitions. [2018-11-06 19:49:23,961 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 3072 transitions. Word has length 154 [2018-11-06 19:49:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:23,962 INFO L480 AbstractCegarLoop]: Abstraction has 2439 states and 3072 transitions. [2018-11-06 19:49:23,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 3072 transitions. [2018-11-06 19:49:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-06 19:49:23,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:23,967 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:49:23,968 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:23,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash 589821308, now seen corresponding path program 1 times [2018-11-06 19:49:23,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:23,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:23,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:23,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:23,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-06 19:49:24,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:24,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:24,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:24,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:24,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:24,142 INFO L87 Difference]: Start difference. First operand 2439 states and 3072 transitions. Second operand 3 states. [2018-11-06 19:49:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:25,136 INFO L93 Difference]: Finished difference Result 5668 states and 7294 transitions. [2018-11-06 19:49:25,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:25,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2018-11-06 19:49:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:25,153 INFO L225 Difference]: With dead ends: 5668 [2018-11-06 19:49:25,154 INFO L226 Difference]: Without dead ends: 3231 [2018-11-06 19:49:25,158 INFO L604 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-11-06 19:49:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2018-11-06 19:49:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3231. [2018-11-06 19:49:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3231 states. [2018-11-06 19:49:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 3996 transitions. [2018-11-06 19:49:25,220 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 3996 transitions. Word has length 171 [2018-11-06 19:49:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:25,221 INFO L480 AbstractCegarLoop]: Abstraction has 3231 states and 3996 transitions. [2018-11-06 19:49:25,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 3996 transitions. [2018-11-06 19:49:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-06 19:49:25,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:25,228 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-06 19:49:25,228 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:25,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash 521147679, now seen corresponding path program 1 times [2018-11-06 19:49:25,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:25,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:25,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:25,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:25,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:25,622 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:49:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 102 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 19:49:25,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:49:25,744 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:49:25,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:25,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:49:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-06 19:49:26,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:49:26,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 19:49:26,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:49:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:49:26,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:49:26,104 INFO L87 Difference]: Start difference. First operand 3231 states and 3996 transitions. Second operand 8 states. [2018-11-06 19:49:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:32,642 INFO L93 Difference]: Finished difference Result 6460 states and 8031 transitions. [2018-11-06 19:49:32,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 19:49:32,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 201 [2018-11-06 19:49:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:32,654 INFO L225 Difference]: With dead ends: 6460 [2018-11-06 19:49:32,654 INFO L226 Difference]: Without dead ends: 2962 [2018-11-06 19:49:32,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:49:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2018-11-06 19:49:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2686. [2018-11-06 19:49:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2686 states. [2018-11-06 19:49:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 3014 transitions. [2018-11-06 19:49:32,708 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 3014 transitions. Word has length 201 [2018-11-06 19:49:32,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:32,709 INFO L480 AbstractCegarLoop]: Abstraction has 2686 states and 3014 transitions. [2018-11-06 19:49:32,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:49:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 3014 transitions. [2018-11-06 19:49:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-06 19:49:32,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:32,716 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:32,716 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:32,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:32,717 INFO L82 PathProgramCache]: Analyzing trace with hash -863472392, now seen corresponding path program 1 times [2018-11-06 19:49:32,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:32,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:32,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:33,110 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:49:33,384 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:49:33,643 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-06 19:49:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-06 19:49:33,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:33,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:49:33,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:49:33,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:49:33,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:49:33,694 INFO L87 Difference]: Start difference. First operand 2686 states and 3014 transitions. Second operand 6 states. [2018-11-06 19:49:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:35,323 INFO L93 Difference]: Finished difference Result 5881 states and 6611 transitions. [2018-11-06 19:49:35,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:49:35,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2018-11-06 19:49:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:35,335 INFO L225 Difference]: With dead ends: 5881 [2018-11-06 19:49:35,335 INFO L226 Difference]: Without dead ends: 3197 [2018-11-06 19:49:35,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:49:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2018-11-06 19:49:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2818. [2018-11-06 19:49:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2018-11-06 19:49:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3115 transitions. [2018-11-06 19:49:35,391 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3115 transitions. Word has length 236 [2018-11-06 19:49:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:35,392 INFO L480 AbstractCegarLoop]: Abstraction has 2818 states and 3115 transitions. [2018-11-06 19:49:35,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:49:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3115 transitions. [2018-11-06 19:49:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-06 19:49:35,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:35,399 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:35,399 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:35,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:35,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1256511775, now seen corresponding path program 1 times [2018-11-06 19:49:35,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:35,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:35,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:35,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:35,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-06 19:49:35,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:35,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:35,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:35,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:35,730 INFO L87 Difference]: Start difference. First operand 2818 states and 3115 transitions. Second operand 4 states. [2018-11-06 19:49:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:36,574 INFO L93 Difference]: Finished difference Result 5634 states and 6228 transitions. [2018-11-06 19:49:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:36,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-11-06 19:49:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:36,584 INFO L225 Difference]: With dead ends: 5634 [2018-11-06 19:49:36,584 INFO L226 Difference]: Without dead ends: 2818 [2018-11-06 19:49:36,588 INFO L604 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-11-06 19:49:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2018-11-06 19:49:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2018-11-06 19:49:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2018-11-06 19:49:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3110 transitions. [2018-11-06 19:49:36,634 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3110 transitions. Word has length 258 [2018-11-06 19:49:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:36,634 INFO L480 AbstractCegarLoop]: Abstraction has 2818 states and 3110 transitions. [2018-11-06 19:49:36,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3110 transitions. [2018-11-06 19:49:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-06 19:49:36,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:36,642 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-11-06 19:49:36,642 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:36,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash -954809008, now seen corresponding path program 1 times [2018-11-06 19:49:36,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:36,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:36,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-06 19:49:37,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:37,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:49:37,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:49:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:49:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:49:37,281 INFO L87 Difference]: Start difference. First operand 2818 states and 3110 transitions. Second operand 6 states. [2018-11-06 19:49:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:38,663 INFO L93 Difference]: Finished difference Result 5899 states and 6555 transitions. [2018-11-06 19:49:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:49:38,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 268 [2018-11-06 19:49:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:38,673 INFO L225 Difference]: With dead ends: 5899 [2018-11-06 19:49:38,674 INFO L226 Difference]: Without dead ends: 2817 [2018-11-06 19:49:38,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:49:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2018-11-06 19:49:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2018-11-06 19:49:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2018-11-06 19:49:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 3055 transitions. [2018-11-06 19:49:38,720 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 3055 transitions. Word has length 268 [2018-11-06 19:49:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:38,721 INFO L480 AbstractCegarLoop]: Abstraction has 2817 states and 3055 transitions. [2018-11-06 19:49:38,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:49:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 3055 transitions. [2018-11-06 19:49:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-06 19:49:38,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:38,728 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:38,728 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:38,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:38,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1251298551, now seen corresponding path program 1 times [2018-11-06 19:49:38,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:38,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:38,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:39,200 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-06 19:49:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-06 19:49:39,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:39,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:39,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:49:39,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:49:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:39,424 INFO L87 Difference]: Start difference. First operand 2817 states and 3055 transitions. Second operand 5 states. [2018-11-06 19:49:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:40,387 INFO L93 Difference]: Finished difference Result 3353 states and 3611 transitions. [2018-11-06 19:49:40,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:49:40,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 270 [2018-11-06 19:49:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:40,400 INFO L225 Difference]: With dead ends: 3353 [2018-11-06 19:49:40,400 INFO L226 Difference]: Without dead ends: 2816 [2018-11-06 19:49:40,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2018-11-06 19:49:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2816. [2018-11-06 19:49:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2816 states. [2018-11-06 19:49:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 3049 transitions. [2018-11-06 19:49:40,445 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 3049 transitions. Word has length 270 [2018-11-06 19:49:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:40,446 INFO L480 AbstractCegarLoop]: Abstraction has 2816 states and 3049 transitions. [2018-11-06 19:49:40,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:49:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 3049 transitions. [2018-11-06 19:49:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-06 19:49:40,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:40,454 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:40,455 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:40,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:40,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1557245189, now seen corresponding path program 1 times [2018-11-06 19:49:40,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:40,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:40,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-06 19:49:40,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:40,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:40,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:40,876 INFO L87 Difference]: Start difference. First operand 2816 states and 3049 transitions. Second operand 4 states. [2018-11-06 19:49:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:42,461 INFO L93 Difference]: Finished difference Result 5356 states and 5825 transitions. [2018-11-06 19:49:42,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:42,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-11-06 19:49:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:42,463 INFO L225 Difference]: With dead ends: 5356 [2018-11-06 19:49:42,463 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:49:42,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:42,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:49:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:49:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:49:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:49:42,468 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 309 [2018-11-06 19:49:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:42,469 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:49:42,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:49:42,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:49:42,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:49:42,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:42,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:42,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:42,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:43,472 WARN L179 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-11-06 19:49:43,709 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-11-06 19:49:43,713 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:49:43,713 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:49:43,714 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,715 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:49:43,716 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:49:43,717 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:49:43,717 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:49:43,717 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:49:43,717 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:49:43,717 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:49:43,717 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:49:43,717 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,717 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,717 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,718 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,718 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,718 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:49:43,718 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:49:43,718 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:49:43,718 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:49:43,718 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:49:43,718 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:49:43,719 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:49:43,719 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:49:43,719 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:49:43,719 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a7~0 1)) (.cse10 (= ~a17~0 1))) (let ((.cse6 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1)) (.cse4 (not .cse10)) (.cse7 (= ~a16~0 4)) (.cse5 (= ~a16~0 5)) (.cse8 (not .cse1)) (.cse0 (= ~a12~0 8)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 6))) (or (and (<= ~a21~0 0) .cse0) (and .cse1 (= ~a8~0 14) .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse5) (and .cse7 .cse0 .cse6 .cse3) (and .cse8 .cse0 .cse6 .cse3 .cse9) (and .cse7 .cse10 .cse0 .cse3 .cse2) (and .cse1 (not .cse2) (= ~a8~0 15) .cse0 .cse3 .cse4 .cse5) (and .cse8 .cse7 .cse10 .cse0 .cse3) (and .cse8 .cse10 .cse0 .cse3 .cse5) (and .cse8 .cse10 .cse0 .cse3 .cse9)))) [2018-11-06 19:49:43,720 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,720 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,720 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,720 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,720 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,720 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:49:43,720 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:49:43,720 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:49:43,720 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,721 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:49:43,722 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,723 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,723 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,723 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,723 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,723 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:49:43,723 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:49:43,723 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:49:43,723 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:49:43,723 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,724 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,725 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,725 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a7~0 1)) (.cse10 (= ~a17~0 1))) (let ((.cse6 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1)) (.cse4 (not .cse10)) (.cse7 (= ~a16~0 4)) (.cse5 (= ~a16~0 5)) (.cse8 (not .cse1)) (.cse0 (= ~a12~0 8)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 6))) (or (and (<= ~a21~0 0) .cse0) (and .cse1 (= ~a8~0 14) .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse5) (and .cse7 .cse0 .cse6 .cse3) (and .cse8 .cse0 .cse6 .cse3 .cse9) (and .cse7 .cse10 .cse0 .cse3 .cse2) (and .cse1 (not .cse2) (= ~a8~0 15) .cse0 .cse3 .cse4 .cse5) (and .cse8 .cse7 .cse10 .cse0 .cse3) (and .cse8 .cse10 .cse0 .cse3 .cse5) (and .cse8 .cse10 .cse0 .cse3 .cse9)))) [2018-11-06 19:49:43,725 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,725 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,725 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:49:43,725 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:49:43,725 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:49:43,725 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:49:43,725 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:49:43,725 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:49:43,726 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,727 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,728 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:49:43,729 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:49:43,730 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:49:43,731 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:49:43,732 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:49:43,732 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:49:43,732 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:49:43,732 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 536) no Hoare annotation was computed. [2018-11-06 19:49:43,732 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:49:43,732 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:49:43,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:49:43 BoogieIcfgContainer [2018-11-06 19:49:43,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:49:43,756 INFO L168 Benchmark]: Toolchain (without parser) took 35783.95 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 884.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:43,758 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:49:43,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:43,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 206.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:43,763 INFO L168 Benchmark]: Boogie Preprocessor took 96.38 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:49:43,763 INFO L168 Benchmark]: RCFGBuilder took 3035.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:43,769 INFO L168 Benchmark]: TraceAbstraction took 31709.68 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 417.3 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -500.4 MB). Peak memory consumption was 810.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:43,777 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 206.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.38 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3035.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31709.68 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 417.3 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -500.4 MB). Peak memory consumption was 810.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 536]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a21 <= 0 && a12 == 8) || ((((((a7 == 1 && a8 == 14) && a12 == 8) && a20 == 1) && a21 == 1) && !(a17 == 1)) && a16 == 5)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || ((((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || ((((((a7 == 1 && !(a20 == 1)) && a8 == 15) && a12 == 8) && a21 == 1) && !(a17 == 1)) && a16 == 5)) || ((((!(a7 == 1) && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((a21 <= 0 && a12 == 8) || ((((((a7 == 1 && a8 == 14) && a12 == 8) && a20 == 1) && a21 == 1) && !(a17 == 1)) && a16 == 5)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || ((((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || ((((((a7 == 1 && !(a20 == 1)) && a8 == 15) && a12 == 8) && a21 == 1) && !(a17 == 1)) && a16 == 5)) || ((((!(a7 == 1) && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 31.5s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1408 SDtfs, 3909 SDslu, 862 SDs, 0 SdLazy, 8775 SolverSat, 1466 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 213 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3231occurred in iteration=5, 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: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 812 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 58 NumberOfFragments, 331 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2532 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 98 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2446 NumberOfCodeBlocks, 2446 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2434 ConstructedInterpolants, 0 QuantifiedInterpolants, 2432620 SizeOfPredicates, 1 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1785/1812 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...