java -Xss4m -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label51_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-22 05:55:32,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-22 05:55:32,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-22 05:55:32,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-22 05:55:32,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-22 05:55:32,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-22 05:55:32,112 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-22 05:55:32,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-22 05:55:32,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-22 05:55:32,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-22 05:55:32,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-22 05:55:32,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-22 05:55:32,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-22 05:55:32,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-22 05:55:32,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-22 05:55:32,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-22 05:55:32,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-22 05:55:32,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-22 05:55:32,143 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-22 05:55:32,144 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-22 05:55:32,145 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-22 05:55:32,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-22 05:55:32,149 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-22 05:55:32,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-22 05:55:32,152 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-22 05:55:32,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-22 05:55:32,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-22 05:55:32,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-22 05:55:32,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-22 05:55:32,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-22 05:55:32,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-22 05:55:32,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-22 05:55:32,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-22 05:55:32,160 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-22 05:55:32,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-22 05:55:32,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-22 05:55:32,164 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-22 05:55:32,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-22 05:55:32,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-22 05:55:32,193 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-22 05:55:32,193 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-22 05:55:32,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-22 05:55:32,194 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-22 05:55:32,195 INFO L133 SettingsManager]: * Use SBE=true [2018-07-22 05:55:32,195 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-22 05:55:32,195 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-22 05:55:32,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-22 05:55:32,195 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-22 05:55:32,196 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-22 05:55:32,196 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-22 05:55:32,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-22 05:55:32,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-22 05:55:32,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-22 05:55:32,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-22 05:55:32,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-22 05:55:32,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-22 05:55:32,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 05:55:32,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-22 05:55:32,197 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-22 05:55:32,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-22 05:55:32,198 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-22 05:55:32,199 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-22 05:55:32,199 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-22 05:55:32,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-22 05:55:32,200 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-22 05:55:32,200 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-22 05:55:32,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-22 05:55:32,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-22 05:55:32,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-22 05:55:32,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-22 05:55:32,280 INFO L276 PluginConnector]: CDTParser initialized [2018-07-22 05:55:32,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label51_true-unreach-call_false-termination.c [2018-07-22 05:55:32,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/920deab25/723417ad4ef44fe6a9ddd5b118dbe05b/FLAGa149464d6 [2018-07-22 05:55:32,947 INFO L276 CDTParser]: Found 1 translation units. [2018-07-22 05:55:32,952 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label51_true-unreach-call_false-termination.c [2018-07-22 05:55:32,979 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/920deab25/723417ad4ef44fe6a9ddd5b118dbe05b/FLAGa149464d6 [2018-07-22 05:55:33,216 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/920deab25/723417ad4ef44fe6a9ddd5b118dbe05b [2018-07-22 05:55:33,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-22 05:55:33,233 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-22 05:55:33,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-22 05:55:33,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-22 05:55:33,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-22 05:55:33,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:55:33" (1/1) ... [2018-07-22 05:55:33,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454a0b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:33, skipping insertion in model container [2018-07-22 05:55:33,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:55:33" (1/1) ... [2018-07-22 05:55:33,505 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-22 05:55:33,785 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 05:55:33,811 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-22 05:55:33,998 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 05:55:34,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34 WrapperNode [2018-07-22 05:55:34,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-22 05:55:34,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-22 05:55:34,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-22 05:55:34,054 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-22 05:55:34,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... [2018-07-22 05:55:34,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... [2018-07-22 05:55:34,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-22 05:55:34,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-22 05:55:34,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-22 05:55:34,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-22 05:55:34,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... [2018-07-22 05:55:34,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... [2018-07-22 05:55:34,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... [2018-07-22 05:55:34,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... [2018-07-22 05:55:34,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... [2018-07-22 05:55:34,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... [2018-07-22 05:55:34,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... [2018-07-22 05:55:34,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-22 05:55:34,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-22 05:55:34,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-22 05:55:34,304 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-22 05:55:34,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (1/1) ... No working directory specified, using /storage/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-07-22 05:55:34,591 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-22 05:55:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-22 05:55:34,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-22 05:55:37,888 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-22 05:55:37,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:55:37 BoogieIcfgContainer [2018-07-22 05:55:37,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-22 05:55:37,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-22 05:55:37,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-22 05:55:37,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-22 05:55:37,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 05:55:33" (1/3) ... [2018-07-22 05:55:37,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495b9687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:55:37, skipping insertion in model container [2018-07-22 05:55:37,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:34" (2/3) ... [2018-07-22 05:55:37,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495b9687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:55:37, skipping insertion in model container [2018-07-22 05:55:37,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:55:37" (3/3) ... [2018-07-22 05:55:37,899 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label51_true-unreach-call_false-termination.c [2018-07-22 05:55:37,912 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-22 05:55:37,923 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-22 05:55:37,990 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-22 05:55:37,991 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-22 05:55:37,991 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-22 05:55:37,992 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-22 05:55:37,992 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-22 05:55:37,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-22 05:55:37,992 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-22 05:55:37,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-22 05:55:37,992 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-22 05:55:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-22 05:55:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-22 05:55:38,038 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:38,039 INFO L358 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] [2018-07-22 05:55:38,039 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:38,046 INFO L82 PathProgramCache]: Analyzing trace with hash 558269655, now seen corresponding path program 1 times [2018-07-22 05:55:38,048 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:38,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:38,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:38,670 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:38,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 05:55:38,677 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 05:55:38,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 05:55:38,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:38,698 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-07-22 05:55:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:39,959 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-07-22 05:55:39,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 05:55:39,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-07-22 05:55:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:39,977 INFO L225 Difference]: With dead ends: 531 [2018-07-22 05:55:39,977 INFO L226 Difference]: Without dead ends: 328 [2018-07-22 05:55:39,982 INFO L578 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-07-22 05:55:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-07-22 05:55:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-07-22 05:55:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-07-22 05:55:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 533 transitions. [2018-07-22 05:55:40,057 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 533 transitions. Word has length 107 [2018-07-22 05:55:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:40,058 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 533 transitions. [2018-07-22 05:55:40,058 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 05:55:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 533 transitions. [2018-07-22 05:55:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-22 05:55:40,064 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:40,064 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:40,064 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:40,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2470338, now seen corresponding path program 1 times [2018-07-22 05:55:40,065 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:40,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:40,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:40,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:40,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:40,183 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:40,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 05:55:40,187 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 05:55:40,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 05:55:40,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:40,188 INFO L87 Difference]: Start difference. First operand 328 states and 533 transitions. Second operand 3 states. [2018-07-22 05:55:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:41,046 INFO L93 Difference]: Finished difference Result 918 states and 1534 transitions. [2018-07-22 05:55:41,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 05:55:41,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-07-22 05:55:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:41,054 INFO L225 Difference]: With dead ends: 918 [2018-07-22 05:55:41,055 INFO L226 Difference]: Without dead ends: 592 [2018-07-22 05:55:41,057 INFO L578 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-07-22 05:55:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-07-22 05:55:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2018-07-22 05:55:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-07-22 05:55:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 967 transitions. [2018-07-22 05:55:41,114 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 967 transitions. Word has length 113 [2018-07-22 05:55:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:41,114 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 967 transitions. [2018-07-22 05:55:41,115 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 05:55:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 967 transitions. [2018-07-22 05:55:41,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-22 05:55:41,122 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:41,122 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:41,123 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:41,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1524715704, now seen corresponding path program 1 times [2018-07-22 05:55:41,123 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:41,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:41,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:41,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:41,256 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:41,256 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 05:55:41,259 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 05:55:41,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 05:55:41,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:41,260 INFO L87 Difference]: Start difference. First operand 592 states and 967 transitions. Second operand 3 states. [2018-07-22 05:55:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:42,186 INFO L93 Difference]: Finished difference Result 1578 states and 2577 transitions. [2018-07-22 05:55:42,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 05:55:42,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-07-22 05:55:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:42,194 INFO L225 Difference]: With dead ends: 1578 [2018-07-22 05:55:42,194 INFO L226 Difference]: Without dead ends: 988 [2018-07-22 05:55:42,196 INFO L578 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-07-22 05:55:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-07-22 05:55:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2018-07-22 05:55:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-07-22 05:55:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1450 transitions. [2018-07-22 05:55:42,232 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1450 transitions. Word has length 117 [2018-07-22 05:55:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:42,233 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1450 transitions. [2018-07-22 05:55:42,233 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 05:55:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1450 transitions. [2018-07-22 05:55:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-22 05:55:42,236 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:42,237 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-22 05:55:42,237 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1772789842, now seen corresponding path program 1 times [2018-07-22 05:55:42,237 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:42,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:42,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:42,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:42,410 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:42,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 05:55:42,410 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 05:55:42,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 05:55:42,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:42,414 INFO L87 Difference]: Start difference. First operand 988 states and 1450 transitions. Second operand 3 states. [2018-07-22 05:55:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:45,370 INFO L93 Difference]: Finished difference Result 1974 states and 2898 transitions. [2018-07-22 05:55:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 05:55:45,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-07-22 05:55:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:45,376 INFO L225 Difference]: With dead ends: 1974 [2018-07-22 05:55:45,376 INFO L226 Difference]: Without dead ends: 988 [2018-07-22 05:55:45,377 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-07-22 05:55:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2018-07-22 05:55:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-07-22 05:55:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1438 transitions. [2018-07-22 05:55:45,417 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1438 transitions. Word has length 121 [2018-07-22 05:55:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:45,417 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1438 transitions. [2018-07-22 05:55:45,417 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 05:55:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1438 transitions. [2018-07-22 05:55:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-22 05:55:45,420 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:45,421 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:45,422 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash -211566864, now seen corresponding path program 1 times [2018-07-22 05:55:45,422 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:45,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:45,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:45,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:45,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:45,588 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:45,588 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:55:45,588 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 05:55:45,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 05:55:45,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:55:45,589 INFO L87 Difference]: Start difference. First operand 988 states and 1438 transitions. Second operand 4 states. [2018-07-22 05:55:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:47,497 INFO L93 Difference]: Finished difference Result 3294 states and 4813 transitions. [2018-07-22 05:55:47,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 05:55:47,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-07-22 05:55:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:47,509 INFO L225 Difference]: With dead ends: 3294 [2018-07-22 05:55:47,509 INFO L226 Difference]: Without dead ends: 2308 [2018-07-22 05:55:47,511 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:55:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2018-07-22 05:55:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2308. [2018-07-22 05:55:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2018-07-22 05:55:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3130 transitions. [2018-07-22 05:55:47,589 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3130 transitions. Word has length 122 [2018-07-22 05:55:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:47,589 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 3130 transitions. [2018-07-22 05:55:47,589 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 05:55:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3130 transitions. [2018-07-22 05:55:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-22 05:55:47,593 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:47,593 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:47,593 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:47,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1766649559, now seen corresponding path program 1 times [2018-07-22 05:55:47,594 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:47,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:47,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:47,871 WARN L169 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-07-22 05:55:48,058 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-07-22 05:55:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:48,090 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:48,090 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:55:48,091 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 05:55:48,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 05:55:48,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-22 05:55:48,092 INFO L87 Difference]: Start difference. First operand 2308 states and 3130 transitions. Second operand 5 states. [2018-07-22 05:55:48,291 WARN L169 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-07-22 05:55:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:49,317 INFO L93 Difference]: Finished difference Result 4821 states and 6492 transitions. [2018-07-22 05:55:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-22 05:55:49,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2018-07-22 05:55:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:49,329 INFO L225 Difference]: With dead ends: 4821 [2018-07-22 05:55:49,329 INFO L226 Difference]: Without dead ends: 2515 [2018-07-22 05:55:49,332 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-22 05:55:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2018-07-22 05:55:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2470. [2018-07-22 05:55:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2018-07-22 05:55:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3300 transitions. [2018-07-22 05:55:49,396 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3300 transitions. Word has length 123 [2018-07-22 05:55:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:49,397 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 3300 transitions. [2018-07-22 05:55:49,397 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 05:55:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3300 transitions. [2018-07-22 05:55:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-22 05:55:49,401 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:49,401 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-22 05:55:49,401 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1684119679, now seen corresponding path program 1 times [2018-07-22 05:55:49,402 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:49,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:49,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:49,894 WARN L169 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-07-22 05:55:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:49,906 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:49,906 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:55:49,906 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 05:55:49,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 05:55:49,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 05:55:49,908 INFO L87 Difference]: Start difference. First operand 2470 states and 3300 transitions. Second operand 5 states. [2018-07-22 05:55:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:50,856 INFO L93 Difference]: Finished difference Result 4938 states and 6598 transitions. [2018-07-22 05:55:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 05:55:50,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-07-22 05:55:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:50,864 INFO L225 Difference]: With dead ends: 4938 [2018-07-22 05:55:50,864 INFO L226 Difference]: Without dead ends: 2470 [2018-07-22 05:55:50,868 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 05:55:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2018-07-22 05:55:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2470. [2018-07-22 05:55:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2018-07-22 05:55:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3241 transitions. [2018-07-22 05:55:50,929 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3241 transitions. Word has length 128 [2018-07-22 05:55:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:50,929 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 3241 transitions. [2018-07-22 05:55:50,930 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 05:55:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3241 transitions. [2018-07-22 05:55:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-22 05:55:50,941 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:50,942 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:50,942 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:50,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1804067133, now seen corresponding path program 1 times [2018-07-22 05:55:50,942 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:50,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:50,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:50,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:51,142 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:51,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:55:51,142 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 05:55:51,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 05:55:51,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:55:51,143 INFO L87 Difference]: Start difference. First operand 2470 states and 3241 transitions. Second operand 4 states. [2018-07-22 05:55:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:53,288 INFO L93 Difference]: Finished difference Result 7974 states and 10507 transitions. [2018-07-22 05:55:53,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 05:55:53,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-07-22 05:55:53,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:53,301 INFO L225 Difference]: With dead ends: 7974 [2018-07-22 05:55:53,301 INFO L226 Difference]: Without dead ends: 3630 [2018-07-22 05:55:53,306 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:55:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2018-07-22 05:55:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3336. [2018-07-22 05:55:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-07-22 05:55:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 3716 transitions. [2018-07-22 05:55:53,379 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 3716 transitions. Word has length 131 [2018-07-22 05:55:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:53,379 INFO L471 AbstractCegarLoop]: Abstraction has 3336 states and 3716 transitions. [2018-07-22 05:55:53,379 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 05:55:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 3716 transitions. [2018-07-22 05:55:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-22 05:55:53,383 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:53,384 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-22 05:55:53,384 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash -837740914, now seen corresponding path program 1 times [2018-07-22 05:55:53,384 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:53,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:53,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:53,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:53,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:53,782 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-22 05:55:54,006 WARN L169 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-22 05:55:54,264 WARN L169 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-07-22 05:55:54,627 WARN L169 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-07-22 05:55:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:55,018 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:55,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-07-22 05:55:55,018 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-22 05:55:55,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-22 05:55:55,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-07-22 05:55:55,019 INFO L87 Difference]: Start difference. First operand 3336 states and 3716 transitions. Second operand 12 states. [2018-07-22 05:55:55,871 WARN L169 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-07-22 05:55:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:56,960 INFO L93 Difference]: Finished difference Result 7576 states and 8526 transitions. [2018-07-22 05:55:56,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-22 05:55:56,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 145 [2018-07-22 05:55:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:56,977 INFO L225 Difference]: With dead ends: 7576 [2018-07-22 05:55:56,977 INFO L226 Difference]: Without dead ends: 4208 [2018-07-22 05:55:56,980 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-07-22 05:55:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2018-07-22 05:55:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 4164. [2018-07-22 05:55:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2018-07-22 05:55:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 4608 transitions. [2018-07-22 05:55:57,057 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 4608 transitions. Word has length 145 [2018-07-22 05:55:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:57,058 INFO L471 AbstractCegarLoop]: Abstraction has 4164 states and 4608 transitions. [2018-07-22 05:55:57,058 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-22 05:55:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 4608 transitions. [2018-07-22 05:55:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-22 05:55:57,063 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:57,064 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-22 05:55:57,064 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1107717536, now seen corresponding path program 1 times [2018-07-22 05:55:57,065 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:57,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:57,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:57,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:57,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:57,556 WARN L169 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-07-22 05:55:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:57,979 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:57,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-07-22 05:55:57,979 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-22 05:55:57,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-22 05:55:57,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2018-07-22 05:55:57,980 INFO L87 Difference]: Start difference. First operand 4164 states and 4608 transitions. Second operand 13 states. [2018-07-22 05:55:59,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:59,576 INFO L93 Difference]: Finished difference Result 8190 states and 9057 transitions. [2018-07-22 05:55:59,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-22 05:55:59,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2018-07-22 05:55:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:59,587 INFO L225 Difference]: With dead ends: 8190 [2018-07-22 05:55:59,587 INFO L226 Difference]: Without dead ends: 4028 [2018-07-22 05:55:59,589 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=193, Unknown=0, NotChecked=0, Total=342 [2018-07-22 05:55:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2018-07-22 05:55:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 3959. [2018-07-22 05:55:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3959 states. [2018-07-22 05:55:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 4313 transitions. [2018-07-22 05:55:59,672 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 4313 transitions. Word has length 159 [2018-07-22 05:55:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:59,673 INFO L471 AbstractCegarLoop]: Abstraction has 3959 states and 4313 transitions. [2018-07-22 05:55:59,673 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-22 05:55:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 4313 transitions. [2018-07-22 05:55:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-22 05:55:59,683 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:59,683 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-22 05:55:59,683 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash 242524652, now seen corresponding path program 1 times [2018-07-22 05:55:59,684 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:59,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-07-22 05:55:59,983 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:59,983 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:55:59,984 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 05:55:59,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 05:55:59,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:55:59,984 INFO L87 Difference]: Start difference. First operand 3959 states and 4313 transitions. Second operand 4 states. [2018-07-22 05:56:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:56:00,585 INFO L93 Difference]: Finished difference Result 8450 states and 9218 transitions. [2018-07-22 05:56:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 05:56:00,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-07-22 05:56:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:56:00,596 INFO L225 Difference]: With dead ends: 8450 [2018-07-22 05:56:00,596 INFO L226 Difference]: Without dead ends: 3821 [2018-07-22 05:56:00,599 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:56:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2018-07-22 05:56:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3291. [2018-07-22 05:56:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3291 states. [2018-07-22 05:56:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 3521 transitions. [2018-07-22 05:56:00,662 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 3521 transitions. Word has length 189 [2018-07-22 05:56:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:56:00,663 INFO L471 AbstractCegarLoop]: Abstraction has 3291 states and 3521 transitions. [2018-07-22 05:56:00,663 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 05:56:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 3521 transitions. [2018-07-22 05:56:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-07-22 05:56:00,670 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:56:00,670 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2018-07-22 05:56:00,670 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:56:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash -265850175, now seen corresponding path program 1 times [2018-07-22 05:56:00,671 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:56:00,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:56:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:56:00,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:56:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:56:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:56:01,011 WARN L169 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-22 05:56:01,241 WARN L169 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-22 05:56:01,458 WARN L169 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-07-22 05:56:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 66 proven. 154 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-07-22 05:56:01,718 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 05:56:01,718 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-07-22 05:56:01,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:56:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:56:01,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 05:56:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-07-22 05:56:02,107 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 05:56:02,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-07-22 05:56:02,108 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-22 05:56:02,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-22 05:56:02,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-07-22 05:56:02,108 INFO L87 Difference]: Start difference. First operand 3291 states and 3521 transitions. Second operand 10 states. [2018-07-22 05:56:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:56:06,173 INFO L93 Difference]: Finished difference Result 7024 states and 7533 transitions. [2018-07-22 05:56:06,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-22 05:56:06,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 239 [2018-07-22 05:56:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:56:06,188 INFO L225 Difference]: With dead ends: 7024 [2018-07-22 05:56:06,189 INFO L226 Difference]: Without dead ends: 3463 [2018-07-22 05:56:06,193 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 246 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-07-22 05:56:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2018-07-22 05:56:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3155. [2018-07-22 05:56:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3155 states. [2018-07-22 05:56:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 3322 transitions. [2018-07-22 05:56:06,295 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 3322 transitions. Word has length 239 [2018-07-22 05:56:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:56:06,295 INFO L471 AbstractCegarLoop]: Abstraction has 3155 states and 3322 transitions. [2018-07-22 05:56:06,295 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-22 05:56:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 3322 transitions. [2018-07-22 05:56:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-22 05:56:06,339 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:56:06,340 INFO L358 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] [2018-07-22 05:56:06,340 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:56:06,340 INFO L82 PathProgramCache]: Analyzing trace with hash -421743279, now seen corresponding path program 1 times [2018-07-22 05:56:06,340 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:56:06,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:56:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:56:06,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:56:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:56:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:56:06,867 WARN L169 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-07-22 05:56:07,370 WARN L169 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-07-22 05:56:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-07-22 05:56:07,457 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:56:07,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:56:07,458 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 05:56:07,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 05:56:07,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 05:56:07,458 INFO L87 Difference]: Start difference. First operand 3155 states and 3322 transitions. Second operand 5 states. [2018-07-22 05:56:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:56:08,029 INFO L93 Difference]: Finished difference Result 3423 states and 3593 transitions. [2018-07-22 05:56:08,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 05:56:08,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 256 [2018-07-22 05:56:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:56:08,037 INFO L225 Difference]: With dead ends: 3423 [2018-07-22 05:56:08,037 INFO L226 Difference]: Without dead ends: 3022 [2018-07-22 05:56:08,038 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 05:56:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2018-07-22 05:56:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2018-07-22 05:56:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2018-07-22 05:56:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 3184 transitions. [2018-07-22 05:56:08,091 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 3184 transitions. Word has length 256 [2018-07-22 05:56:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:56:08,091 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 3184 transitions. [2018-07-22 05:56:08,091 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 05:56:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 3184 transitions. [2018-07-22 05:56:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-07-22 05:56:08,100 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:56:08,100 INFO L358 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] [2018-07-22 05:56:08,100 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:56:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1295685709, now seen corresponding path program 1 times [2018-07-22 05:56:08,101 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:56:08,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:56:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:56:08,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:56:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:56:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:56:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-07-22 05:56:08,417 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:56:08,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:56:08,418 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 05:56:08,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 05:56:08,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:56:08,419 INFO L87 Difference]: Start difference. First operand 3022 states and 3184 transitions. Second operand 4 states. [2018-07-22 05:56:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:56:08,868 INFO L93 Difference]: Finished difference Result 5243 states and 5535 transitions. [2018-07-22 05:56:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 05:56:08,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2018-07-22 05:56:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:56:08,870 INFO L225 Difference]: With dead ends: 5243 [2018-07-22 05:56:08,870 INFO L226 Difference]: Without dead ends: 0 [2018-07-22 05:56:08,874 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:56:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-22 05:56:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-22 05:56:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-22 05:56:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-22 05:56:08,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2018-07-22 05:56:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:56:08,876 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-22 05:56:08,876 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 05:56:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-22 05:56:08,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-22 05:56:08,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-22 05:56:08,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:56:08,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:56:08,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:56:08,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:56:09,015 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 102 [2018-07-22 05:56:09,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:56:09,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:56:09,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:56:09,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:56:09,141 WARN L169 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 102 [2018-07-22 05:56:10,148 WARN L169 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2018-07-22 05:56:10,645 WARN L169 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-22 05:56:10,648 INFO L421 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,649 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,650 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-22 05:56:10,651 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L493'(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-22 05:56:10,652 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,653 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,654 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-22 05:56:10,655 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-22 05:56:10,656 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-22 05:56:10,657 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-22 05:56:10,657 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,657 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-22 05:56:10,657 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-22 05:56:10,657 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-22 05:56:10,657 INFO L421 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,657 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse12 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (.cse15 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (let ((.cse6 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 6)) (.cse7 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 3)) (.cse8 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 4)) (.cse9 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 2)) (.cse10 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 1)) (.cse14 (not (= 5 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse5 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4)) (.cse4 (not .cse15)) (.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse0 (not .cse12)) (.cse17 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0)) (.cse11 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse16 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse2 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse4 (not .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10) (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6)) .cse1 .cse11 .cse12 .cse2) (and .cse11 (and .cse13 .cse1 .cse14)) (and .cse13 .cse1 .cse11 .cse5) (and (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 14) .cse15 .cse1 .cse11 .cse16 .cse2) (and .cse13 .cse3 .cse2) (and .cse17 .cse11 .cse5 .cse2) (and .cse0 .cse17 .cse3 .cse2) (and .cse17 (or (and (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0) (or .cse6 .cse7 .cse8 .cse9) .cse11 .cse16 .cse2) (and .cse11 .cse16 .cse2 .cse10))) (and .cse0 (not (= 4 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) .cse5 .cse2) (and .cse1 .cse11 (or .cse4 .cse5) .cse2 .cse3) (and .cse13 .cse16 .cse2) (and .cse17 .cse11 .cse12 .cse2 .cse14) (and .cse13 .cse1 .cse2) (and .cse15 .cse17 .cse11 .cse16 .cse2) (and .cse13 .cse17 .cse11 .cse5 .cse3) (and .cse4 .cse1 .cse11 .cse16 .cse12 .cse2) (and .cse0 .cse17 .cse11 .cse16 .cse2)))) [2018-07-22 05:56:10,658 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-22 05:56:10,658 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,658 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-22 05:56:10,658 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-22 05:56:10,658 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-22 05:56:10,658 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,658 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-22 05:56:10,658 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-22 05:56:10,658 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-22 05:56:10,658 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,659 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,660 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-22 05:56:10,661 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-22 05:56:10,662 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-22 05:56:10,662 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-22 05:56:10,662 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-22 05:56:10,662 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-22 05:56:10,662 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-22 05:56:10,662 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-22 05:56:10,662 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,662 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-22 05:56:10,662 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,663 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse12 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (.cse15 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (let ((.cse6 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 6)) (.cse7 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 3)) (.cse8 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 4)) (.cse9 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 2)) (.cse10 (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 1)) (.cse14 (not (= 5 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse5 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4)) (.cse4 (not .cse15)) (.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse0 (not .cse12)) (.cse17 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0)) (.cse11 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse16 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse2 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse4 (not .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10) (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6)) .cse1 .cse11 .cse12 .cse2) (and .cse11 (and .cse13 .cse1 .cse14)) (and .cse13 .cse1 .cse11 .cse5) (and (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 14) .cse15 .cse1 .cse11 .cse16 .cse2) (and .cse13 .cse3 .cse2) (and .cse17 .cse11 .cse5 .cse2) (and .cse0 .cse17 .cse3 .cse2) (and .cse17 (or (and (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0) (or .cse6 .cse7 .cse8 .cse9) .cse11 .cse16 .cse2) (and .cse11 .cse16 .cse2 .cse10))) (and .cse0 (not (= 4 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) .cse5 .cse2) (and .cse1 .cse11 (or .cse4 .cse5) .cse2 .cse3) (and .cse13 .cse16 .cse2) (and .cse17 .cse11 .cse12 .cse2 .cse14) (and .cse13 .cse1 .cse2) (and .cse15 .cse17 .cse11 .cse16 .cse2) (and .cse13 .cse17 .cse11 .cse5 .cse3) (and .cse4 .cse1 .cse11 .cse16 .cse12 .cse2) (and .cse0 .cse17 .cse11 .cse16 .cse2)))) [2018-07-22 05:56:10,663 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-22 05:56:10,663 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-22 05:56:10,663 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-22 05:56:10,663 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-22 05:56:10,663 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-22 05:56:10,663 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 494) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-22 05:56:10,664 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-22 05:56:10,665 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-22 05:56:10,665 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-22 05:56:10,665 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-22 05:56:10,665 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-22 05:56:10,665 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-22 05:56:10,665 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-22 05:56:10,665 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-22 05:56:10,665 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-22 05:56:10,665 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-22 05:56:10,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 05:56:10 BoogieIcfgContainer [2018-07-22 05:56:10,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-22 05:56:10,724 INFO L168 Benchmark]: Toolchain (without parser) took 37492.14 ms. Allocated memory was 309.3 MB in the beginning and 758.1 MB in the end (delta: 448.8 MB). Free memory was 252.8 MB in the beginning and 639.9 MB in the end (delta: -387.2 MB). Peak memory consumption was 389.0 MB. Max. memory is 5.3 GB. [2018-07-22 05:56:10,725 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 309.3 MB. Free memory is still 274.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-22 05:56:10,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.47 ms. Allocated memory is still 309.3 MB. Free memory was 251.8 MB in the beginning and 216.7 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 5.3 GB. [2018-07-22 05:56:10,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.76 ms. Allocated memory is still 309.3 MB. Free memory was 216.7 MB in the beginning and 211.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 5.3 GB. [2018-07-22 05:56:10,726 INFO L168 Benchmark]: Boogie Preprocessor took 110.84 ms. Allocated memory is still 309.3 MB. Free memory was 211.7 MB in the beginning and 206.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 5.3 GB. [2018-07-22 05:56:10,727 INFO L168 Benchmark]: RCFGBuilder took 3585.58 ms. Allocated memory was 309.3 MB in the beginning and 484.4 MB in the end (delta: 175.1 MB). Free memory was 206.7 MB in the beginning and 340.3 MB in the end (delta: -133.6 MB). Peak memory consumption was 57.8 MB. Max. memory is 5.3 GB. [2018-07-22 05:56:10,727 INFO L168 Benchmark]: TraceAbstraction took 32828.25 ms. Allocated memory was 484.4 MB in the beginning and 758.1 MB in the end (delta: 273.7 MB). Free memory was 340.3 MB in the beginning and 639.9 MB in the end (delta: -299.6 MB). Peak memory consumption was 301.5 MB. Max. memory is 5.3 GB. [2018-07-22 05:56:10,733 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.18 ms. Allocated memory is still 309.3 MB. Free memory is still 274.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 819.47 ms. Allocated memory is still 309.3 MB. Free memory was 251.8 MB in the beginning and 216.7 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 138.76 ms. Allocated memory is still 309.3 MB. Free memory was 216.7 MB in the beginning and 211.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 110.84 ms. Allocated memory is still 309.3 MB. Free memory was 211.7 MB in the beginning and 206.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 3585.58 ms. Allocated memory was 309.3 MB in the beginning and 484.4 MB in the end (delta: 175.1 MB). Free memory was 206.7 MB in the beginning and 340.3 MB in the end (delta: -133.6 MB). Peak memory consumption was 57.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 32828.25 ms. Allocated memory was 484.4 MB in the beginning and 758.1 MB in the end (delta: 273.7 MB). Free memory was 340.3 MB in the beginning and 639.9 MB in the end (delta: -299.6 MB). Peak memory consumption was 301.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 494]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) || (((((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1)) && ((((input == 6 || input == 3) || input == 4) || input == 2) || input == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && !(5 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1)) || (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0 && (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && (((input == 6 || input == 3) || input == 4) || input == 2)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && input == 1)))) || (((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && !(4 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && (!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && !(5 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16))) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) || (((((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1)) && ((((input == 6 || input == 3) || input == 4) || input == 2) || input == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && !(5 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1)) || (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0 && (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && (((input == 6 || input == 3) || input == 4) || input == 2)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && input == 1)))) || (((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && !(4 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && (!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && !(5 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16))) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - 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, 32.6s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1894 SDtfs, 5648 SDslu, 1045 SDs, 0 SdLazy, 11263 SolverSat, 1624 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 263 SyntacticMatches, 16 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4164occurred in iteration=9, 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.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 1290 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 95 NumberOfFragments, 653 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5781 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 440 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2484 NumberOfCodeBlocks, 2484 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2469 ConstructedInterpolants, 0 QuantifiedInterpolants, 2446801 SizeOfPredicates, 1 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1312/1466 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem01_label51_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-22_05-56-10-760.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem01_label51_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-22_05-56-10-760.csv Received shutdown request...