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/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b6335f6 [2018-10-23 09:39:43,118 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 09:39:43,121 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 09:39:43,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 09:39:43,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 09:39:43,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 09:39:43,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 09:39:43,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 09:39:43,147 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 09:39:43,153 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 09:39:43,154 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 09:39:43,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 09:39:43,159 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 09:39:43,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 09:39:43,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 09:39:43,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 09:39:43,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 09:39:43,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 09:39:43,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 09:39:43,175 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 09:39:43,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 09:39:43,180 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 09:39:43,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 09:39:43,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 09:39:43,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 09:39:43,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 09:39:43,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 09:39:43,189 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 09:39:43,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 09:39:43,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 09:39:43,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 09:39:43,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 09:39:43,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 09:39:43,195 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 09:39:43,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 09:39:43,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 09:39:43,198 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 09:39:43,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 09:39:43,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 09:39:43,222 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 09:39:43,222 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 09:39:43,223 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 09:39:43,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 09:39:43,223 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 09:39:43,224 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 09:39:43,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 09:39:43,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 09:39:43,224 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 09:39:43,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 09:39:43,225 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 09:39:43,225 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 09:39:43,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 09:39:43,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 09:39:43,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 09:39:43,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 09:39:43,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 09:39:43,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 09:39:43,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 09:39:43,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 09:39:43,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 09:39:43,227 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 09:39:43,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 09:39:43,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 09:39:43,227 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 09:39:43,228 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 09:39:43,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 09:39:43,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 09:39:43,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 09:39:43,291 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 09:39:43,292 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 09:39:43,292 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-10-23 09:39:43,357 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/879b5ba5c/1bd0dad5272e4b86956484582ec87b66/FLAGfbd2ccbaa [2018-10-23 09:39:43,865 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 09:39:43,866 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-10-23 09:39:43,876 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/879b5ba5c/1bd0dad5272e4b86956484582ec87b66/FLAGfbd2ccbaa [2018-10-23 09:39:43,891 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/879b5ba5c/1bd0dad5272e4b86956484582ec87b66 [2018-10-23 09:39:43,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 09:39:43,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 09:39:43,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 09:39:43,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 09:39:43,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 09:39:43,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:39:43" (1/1) ... [2018-10-23 09:39:43,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b59c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:43, skipping insertion in model container [2018-10-23 09:39:43,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:39:43" (1/1) ... [2018-10-23 09:39:43,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 09:39:43,958 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 09:39:44,239 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:39:44,249 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 09:39:44,321 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:39:44,345 INFO L193 MainTranslator]: Completed translation [2018-10-23 09:39:44,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44 WrapperNode [2018-10-23 09:39:44,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 09:39:44,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 09:39:44,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 09:39:44,347 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 09:39:44,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... [2018-10-23 09:39:44,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... [2018-10-23 09:39:44,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 09:39:44,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 09:39:44,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 09:39:44,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 09:39:44,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... [2018-10-23 09:39:44,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... [2018-10-23 09:39:44,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... [2018-10-23 09:39:44,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... [2018-10-23 09:39:44,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... [2018-10-23 09:39:44,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... [2018-10-23 09:39:44,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... [2018-10-23 09:39:44,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 09:39:44,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 09:39:44,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 09:39:44,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 09:39:44,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 09:39:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 09:39:44,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 09:39:45,259 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 09:39:45,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:39:45 BoogieIcfgContainer [2018-10-23 09:39:45,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 09:39:45,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 09:39:45,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 09:39:45,264 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 09:39:45,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:39:43" (1/3) ... [2018-10-23 09:39:45,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8d2950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:39:45, skipping insertion in model container [2018-10-23 09:39:45,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:44" (2/3) ... [2018-10-23 09:39:45,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8d2950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:39:45, skipping insertion in model container [2018-10-23 09:39:45,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:39:45" (3/3) ... [2018-10-23 09:39:45,268 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-10-23 09:39:45,276 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 09:39:45,284 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-10-23 09:39:45,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-10-23 09:39:45,335 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 09:39:45,336 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 09:39:45,336 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 09:39:45,336 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 09:39:45,336 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 09:39:45,336 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 09:39:45,337 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 09:39:45,337 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 09:39:45,337 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 09:39:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2018-10-23 09:39:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-23 09:39:45,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:45,364 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:45,367 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:45,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:45,374 INFO L82 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2018-10-23 09:39:45,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:45,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:45,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:45,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:45,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:45,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:45,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:45,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:45,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:45,794 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 5 states. [2018-10-23 09:39:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:46,260 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2018-10-23 09:39:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:46,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-23 09:39:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:46,272 INFO L225 Difference]: With dead ends: 123 [2018-10-23 09:39:46,272 INFO L226 Difference]: Without dead ends: 107 [2018-10-23 09:39:46,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-23 09:39:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2018-10-23 09:39:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-23 09:39:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-10-23 09:39:46,317 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2018-10-23 09:39:46,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:46,317 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-10-23 09:39:46,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-10-23 09:39:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-23 09:39:46,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:46,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:46,319 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:46,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:46,320 INFO L82 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2018-10-23 09:39:46,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:46,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:46,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:46,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:46,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:46,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:46,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:46,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:46,404 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2018-10-23 09:39:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:46,627 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-10-23 09:39:46,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:46,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-23 09:39:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:46,633 INFO L225 Difference]: With dead ends: 107 [2018-10-23 09:39:46,634 INFO L226 Difference]: Without dead ends: 105 [2018-10-23 09:39:46,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-23 09:39:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2018-10-23 09:39:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-23 09:39:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-10-23 09:39:46,645 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2018-10-23 09:39:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:46,645 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-10-23 09:39:46,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-10-23 09:39:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-23 09:39:46,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:46,646 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:46,647 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:46,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2018-10-23 09:39:46,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:46,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:46,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:46,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:46,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:46,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:46,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:46,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:46,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:46,923 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-10-23 09:39:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:47,341 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-10-23 09:39:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:47,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-10-23 09:39:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:47,343 INFO L225 Difference]: With dead ends: 105 [2018-10-23 09:39:47,343 INFO L226 Difference]: Without dead ends: 103 [2018-10-23 09:39:47,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-23 09:39:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 65. [2018-10-23 09:39:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-23 09:39:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-10-23 09:39:47,352 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2018-10-23 09:39:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:47,352 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-10-23 09:39:47,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-10-23 09:39:47,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-23 09:39:47,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:47,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:47,354 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:47,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2018-10-23 09:39:47,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:47,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:47,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:47,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:47,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:47,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:47,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:47,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:47,469 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-10-23 09:39:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:47,878 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-10-23 09:39:47,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:47,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-10-23 09:39:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:47,880 INFO L225 Difference]: With dead ends: 101 [2018-10-23 09:39:47,880 INFO L226 Difference]: Without dead ends: 99 [2018-10-23 09:39:47,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-23 09:39:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2018-10-23 09:39:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-23 09:39:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-10-23 09:39:47,901 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2018-10-23 09:39:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:47,901 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-10-23 09:39:47,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-10-23 09:39:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 09:39:47,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:47,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:47,906 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:47,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2018-10-23 09:39:47,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:47,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:47,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:47,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:47,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:48,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:48,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:48,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:48,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:48,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:48,086 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-10-23 09:39:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:48,646 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-10-23 09:39:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:48,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-23 09:39:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:48,648 INFO L225 Difference]: With dead ends: 99 [2018-10-23 09:39:48,649 INFO L226 Difference]: Without dead ends: 95 [2018-10-23 09:39:48,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-23 09:39:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-23 09:39:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2018-10-23 09:39:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-23 09:39:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-10-23 09:39:48,658 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2018-10-23 09:39:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:48,658 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-10-23 09:39:48,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-10-23 09:39:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 09:39:48,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:48,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:48,661 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:48,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2018-10-23 09:39:48,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:48,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:48,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:48,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:48,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:48,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:48,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:48,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:48,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:48,730 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-10-23 09:39:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:48,897 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-10-23 09:39:48,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:48,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-23 09:39:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:48,900 INFO L225 Difference]: With dead ends: 95 [2018-10-23 09:39:48,900 INFO L226 Difference]: Without dead ends: 93 [2018-10-23 09:39:48,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-23 09:39:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 57. [2018-10-23 09:39:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-23 09:39:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-10-23 09:39:48,909 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2018-10-23 09:39:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:48,909 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-10-23 09:39:48,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-10-23 09:39:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 09:39:48,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:48,910 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:48,911 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:48,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2018-10-23 09:39:48,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:48,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:48,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:48,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:48,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:48,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:48,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:48,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:48,989 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 6 states. [2018-10-23 09:39:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:49,229 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-10-23 09:39:49,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:49,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-23 09:39:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:49,232 INFO L225 Difference]: With dead ends: 134 [2018-10-23 09:39:49,232 INFO L226 Difference]: Without dead ends: 132 [2018-10-23 09:39:49,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-23 09:39:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 55. [2018-10-23 09:39:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-23 09:39:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-10-23 09:39:49,241 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2018-10-23 09:39:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:49,241 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-10-23 09:39:49,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-10-23 09:39:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 09:39:49,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:49,242 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:49,243 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:49,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:49,244 INFO L82 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2018-10-23 09:39:49,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:49,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:49,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:49,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:49,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:49,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:49,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:49,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:49,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:49,325 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-10-23 09:39:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:49,512 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-10-23 09:39:49,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:49,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-23 09:39:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:49,515 INFO L225 Difference]: With dead ends: 89 [2018-10-23 09:39:49,515 INFO L226 Difference]: Without dead ends: 83 [2018-10-23 09:39:49,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-23 09:39:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-23 09:39:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2018-10-23 09:39:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-23 09:39:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-10-23 09:39:49,523 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2018-10-23 09:39:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:49,523 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-10-23 09:39:49,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-10-23 09:39:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 09:39:49,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:49,524 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:49,525 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:49,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2018-10-23 09:39:49,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:49,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 09:39:49,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:49,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:49,684 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 9 states. [2018-10-23 09:39:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:49,890 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-10-23 09:39:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:49,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-23 09:39:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:49,899 INFO L225 Difference]: With dead ends: 83 [2018-10-23 09:39:49,899 INFO L226 Difference]: Without dead ends: 81 [2018-10-23 09:39:49,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-23 09:39:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-23 09:39:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 49. [2018-10-23 09:39:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-23 09:39:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-10-23 09:39:49,911 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 13 [2018-10-23 09:39:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:49,911 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-10-23 09:39:49,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-10-23 09:39:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 09:39:49,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:49,912 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:49,913 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:49,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2018-10-23 09:39:49,914 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:49,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:49,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:49,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:50,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:50,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 09:39:50,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:50,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:50,220 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 9 states. [2018-10-23 09:39:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:50,630 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-10-23 09:39:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:50,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-23 09:39:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:50,632 INFO L225 Difference]: With dead ends: 86 [2018-10-23 09:39:50,632 INFO L226 Difference]: Without dead ends: 84 [2018-10-23 09:39:50,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-23 09:39:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-23 09:39:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2018-10-23 09:39:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-23 09:39:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-10-23 09:39:50,639 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2018-10-23 09:39:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:50,639 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-10-23 09:39:50,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-10-23 09:39:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 09:39:50,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:50,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:50,641 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:50,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2018-10-23 09:39:50,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:50,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:50,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:50,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:50,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:50,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:50,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:50,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:50,698 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-10-23 09:39:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:51,010 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-10-23 09:39:51,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:51,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-23 09:39:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:51,012 INFO L225 Difference]: With dead ends: 111 [2018-10-23 09:39:51,012 INFO L226 Difference]: Without dead ends: 109 [2018-10-23 09:39:51,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-23 09:39:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 45. [2018-10-23 09:39:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-23 09:39:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-10-23 09:39:51,020 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 13 [2018-10-23 09:39:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:51,020 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-10-23 09:39:51,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-10-23 09:39:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 09:39:51,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:51,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:51,022 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:51,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2018-10-23 09:39:51,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:51,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:51,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:51,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:51,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:51,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:51,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:51,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:51,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:51,169 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-10-23 09:39:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:51,336 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-10-23 09:39:51,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:51,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-23 09:39:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:51,338 INFO L225 Difference]: With dead ends: 73 [2018-10-23 09:39:51,338 INFO L226 Difference]: Without dead ends: 71 [2018-10-23 09:39:51,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-23 09:39:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-10-23 09:39:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-23 09:39:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-10-23 09:39:51,345 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2018-10-23 09:39:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:51,345 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-10-23 09:39:51,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-10-23 09:39:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:51,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:51,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:51,347 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:51,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:51,347 INFO L82 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2018-10-23 09:39:51,348 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:51,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:51,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:51,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:51,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 09:39:51,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:51,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:51,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:51,460 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-10-23 09:39:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:51,648 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-10-23 09:39:51,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:51,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-10-23 09:39:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:51,650 INFO L225 Difference]: With dead ends: 60 [2018-10-23 09:39:51,651 INFO L226 Difference]: Without dead ends: 58 [2018-10-23 09:39:51,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-23 09:39:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-23 09:39:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-10-23 09:39:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-23 09:39:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-10-23 09:39:51,658 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-10-23 09:39:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:51,658 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-10-23 09:39:51,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-10-23 09:39:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:51,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:51,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:51,660 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:51,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2018-10-23 09:39:51,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:51,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:51,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:51,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:51,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:51,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:51,747 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2018-10-23 09:39:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:52,161 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-10-23 09:39:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:52,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-10-23 09:39:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:52,163 INFO L225 Difference]: With dead ends: 101 [2018-10-23 09:39:52,163 INFO L226 Difference]: Without dead ends: 99 [2018-10-23 09:39:52,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-23 09:39:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 39. [2018-10-23 09:39:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-23 09:39:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-10-23 09:39:52,172 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2018-10-23 09:39:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:52,172 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-10-23 09:39:52,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-10-23 09:39:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:52,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:52,174 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:52,174 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:52,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2018-10-23 09:39:52,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:52,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:52,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:52,460 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-23 09:39:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:52,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:52,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 09:39:52,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:52,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:52,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:52,499 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-10-23 09:39:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:52,706 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-10-23 09:39:52,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:52,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-10-23 09:39:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:52,707 INFO L225 Difference]: With dead ends: 40 [2018-10-23 09:39:52,707 INFO L226 Difference]: Without dead ends: 36 [2018-10-23 09:39:52,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-10-23 09:39:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-23 09:39:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-23 09:39:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-23 09:39:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-10-23 09:39:52,715 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-10-23 09:39:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:52,715 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-10-23 09:39:52,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-10-23 09:39:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-23 09:39:52,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:52,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:52,717 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:52,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:52,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2018-10-23 09:39:52,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:52,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:52,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:52,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:52,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:52,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:52,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 09:39:52,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:52,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:52,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:52,981 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 9 states. [2018-10-23 09:39:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:53,267 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-10-23 09:39:53,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:53,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-23 09:39:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:53,268 INFO L225 Difference]: With dead ends: 51 [2018-10-23 09:39:53,268 INFO L226 Difference]: Without dead ends: 49 [2018-10-23 09:39:53,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-23 09:39:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-23 09:39:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-10-23 09:39:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-23 09:39:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-23 09:39:53,274 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2018-10-23 09:39:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:53,275 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-23 09:39:53,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-23 09:39:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-23 09:39:53,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:53,276 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:53,276 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:53,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2018-10-23 09:39:53,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:53,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:53,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:53,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:53,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 09:39:53,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 09:39:53,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 09:39:53,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:53,402 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2018-10-23 09:39:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:53,744 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-10-23 09:39:53,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:53,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-10-23 09:39:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:53,745 INFO L225 Difference]: With dead ends: 49 [2018-10-23 09:39:53,745 INFO L226 Difference]: Without dead ends: 47 [2018-10-23 09:39:53,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-10-23 09:39:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-23 09:39:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2018-10-23 09:39:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-23 09:39:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-10-23 09:39:53,754 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-10-23 09:39:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:53,754 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-10-23 09:39:53,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 09:39:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-10-23 09:39:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-23 09:39:53,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:53,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:53,755 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:53,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2018-10-23 09:39:53,756 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:53,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:54,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:54,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:54,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:54,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:54,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:54,108 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-10-23 09:39:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:54,640 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-10-23 09:39:54,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:54,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-23 09:39:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:54,641 INFO L225 Difference]: With dead ends: 45 [2018-10-23 09:39:54,641 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 09:39:54,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-23 09:39:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 09:39:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 09:39:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 09:39:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 09:39:54,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-10-23 09:39:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:54,643 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 09:39:54,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 09:39:54,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 09:39:54,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 09:39:54,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 09:39:54,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 09:39:54,889 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2018-10-23 09:39:54,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 09:39:54,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 09:39:55,728 WARN L179 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 14 [2018-10-23 09:39:55,900 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 6 [2018-10-23 09:39:56,389 WARN L179 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 13 [2018-10-23 09:39:56,432 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2018-10-23 09:39:56,432 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2018-10-23 09:39:56,432 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2018-10-23 09:39:56,432 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2018-10-23 09:39:56,432 INFO L425 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2018-10-23 09:39:56,432 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2018-10-23 09:39:56,433 INFO L425 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2018-10-23 09:39:56,433 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-23 09:39:56,433 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 09:39:56,433 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2018-10-23 09:39:56,433 INFO L428 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2018-10-23 09:39:56,433 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2018-10-23 09:39:56,433 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2018-10-23 09:39:56,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2018-10-23 09:39:56,435 INFO L421 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0)) [2018-10-23 09:39:56,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2018-10-23 09:39:56,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-10-23 09:39:56,435 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-23 09:39:56,435 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2018-10-23 09:39:56,435 INFO L425 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-10-23 09:39:56,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2018-10-23 09:39:56,435 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2018-10-23 09:39:56,435 INFO L425 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2018-10-23 09:39:56,436 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2018-10-23 09:39:56,437 INFO L428 ceAbstractionStarter]: At program point L395(lines 10 397) the Hoare annotation is: true [2018-10-23 09:39:56,437 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2018-10-23 09:39:56,437 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2018-10-23 09:39:56,437 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-23 09:39:56,437 INFO L421 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 0 ULTIMATE.start_main_~main__t~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 1)) [2018-10-23 09:39:56,437 INFO L421 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (or (<= 1 ULTIMATE.start_main_~main__t~0) (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (<= 0 ULTIMATE.start_main_~main__t~0)))) [2018-10-23 09:39:56,437 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2018-10-23 09:39:56,437 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L421 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2018-10-23 09:39:56,438 INFO L425 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2018-10-23 09:39:56,439 INFO L425 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2018-10-23 09:39:56,440 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2018-10-23 09:39:56,440 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-23 09:39:56,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:39:56 BoogieIcfgContainer [2018-10-23 09:39:56,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 09:39:56,456 INFO L168 Benchmark]: Toolchain (without parser) took 12555.10 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -853.8 MB). Peak memory consumption was 579.5 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:56,458 INFO L168 Benchmark]: CDTParser took 0.22 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-23 09:39:56,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.03 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:56,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 09:39:56,459 INFO L168 Benchmark]: Boogie Preprocessor took 48.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 09:39:56,460 INFO L168 Benchmark]: RCFGBuilder took 801.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:56,461 INFO L168 Benchmark]: TraceAbstraction took 11195.04 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 117.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -83.4 MB). Peak memory consumption was 599.6 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:56,466 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 443.03 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 801.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11195.04 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 117.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -83.4 MB). Peak memory consumption was 599.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && (1 <= main__t || (__VERIFIER_assert__cond == 1 && 0 <= main__t)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 18 error locations. SAFE Result, 11.1s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 793 SDtfs, 2459 SDslu, 1380 SDs, 0 SdLazy, 1827 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 602 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 14 NumberOfFragments, 52 HoareAnnotationTreeSize, 6 FomulaSimplifications, 9725370 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 381768 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 7734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...