java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label13_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:50:08,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:50:08,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:50:08,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:50:08,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:50:08,192 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:50:08,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:50:08,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:50:08,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:50:08,197 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:50:08,198 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:50:08,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:50:08,199 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:50:08,200 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:50:08,201 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:50:08,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:50:08,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:50:08,205 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:50:08,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:50:08,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:50:08,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:50:08,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:50:08,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:50:08,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:50:08,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:50:08,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:50:08,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:50:08,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:50:08,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:50:08,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:50:08,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:50:08,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:50:08,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:50:08,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:50:08,233 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:50:08,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:50:08,236 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:50:08,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:50:08,262 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:50:08,262 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:50:08,263 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:50:08,263 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:50:08,263 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:50:08,264 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:50:08,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:50:08,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:50:08,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:50:08,268 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:50:08,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:50:08,268 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:50:08,268 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:50:08,268 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:50:08,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:50:08,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:50:08,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:50:08,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:50:08,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:50:08,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:50:08,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:50:08,270 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:50:08,270 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:50:08,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:50:08,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:50:08,271 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:50:08,272 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:50:08,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:50:08,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:50:08,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:50:08,350 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:50:08,351 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:50:08,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label13_true-unreach-call_false-termination.c [2018-10-24 14:50:08,411 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f4b273851/f87f2934781a45e7830eb76fd0186b29/FLAG6aade02a2 [2018-10-24 14:50:09,006 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:50:09,007 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label13_true-unreach-call_false-termination.c [2018-10-24 14:50:09,022 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f4b273851/f87f2934781a45e7830eb76fd0186b29/FLAG6aade02a2 [2018-10-24 14:50:09,037 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f4b273851/f87f2934781a45e7830eb76fd0186b29 [2018-10-24 14:50:09,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:50:09,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:50:09,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:09,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:50:09,055 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:50:09,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:09,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62cedf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09, skipping insertion in model container [2018-10-24 14:50:09,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:09,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:50:09,123 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:50:09,588 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:09,598 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:50:09,724 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:09,743 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:50:09,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09 WrapperNode [2018-10-24 14:50:09,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:09,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:09,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:50:09,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:50:09,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:09,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:09,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:09,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:50:09,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:50:09,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:50:09,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:09,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:09,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:09,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:09,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:09,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:10,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... [2018-10-24 14:50:10,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:50:10,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:50:10,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:50:10,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:50:10,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:50:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:50:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:50:10,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:50:13,397 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:50:13,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:13 BoogieIcfgContainer [2018-10-24 14:50:13,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:50:13,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:50:13,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:50:13,403 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:50:13,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:50:09" (1/3) ... [2018-10-24 14:50:13,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471916f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:13, skipping insertion in model container [2018-10-24 14:50:13,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:09" (2/3) ... [2018-10-24 14:50:13,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471916f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:13, skipping insertion in model container [2018-10-24 14:50:13,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:13" (3/3) ... [2018-10-24 14:50:13,408 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label13_true-unreach-call_false-termination.c [2018-10-24 14:50:13,418 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:50:13,432 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:50:13,452 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:50:13,508 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:50:13,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:50:13,510 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:50:13,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:50:13,510 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:50:13,512 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:50:13,512 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:50:13,512 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:50:13,513 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:50:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:50:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-24 14:50:13,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:13,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:13,562 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:13,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1256933503, now seen corresponding path program 1 times [2018-10-24 14:50:13,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:13,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:13,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:13,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:14,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:14,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:14,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:14,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:14,297 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-10-24 14:50:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:16,648 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-10-24 14:50:16,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:16,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-10-24 14:50:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:16,676 INFO L225 Difference]: With dead ends: 666 [2018-10-24 14:50:16,677 INFO L226 Difference]: Without dead ends: 460 [2018-10-24 14:50:16,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-24 14:50:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-10-24 14:50:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-24 14:50:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 743 transitions. [2018-10-24 14:50:16,759 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 743 transitions. Word has length 124 [2018-10-24 14:50:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:16,760 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 743 transitions. [2018-10-24 14:50:16,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 743 transitions. [2018-10-24 14:50:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-24 14:50:16,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:16,766 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:16,767 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:16,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:16,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1510696456, now seen corresponding path program 1 times [2018-10-24 14:50:16,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:16,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:17,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:17,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:17,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:17,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:17,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:17,006 INFO L87 Difference]: Start difference. First operand 460 states and 743 transitions. Second operand 4 states. [2018-10-24 14:50:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:18,339 INFO L93 Difference]: Finished difference Result 1314 states and 2164 transitions. [2018-10-24 14:50:18,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:18,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-10-24 14:50:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:18,347 INFO L225 Difference]: With dead ends: 1314 [2018-10-24 14:50:18,347 INFO L226 Difference]: Without dead ends: 856 [2018-10-24 14:50:18,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-24 14:50:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-10-24 14:50:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-24 14:50:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1279 transitions. [2018-10-24 14:50:18,397 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1279 transitions. Word has length 130 [2018-10-24 14:50:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:18,397 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1279 transitions. [2018-10-24 14:50:18,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1279 transitions. [2018-10-24 14:50:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-24 14:50:18,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:18,406 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:18,406 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:18,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:18,407 INFO L82 PathProgramCache]: Analyzing trace with hash -289143223, now seen corresponding path program 1 times [2018-10-24 14:50:18,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:18,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:18,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:18,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:18,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:50:18,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:18,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:18,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:18,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:18,516 INFO L87 Difference]: Start difference. First operand 856 states and 1279 transitions. Second operand 3 states. [2018-10-24 14:50:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:20,936 INFO L93 Difference]: Finished difference Result 2106 states and 3236 transitions. [2018-10-24 14:50:20,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:20,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-10-24 14:50:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:20,944 INFO L225 Difference]: With dead ends: 2106 [2018-10-24 14:50:20,944 INFO L226 Difference]: Without dead ends: 1252 [2018-10-24 14:50:20,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-10-24 14:50:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-10-24 14:50:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-24 14:50:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1911 transitions. [2018-10-24 14:50:20,980 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1911 transitions. Word has length 152 [2018-10-24 14:50:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:20,980 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1911 transitions. [2018-10-24 14:50:20,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1911 transitions. [2018-10-24 14:50:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-24 14:50:20,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:20,985 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:20,985 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:20,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:20,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1795961702, now seen corresponding path program 1 times [2018-10-24 14:50:20,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:20,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:20,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:20,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:20,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-24 14:50:21,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:21,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:21,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:21,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:21,177 INFO L87 Difference]: Start difference. First operand 1252 states and 1911 transitions. Second operand 3 states. [2018-10-24 14:50:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:22,189 INFO L93 Difference]: Finished difference Result 3294 states and 4988 transitions. [2018-10-24 14:50:22,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:22,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-24 14:50:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:22,201 INFO L225 Difference]: With dead ends: 3294 [2018-10-24 14:50:22,201 INFO L226 Difference]: Without dead ends: 2044 [2018-10-24 14:50:22,203 INFO L605 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-10-24 14:50:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-10-24 14:50:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2018-10-24 14:50:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-10-24 14:50:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2899 transitions. [2018-10-24 14:50:22,245 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2899 transitions. Word has length 190 [2018-10-24 14:50:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:22,246 INFO L481 AbstractCegarLoop]: Abstraction has 2044 states and 2899 transitions. [2018-10-24 14:50:22,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2899 transitions. [2018-10-24 14:50:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-24 14:50:22,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:22,251 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:22,252 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:22,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:22,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1708378618, now seen corresponding path program 1 times [2018-10-24 14:50:22,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:22,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:22,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:22,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:22,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-24 14:50:22,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:22,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:22,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:22,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:22,415 INFO L87 Difference]: Start difference. First operand 2044 states and 2899 transitions. Second operand 4 states. [2018-10-24 14:50:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:23,456 INFO L93 Difference]: Finished difference Result 4405 states and 6184 transitions. [2018-10-24 14:50:23,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:50:23,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-10-24 14:50:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:23,468 INFO L225 Difference]: With dead ends: 4405 [2018-10-24 14:50:23,468 INFO L226 Difference]: Without dead ends: 2363 [2018-10-24 14:50:23,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:50:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2018-10-24 14:50:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2303. [2018-10-24 14:50:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2018-10-24 14:50:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3186 transitions. [2018-10-24 14:50:23,511 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3186 transitions. Word has length 198 [2018-10-24 14:50:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:23,512 INFO L481 AbstractCegarLoop]: Abstraction has 2303 states and 3186 transitions. [2018-10-24 14:50:23,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3186 transitions. [2018-10-24 14:50:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-24 14:50:23,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:23,518 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:23,518 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:23,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1339249826, now seen corresponding path program 1 times [2018-10-24 14:50:23,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:23,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:23,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-24 14:50:23,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:23,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:23,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:23,710 INFO L87 Difference]: Start difference. First operand 2303 states and 3186 transitions. Second operand 4 states. [2018-10-24 14:50:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:25,095 INFO L93 Difference]: Finished difference Result 4736 states and 6603 transitions. [2018-10-24 14:50:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:25,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-10-24 14:50:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:25,106 INFO L225 Difference]: With dead ends: 4736 [2018-10-24 14:50:25,106 INFO L226 Difference]: Without dead ends: 2435 [2018-10-24 14:50:25,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-10-24 14:50:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2018-10-24 14:50:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-24 14:50:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3341 transitions. [2018-10-24 14:50:25,159 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3341 transitions. Word has length 203 [2018-10-24 14:50:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:25,159 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 3341 transitions. [2018-10-24 14:50:25,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3341 transitions. [2018-10-24 14:50:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-24 14:50:25,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:25,166 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:25,167 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:25,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:25,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1557363354, now seen corresponding path program 1 times [2018-10-24 14:50:25,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:25,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:25,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:25,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:25,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-24 14:50:25,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:25,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:25,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:25,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:25,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:25,300 INFO L87 Difference]: Start difference. First operand 2435 states and 3341 transitions. Second operand 3 states. [2018-10-24 14:50:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:26,469 INFO L93 Difference]: Finished difference Result 6439 states and 8708 transitions. [2018-10-24 14:50:26,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:26,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-10-24 14:50:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:26,481 INFO L225 Difference]: With dead ends: 6439 [2018-10-24 14:50:26,482 INFO L226 Difference]: Without dead ends: 2849 [2018-10-24 14:50:26,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2018-10-24 14:50:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2825. [2018-10-24 14:50:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2018-10-24 14:50:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3204 transitions. [2018-10-24 14:50:26,536 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3204 transitions. Word has length 206 [2018-10-24 14:50:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:26,537 INFO L481 AbstractCegarLoop]: Abstraction has 2825 states and 3204 transitions. [2018-10-24 14:50:26,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3204 transitions. [2018-10-24 14:50:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-24 14:50:26,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:26,544 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:26,544 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:26,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:26,544 INFO L82 PathProgramCache]: Analyzing trace with hash 962797039, now seen corresponding path program 1 times [2018-10-24 14:50:26,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:26,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:26,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:26,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:26,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-24 14:50:26,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:26,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:26,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:26,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:26,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:26,759 INFO L87 Difference]: Start difference. First operand 2825 states and 3204 transitions. Second operand 3 states. [2018-10-24 14:50:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:27,522 INFO L93 Difference]: Finished difference Result 7230 states and 8223 transitions. [2018-10-24 14:50:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:27,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-24 14:50:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:27,538 INFO L225 Difference]: With dead ends: 7230 [2018-10-24 14:50:27,538 INFO L226 Difference]: Without dead ends: 4139 [2018-10-24 14:50:27,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2018-10-24 14:50:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 3994. [2018-10-24 14:50:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3994 states. [2018-10-24 14:50:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 4412 transitions. [2018-10-24 14:50:27,605 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 4412 transitions. Word has length 220 [2018-10-24 14:50:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:27,605 INFO L481 AbstractCegarLoop]: Abstraction has 3994 states and 4412 transitions. [2018-10-24 14:50:27,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 4412 transitions. [2018-10-24 14:50:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-24 14:50:27,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:27,613 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:27,614 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:27,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:27,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1801608020, now seen corresponding path program 1 times [2018-10-24 14:50:27,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:27,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:27,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:28,054 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:50:28,329 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:50:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 27 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-24 14:50:28,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:50:28,421 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:50:28,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:28,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:50:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 14:50:28,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:50:28,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 14:50:28,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:50:28,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:50:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:50:28,691 INFO L87 Difference]: Start difference. First operand 3994 states and 4412 transitions. Second operand 8 states. [2018-10-24 14:50:34,780 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:50:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:36,987 INFO L93 Difference]: Finished difference Result 7596 states and 8414 transitions. [2018-10-24 14:50:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:50:36,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2018-10-24 14:50:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:37,002 INFO L225 Difference]: With dead ends: 7596 [2018-10-24 14:50:37,002 INFO L226 Difference]: Without dead ends: 3469 [2018-10-24 14:50:37,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:50:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2018-10-24 14:50:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3061. [2018-10-24 14:50:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2018-10-24 14:50:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 3306 transitions. [2018-10-24 14:50:37,063 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 3306 transitions. Word has length 250 [2018-10-24 14:50:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:37,063 INFO L481 AbstractCegarLoop]: Abstraction has 3061 states and 3306 transitions. [2018-10-24 14:50:37,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:50:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 3306 transitions. [2018-10-24 14:50:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-24 14:50:37,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:37,072 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:37,072 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:37,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash -53450395, now seen corresponding path program 1 times [2018-10-24 14:50:37,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:37,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-24 14:50:37,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:37,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:37,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:37,454 INFO L87 Difference]: Start difference. First operand 3061 states and 3306 transitions. Second operand 4 states. [2018-10-24 14:50:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:38,651 INFO L93 Difference]: Finished difference Result 6120 states and 6626 transitions. [2018-10-24 14:50:38,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:38,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2018-10-24 14:50:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:38,662 INFO L225 Difference]: With dead ends: 6120 [2018-10-24 14:50:38,662 INFO L226 Difference]: Without dead ends: 3193 [2018-10-24 14:50:38,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2018-10-24 14:50:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3061. [2018-10-24 14:50:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2018-10-24 14:50:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 3286 transitions. [2018-10-24 14:50:38,708 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 3286 transitions. Word has length 301 [2018-10-24 14:50:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:38,709 INFO L481 AbstractCegarLoop]: Abstraction has 3061 states and 3286 transitions. [2018-10-24 14:50:38,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 3286 transitions. [2018-10-24 14:50:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-24 14:50:38,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:38,717 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:50:38,717 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:38,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:38,718 INFO L82 PathProgramCache]: Analyzing trace with hash 954121372, now seen corresponding path program 1 times [2018-10-24 14:50:38,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:38,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:38,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-10-24 14:50:39,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:39,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:39,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:39,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:39,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:39,185 INFO L87 Difference]: Start difference. First operand 3061 states and 3286 transitions. Second operand 4 states. [2018-10-24 14:50:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:40,185 INFO L93 Difference]: Finished difference Result 5720 states and 6161 transitions. [2018-10-24 14:50:40,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:40,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-10-24 14:50:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:40,186 INFO L225 Difference]: With dead ends: 5720 [2018-10-24 14:50:40,186 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:50:40,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:50:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:50:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:50:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:50:40,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323 [2018-10-24 14:50:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:40,192 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:50:40,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:50:40,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:50:40,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:50:40,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:40,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:40,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:40,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:40,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:40,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:40,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:40,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:50:41,927 WARN L179 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-10-24 14:50:42,149 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-10-24 14:50:42,169 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:50:42,169 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:50:42,170 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,170 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,170 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,170 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,170 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,170 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,170 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:50:42,170 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:50:42,171 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:50:42,171 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:50:42,171 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:50:42,171 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:50:42,171 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:50:42,171 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:50:42,171 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:50:42,171 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:50:42,171 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,172 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,172 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,172 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,172 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,172 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,172 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:50:42,172 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:50:42,172 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:50:42,172 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:50:42,173 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:50:42,173 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:50:42,173 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:50:42,173 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:50:42,173 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 545) no Hoare annotation was computed. [2018-10-24 14:50:42,173 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:50:42,173 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:50:42,174 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:50:42,174 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:50:42,174 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:50:42,174 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:50:42,174 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:50:42,174 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,174 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,174 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,174 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,175 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,175 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:50:42,175 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:50:42,175 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:50:42,175 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:50:42,175 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:50:42,175 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:50:42,175 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:50:42,175 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:50:42,176 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:50:42,176 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse2 (= ~a16~0 5)) (.cse6 (= ~a16~0 4)) (.cse5 (= ~a20~0 1)) (.cse9 (not .cse8)) (.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a21~0 1)) (.cse1 (<= ~a7~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse6 .cse0 .cse1) (and .cse7 .cse0 .cse5 .cse8 .cse1) (and .cse3 (<= ~a21~0 0)) (and .cse3 .cse0 .cse2) (and .cse3 .cse6 .cse0) (and .cse3 .cse9 .cse0 .cse5) (and .cse3 .cse9 .cse7 .cse0) (and .cse3 .cse4 .cse7 .cse0) (and .cse4 .cse0 .cse8 .cse1)))) [2018-10-24 14:50:42,176 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,176 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,177 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,177 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,177 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,177 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:50:42,177 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:50:42,177 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:50:42,177 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:50:42,177 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:50:42,178 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:50:42,178 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:50:42,178 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:50:42,178 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:50:42,178 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:50:42,178 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:50:42,178 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:50:42,178 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:50:42,178 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:50:42,178 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,179 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,179 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,179 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,179 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,179 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:50:42,179 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:50:42,179 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:50:42,179 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:50:42,180 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:50:42,180 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:50:42,180 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:50:42,180 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:50:42,180 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:50:42,180 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,180 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,180 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,180 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,181 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,181 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:50:42,181 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:50:42,181 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:50:42,181 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:50:42,181 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:50:42,181 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:50:42,181 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:50:42,181 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:50:42,182 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:50:42,182 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:50:42,182 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:50:42,182 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:50:42,182 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:50:42,182 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:50:42,182 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:50:42,182 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:50:42,183 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,183 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,183 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,183 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse2 (= ~a16~0 5)) (.cse6 (= ~a16~0 4)) (.cse5 (= ~a20~0 1)) (.cse9 (not .cse8)) (.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a21~0 1)) (.cse1 (<= ~a7~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse6 .cse0 .cse1) (and .cse7 .cse0 .cse5 .cse8 .cse1) (and .cse3 (<= ~a21~0 0)) (and .cse3 .cse0 .cse2) (and .cse3 .cse6 .cse0) (and .cse3 .cse9 .cse0 .cse5) (and .cse3 .cse9 .cse7 .cse0) (and .cse3 .cse4 .cse7 .cse0) (and .cse4 .cse0 .cse8 .cse1)))) [2018-10-24 14:50:42,183 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,183 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,183 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:50:42,184 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:50:42,184 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:50:42,184 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:50:42,184 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:50:42,184 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:50:42,184 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:50:42,184 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:50:42,184 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,185 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,185 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,185 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,185 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,185 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:50:42,185 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:50:42,185 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:50:42,185 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:50:42,186 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:50:42,186 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:50:42,186 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:50:42,186 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:50:42,186 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:50:42,186 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:50:42,186 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:50:42,186 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:50:42,186 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:50:42,187 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:50:42,188 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:50:42,189 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:50:42,190 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:50:42,191 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:50:42,191 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:50:42,191 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,191 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,191 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,191 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,191 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,191 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:42,191 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:50:42,192 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:50:42,192 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:50:42,192 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:50:42,192 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:50:42,192 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:50:42,192 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:50:42,192 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:50:42,192 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:50:42,192 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:50:42,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:50:42 BoogieIcfgContainer [2018-10-24 14:50:42,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:50:42,215 INFO L168 Benchmark]: Toolchain (without parser) took 33166.24 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -731.1 MB). Peak memory consumption was 378.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:42,216 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:50:42,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:42,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 195.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.7 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:42,218 INFO L168 Benchmark]: Boogie Preprocessor took 83.77 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:50:42,219 INFO L168 Benchmark]: RCFGBuilder took 3373.43 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 115.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:42,219 INFO L168 Benchmark]: TraceAbstraction took 28814.56 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 356.5 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -71.3 MB). Peak memory consumption was 285.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:42,225 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 693.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 195.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.7 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.77 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3373.43 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 115.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28814.56 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 356.5 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -71.3 MB). Peak memory consumption was 285.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((a21 == 1 && a7 <= 0) && a16 == 5) || (((a7 == 1 && a8 == 15) && a21 == 1) && a20 == 1)) || ((a16 == 4 && a21 == 1) && a7 <= 0)) || ((((a17 == 1 && a21 == 1) && a20 == 1) && a16 == 6) && a7 <= 0)) || (a7 == 1 && a21 <= 0)) || ((a7 == 1 && a21 == 1) && a16 == 5)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || (((a7 == 1 && !(a16 == 6)) && a21 == 1) && a20 == 1)) || (((a7 == 1 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((a7 == 1 && a8 == 15) && a17 == 1) && a21 == 1)) || (((a8 == 15 && a21 == 1) && a16 == 6) && a7 <= 0) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((a21 == 1 && a7 <= 0) && a16 == 5) || (((a7 == 1 && a8 == 15) && a21 == 1) && a20 == 1)) || ((a16 == 4 && a21 == 1) && a7 <= 0)) || ((((a17 == 1 && a21 == 1) && a20 == 1) && a16 == 6) && a7 <= 0)) || (a7 == 1 && a21 <= 0)) || ((a7 == 1 && a21 == 1) && a16 == 5)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || (((a7 == 1 && !(a16 == 6)) && a21 == 1) && a20 == 1)) || (((a7 == 1 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((a7 == 1 && a8 == 15) && a17 == 1) && a21 == 1)) || (((a8 == 15 && a21 == 1) && a16 == 6) && a7 <= 0) - 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, 28.6s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 22.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1428 SDtfs, 3237 SDslu, 589 SDs, 0 SdLazy, 6601 SolverSat, 1199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3994occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 769 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 74 NumberOfFragments, 263 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2142 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2547 NumberOfCodeBlocks, 2547 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2535 ConstructedInterpolants, 0 QuantifiedInterpolants, 1123594 SizeOfPredicates, 1 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2293/2320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...