java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:35:21,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:35:21,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:35:21,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:35:21,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:35:21,352 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:35:21,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:35:21,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:35:21,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:35:21,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:35:21,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:35:21,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:35:21,363 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:35:21,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:35:21,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:35:21,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:35:21,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:35:21,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:35:21,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:35:21,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:35:21,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:35:21,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:35:21,377 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:35:21,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:35:21,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:35:21,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:35:21,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:35:21,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:35:21,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:35:21,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:35:21,382 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:35:21,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:35:21,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:35:21,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:35:21,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:35:21,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:35:21,385 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-26 21:35:21,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:35:21,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:35:21,415 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:35:21,415 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:35:21,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:35:21,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:35:21,416 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:35:21,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:35:21,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:35:21,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:35:21,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:35:21,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:35:21,417 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:35:21,417 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:35:21,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:35:21,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:35:21,419 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:35:21,419 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:35:21,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:35:21,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:35:21,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:35:21,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:35:21,421 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:35:21,422 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:35:21,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:35:21,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:35:21,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:35:21,422 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:35:21,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:35:21,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:35:21,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:35:21,506 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:35:21,506 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:35:21,507 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45_true-unreach-call_false-termination.c [2018-10-26 21:35:21,570 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/011cda1a7/cb661fbaee4b40949a67a92c2d73f5ca/FLAG8d0d5cfd0 [2018-10-26 21:35:22,169 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:35:22,170 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label45_true-unreach-call_false-termination.c [2018-10-26 21:35:22,187 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/011cda1a7/cb661fbaee4b40949a67a92c2d73f5ca/FLAG8d0d5cfd0 [2018-10-26 21:35:22,208 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/011cda1a7/cb661fbaee4b40949a67a92c2d73f5ca [2018-10-26 21:35:22,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:35:22,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:35:22,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:35:22,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:35:22,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:35:22,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:35:22" (1/1) ... [2018-10-26 21:35:22,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afc856a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:22, skipping insertion in model container [2018-10-26 21:35:22,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:35:22" (1/1) ... [2018-10-26 21:35:22,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:35:22,332 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:35:22,796 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:35:22,800 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:35:22,994 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:35:23,013 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:35:23,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23 WrapperNode [2018-10-26 21:35:23,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:35:23,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:35:23,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:35:23,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:35:23,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (1/1) ... [2018-10-26 21:35:23,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (1/1) ... [2018-10-26 21:35:23,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:35:23,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:35:23,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:35:23,281 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:35:23,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (1/1) ... [2018-10-26 21:35:23,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (1/1) ... [2018-10-26 21:35:23,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (1/1) ... [2018-10-26 21:35:23,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (1/1) ... [2018-10-26 21:35:23,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (1/1) ... [2018-10-26 21:35:23,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (1/1) ... [2018-10-26 21:35:23,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (1/1) ... [2018-10-26 21:35:23,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:35:23,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:35:23,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:35:23,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:35:23,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (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-26 21:35:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:35:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:35:23,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:35:27,218 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:35:27,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:35:27 BoogieIcfgContainer [2018-10-26 21:35:27,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:35:27,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:35:27,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:35:27,228 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:35:27,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:35:22" (1/3) ... [2018-10-26 21:35:27,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0aaaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:35:27, skipping insertion in model container [2018-10-26 21:35:27,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:35:23" (2/3) ... [2018-10-26 21:35:27,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0aaaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:35:27, skipping insertion in model container [2018-10-26 21:35:27,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:35:27" (3/3) ... [2018-10-26 21:35:27,233 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label45_true-unreach-call_false-termination.c [2018-10-26 21:35:27,244 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:35:27,253 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:35:27,271 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:35:27,314 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:35:27,315 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:35:27,315 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:35:27,315 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:35:27,316 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:35:27,316 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:35:27,316 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:35:27,316 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:35:27,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:35:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-10-26 21:35:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:35:27,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:27,350 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:27,353 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:27,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash 680225122, now seen corresponding path program 1 times [2018-10-26 21:35:27,362 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:35:27,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:35:27,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:27,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:27,801 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-26 21:35:27,814 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-26 21:35:27,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:35:27,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:35:27,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:35:27,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:35:27,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:35:27,840 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-10-26 21:35:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:35:30,747 INFO L93 Difference]: Finished difference Result 870 states and 1578 transitions. [2018-10-26 21:35:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:35:30,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-26 21:35:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:35:30,772 INFO L225 Difference]: With dead ends: 870 [2018-10-26 21:35:30,772 INFO L226 Difference]: Without dead ends: 617 [2018-10-26 21:35:30,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:35:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-26 21:35:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 422. [2018-10-26 21:35:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-26 21:35:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 648 transitions. [2018-10-26 21:35:30,855 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 648 transitions. Word has length 37 [2018-10-26 21:35:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:35:30,856 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 648 transitions. [2018-10-26 21:35:30,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:35:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 648 transitions. [2018-10-26 21:35:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-26 21:35:30,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:30,862 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:30,862 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:30,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1683224818, now seen corresponding path program 1 times [2018-10-26 21:35:30,863 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:35:30,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:35:30,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:30,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:35:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:35:31,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:35:31,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:35:31,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:35:31,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:35:31,153 INFO L87 Difference]: Start difference. First operand 422 states and 648 transitions. Second operand 4 states. [2018-10-26 21:35:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:35:34,629 INFO L93 Difference]: Finished difference Result 1558 states and 2464 transitions. [2018-10-26 21:35:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:35:34,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-10-26 21:35:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:35:34,635 INFO L225 Difference]: With dead ends: 1558 [2018-10-26 21:35:34,635 INFO L226 Difference]: Without dead ends: 760 [2018-10-26 21:35:34,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:35:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-26 21:35:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2018-10-26 21:35:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-10-26 21:35:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1122 transitions. [2018-10-26 21:35:34,684 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1122 transitions. Word has length 117 [2018-10-26 21:35:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:35:34,685 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 1122 transitions. [2018-10-26 21:35:34,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:35:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1122 transitions. [2018-10-26 21:35:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 21:35:34,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:34,689 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:34,689 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:34,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:34,690 INFO L82 PathProgramCache]: Analyzing trace with hash -380483028, now seen corresponding path program 1 times [2018-10-26 21:35:34,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:35:34,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:35:34,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:34,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:34,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:35,347 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-10-26 21:35:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:35:35,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:35:35,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:35:35,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:35:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:35:35,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:35:35,483 INFO L87 Difference]: Start difference. First operand 760 states and 1122 transitions. Second operand 7 states. [2018-10-26 21:35:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:35:38,825 INFO L93 Difference]: Finished difference Result 1720 states and 2485 transitions. [2018-10-26 21:35:38,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:35:38,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-10-26 21:35:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:35:38,832 INFO L225 Difference]: With dead ends: 1720 [2018-10-26 21:35:38,832 INFO L226 Difference]: Without dead ends: 962 [2018-10-26 21:35:38,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:35:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-10-26 21:35:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 939. [2018-10-26 21:35:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-10-26 21:35:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1307 transitions. [2018-10-26 21:35:38,858 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1307 transitions. Word has length 129 [2018-10-26 21:35:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:35:38,859 INFO L481 AbstractCegarLoop]: Abstraction has 939 states and 1307 transitions. [2018-10-26 21:35:38,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:35:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1307 transitions. [2018-10-26 21:35:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-26 21:35:38,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:38,871 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:38,876 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:38,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash -807525568, now seen corresponding path program 1 times [2018-10-26 21:35:38,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:35:38,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:35:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:38,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 139 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:35:39,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:35:39,234 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:35:39,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:39,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:35:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 21:35:39,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:35:39,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 21:35:39,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:35:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:35:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:35:39,536 INFO L87 Difference]: Start difference. First operand 939 states and 1307 transitions. Second operand 6 states. [2018-10-26 21:35:40,705 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-26 21:35:43,188 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 21:35:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:35:46,242 INFO L93 Difference]: Finished difference Result 3524 states and 4877 transitions. [2018-10-26 21:35:46,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:35:46,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2018-10-26 21:35:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:35:46,255 INFO L225 Difference]: With dead ends: 3524 [2018-10-26 21:35:46,255 INFO L226 Difference]: Without dead ends: 2376 [2018-10-26 21:35:46,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:35:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2018-10-26 21:35:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1833. [2018-10-26 21:35:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2018-10-26 21:35:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2081 transitions. [2018-10-26 21:35:46,294 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2081 transitions. Word has length 210 [2018-10-26 21:35:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:35:46,295 INFO L481 AbstractCegarLoop]: Abstraction has 1833 states and 2081 transitions. [2018-10-26 21:35:46,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:35:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2081 transitions. [2018-10-26 21:35:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-26 21:35:46,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:46,301 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:46,302 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:46,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:46,302 INFO L82 PathProgramCache]: Analyzing trace with hash 626607161, now seen corresponding path program 1 times [2018-10-26 21:35:46,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:35:46,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:35:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:46,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 159 proven. 132 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-26 21:35:46,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:35:46,920 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:35:46,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:47,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:35:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-10-26 21:35:47,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:35:47,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-10-26 21:35:47,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:35:47,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:35:47,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:35:47,164 INFO L87 Difference]: Start difference. First operand 1833 states and 2081 transitions. Second operand 8 states. [2018-10-26 21:35:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:35:49,161 INFO L93 Difference]: Finished difference Result 4416 states and 5039 transitions. [2018-10-26 21:35:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:35:49,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 333 [2018-10-26 21:35:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:35:49,175 INFO L225 Difference]: With dead ends: 4416 [2018-10-26 21:35:49,175 INFO L226 Difference]: Without dead ends: 2764 [2018-10-26 21:35:49,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:35:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2018-10-26 21:35:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2728. [2018-10-26 21:35:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-10-26 21:35:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 3005 transitions. [2018-10-26 21:35:49,240 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 3005 transitions. Word has length 333 [2018-10-26 21:35:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:35:49,241 INFO L481 AbstractCegarLoop]: Abstraction has 2728 states and 3005 transitions. [2018-10-26 21:35:49,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:35:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3005 transitions. [2018-10-26 21:35:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-26 21:35:49,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:49,253 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:49,253 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:49,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1453595235, now seen corresponding path program 1 times [2018-10-26 21:35:49,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:35:49,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:35:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:49,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:49,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2018-10-26 21:35:49,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:35:49,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:35:49,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:35:49,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:35:49,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:35:49,900 INFO L87 Difference]: Start difference. First operand 2728 states and 3005 transitions. Second operand 4 states. [2018-10-26 21:35:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:35:52,142 INFO L93 Difference]: Finished difference Result 6707 states and 7633 transitions. [2018-10-26 21:35:52,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:35:52,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 442 [2018-10-26 21:35:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:35:52,161 INFO L225 Difference]: With dead ends: 6707 [2018-10-26 21:35:52,161 INFO L226 Difference]: Without dead ends: 4160 [2018-10-26 21:35:52,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:35:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4160 states. [2018-10-26 21:35:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4160 to 4160. [2018-10-26 21:35:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2018-10-26 21:35:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 4651 transitions. [2018-10-26 21:35:52,236 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 4651 transitions. Word has length 442 [2018-10-26 21:35:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:35:52,237 INFO L481 AbstractCegarLoop]: Abstraction has 4160 states and 4651 transitions. [2018-10-26 21:35:52,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:35:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 4651 transitions. [2018-10-26 21:35:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-10-26 21:35:52,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:52,250 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:52,250 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:52,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash 993275040, now seen corresponding path program 1 times [2018-10-26 21:35:52,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:35:52,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:35:52,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:52,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:52,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 425 proven. 316 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-26 21:35:53,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:35:53,305 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:35:53,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:53,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:35:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-26 21:35:53,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:35:53,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2018-10-26 21:35:53,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:35:53,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:35:53,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:35:53,872 INFO L87 Difference]: Start difference. First operand 4160 states and 4651 transitions. Second operand 9 states. [2018-10-26 21:35:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:35:57,416 INFO L93 Difference]: Finished difference Result 9213 states and 10309 transitions. [2018-10-26 21:35:57,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:35:57,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 475 [2018-10-26 21:35:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:35:57,438 INFO L225 Difference]: With dead ends: 9213 [2018-10-26 21:35:57,438 INFO L226 Difference]: Without dead ends: 4874 [2018-10-26 21:35:57,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:35:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-10-26 21:35:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4695. [2018-10-26 21:35:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4695 states. [2018-10-26 21:35:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 5121 transitions. [2018-10-26 21:35:57,544 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 5121 transitions. Word has length 475 [2018-10-26 21:35:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:35:57,545 INFO L481 AbstractCegarLoop]: Abstraction has 4695 states and 5121 transitions. [2018-10-26 21:35:57,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:35:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 5121 transitions. [2018-10-26 21:35:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-10-26 21:35:57,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:57,561 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:57,562 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:57,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash 856828454, now seen corresponding path program 1 times [2018-10-26 21:35:57,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:35:57,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:35:57,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:57,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:57,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:35:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-10-26 21:35:58,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:35:58,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:35:58,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:35:58,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:35:58,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:35:58,213 INFO L87 Difference]: Start difference. First operand 4695 states and 5121 transitions. Second operand 4 states. [2018-10-26 21:35:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:35:59,790 INFO L93 Difference]: Finished difference Result 9388 states and 10240 transitions. [2018-10-26 21:35:59,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:35:59,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 542 [2018-10-26 21:35:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:35:59,808 INFO L225 Difference]: With dead ends: 9388 [2018-10-26 21:35:59,808 INFO L226 Difference]: Without dead ends: 4695 [2018-10-26 21:35:59,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:35:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2018-10-26 21:35:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 4695. [2018-10-26 21:35:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4695 states. [2018-10-26 21:35:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 5000 transitions. [2018-10-26 21:35:59,891 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 5000 transitions. Word has length 542 [2018-10-26 21:35:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:35:59,892 INFO L481 AbstractCegarLoop]: Abstraction has 4695 states and 5000 transitions. [2018-10-26 21:35:59,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:35:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 5000 transitions. [2018-10-26 21:35:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2018-10-26 21:35:59,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:35:59,913 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:35:59,913 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:35:59,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:35:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash -544950873, now seen corresponding path program 1 times [2018-10-26 21:35:59,914 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:35:59,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:35:59,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:59,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:35:59,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:35:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 907 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-26 21:36:00,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:36:00,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:36:00,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:36:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:36:00,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:36:00,450 INFO L87 Difference]: Start difference. First operand 4695 states and 5000 transitions. Second operand 3 states. [2018-10-26 21:36:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:36:02,351 INFO L93 Difference]: Finished difference Result 11536 states and 12374 transitions. [2018-10-26 21:36:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:36:02,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 656 [2018-10-26 21:36:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:36:02,372 INFO L225 Difference]: With dead ends: 11536 [2018-10-26 21:36:02,372 INFO L226 Difference]: Without dead ends: 6843 [2018-10-26 21:36:02,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:36:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6843 states. [2018-10-26 21:36:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6843 to 6843. [2018-10-26 21:36:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6843 states. [2018-10-26 21:36:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6843 states to 6843 states and 7326 transitions. [2018-10-26 21:36:02,479 INFO L78 Accepts]: Start accepts. Automaton has 6843 states and 7326 transitions. Word has length 656 [2018-10-26 21:36:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:36:02,480 INFO L481 AbstractCegarLoop]: Abstraction has 6843 states and 7326 transitions. [2018-10-26 21:36:02,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:36:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6843 states and 7326 transitions. [2018-10-26 21:36:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-26 21:36:02,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:36:02,491 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:36:02,491 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:36:02,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:36:02,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1841303999, now seen corresponding path program 1 times [2018-10-26 21:36:02,492 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:36:02,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:36:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:02,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:36:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 1155 proven. 0 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2018-10-26 21:36:02,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:36:02,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:36:02,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:36:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:36:02,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:36:02,987 INFO L87 Difference]: Start difference. First operand 6843 states and 7326 transitions. Second operand 3 states. [2018-10-26 21:36:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:36:04,298 INFO L93 Difference]: Finished difference Result 15295 states and 16401 transitions. [2018-10-26 21:36:04,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:36:04,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 729 [2018-10-26 21:36:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:36:04,324 INFO L225 Difference]: With dead ends: 15295 [2018-10-26 21:36:04,324 INFO L226 Difference]: Without dead ends: 8454 [2018-10-26 21:36:04,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:36:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2018-10-26 21:36:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 8454. [2018-10-26 21:36:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8454 states. [2018-10-26 21:36:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8454 states to 8454 states and 9025 transitions. [2018-10-26 21:36:04,452 INFO L78 Accepts]: Start accepts. Automaton has 8454 states and 9025 transitions. Word has length 729 [2018-10-26 21:36:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:36:04,452 INFO L481 AbstractCegarLoop]: Abstraction has 8454 states and 9025 transitions. [2018-10-26 21:36:04,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:36:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 8454 states and 9025 transitions. [2018-10-26 21:36:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2018-10-26 21:36:04,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:36:04,466 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:36:04,466 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:36:04,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:36:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash -233229417, now seen corresponding path program 1 times [2018-10-26 21:36:04,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:36:04,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:36:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:04,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:36:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:05,006 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 21:36:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1535 proven. 0 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2018-10-26 21:36:05,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:36:05,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:36:05,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:36:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:36:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:36:05,626 INFO L87 Difference]: Start difference. First operand 8454 states and 9025 transitions. Second operand 4 states. [2018-10-26 21:36:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:36:06,967 INFO L93 Difference]: Finished difference Result 18696 states and 20064 transitions. [2018-10-26 21:36:06,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:36:06,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 885 [2018-10-26 21:36:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:36:06,988 INFO L225 Difference]: With dead ends: 18696 [2018-10-26 21:36:06,988 INFO L226 Difference]: Without dead ends: 10244 [2018-10-26 21:36:06,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:36:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10244 states. [2018-10-26 21:36:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10244 to 10244. [2018-10-26 21:36:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2018-10-26 21:36:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 10827 transitions. [2018-10-26 21:36:07,121 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 10827 transitions. Word has length 885 [2018-10-26 21:36:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:36:07,122 INFO L481 AbstractCegarLoop]: Abstraction has 10244 states and 10827 transitions. [2018-10-26 21:36:07,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:36:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 10827 transitions. [2018-10-26 21:36:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2018-10-26 21:36:07,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:36:07,140 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:36:07,140 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:36:07,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:36:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1258152596, now seen corresponding path program 1 times [2018-10-26 21:36:07,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:36:07,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:36:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:07,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:36:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:07,707 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 21:36:07,935 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 21:36:08,113 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 21:36:08,391 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 21:36:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2945 backedges. 2001 proven. 201 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-10-26 21:36:09,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:36:09,763 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:36:09,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:36:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:10,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:36:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2945 backedges. 1908 proven. 93 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2018-10-26 21:36:11,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:36:11,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2018-10-26 21:36:11,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:36:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:36:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:36:11,761 INFO L87 Difference]: Start difference. First operand 10244 states and 10827 transitions. Second operand 9 states. [2018-10-26 21:36:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:36:14,514 INFO L93 Difference]: Finished difference Result 21315 states and 22513 transitions. [2018-10-26 21:36:14,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:36:14,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 979 [2018-10-26 21:36:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:36:14,534 INFO L225 Difference]: With dead ends: 21315 [2018-10-26 21:36:14,534 INFO L226 Difference]: Without dead ends: 11073 [2018-10-26 21:36:14,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 989 GetRequests, 978 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:36:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11073 states. [2018-10-26 21:36:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11073 to 10778. [2018-10-26 21:36:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10778 states. [2018-10-26 21:36:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10778 states to 10778 states and 11333 transitions. [2018-10-26 21:36:14,683 INFO L78 Accepts]: Start accepts. Automaton has 10778 states and 11333 transitions. Word has length 979 [2018-10-26 21:36:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:36:14,683 INFO L481 AbstractCegarLoop]: Abstraction has 10778 states and 11333 transitions. [2018-10-26 21:36:14,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:36:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 10778 states and 11333 transitions. [2018-10-26 21:36:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2018-10-26 21:36:14,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:36:14,701 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:36:14,701 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:36:14,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:36:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash 844250533, now seen corresponding path program 1 times [2018-10-26 21:36:14,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:36:14,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:36:14,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:14,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:36:14,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3596 backedges. 1099 proven. 0 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2018-10-26 21:36:15,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:36:15,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:36:15,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:36:15,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:36:15,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:36:15,950 INFO L87 Difference]: Start difference. First operand 10778 states and 11333 transitions. Second operand 4 states. [2018-10-26 21:36:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:36:17,310 INFO L93 Difference]: Finished difference Result 21554 states and 22664 transitions. [2018-10-26 21:36:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:36:17,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1057 [2018-10-26 21:36:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:36:17,328 INFO L225 Difference]: With dead ends: 21554 [2018-10-26 21:36:17,328 INFO L226 Difference]: Without dead ends: 10778 [2018-10-26 21:36:17,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:36:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10778 states. [2018-10-26 21:36:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10778 to 10778. [2018-10-26 21:36:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10778 states. [2018-10-26 21:36:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10778 states to 10778 states and 11184 transitions. [2018-10-26 21:36:17,482 INFO L78 Accepts]: Start accepts. Automaton has 10778 states and 11184 transitions. Word has length 1057 [2018-10-26 21:36:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:36:17,483 INFO L481 AbstractCegarLoop]: Abstraction has 10778 states and 11184 transitions. [2018-10-26 21:36:17,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:36:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 10778 states and 11184 transitions. [2018-10-26 21:36:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1106 [2018-10-26 21:36:17,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:36:17,504 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:36:17,504 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:36:17,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:36:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash 659954717, now seen corresponding path program 1 times [2018-10-26 21:36:17,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:36:17,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:36:17,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:17,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:36:17,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:18,458 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-26 21:36:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 2480 proven. 0 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2018-10-26 21:36:18,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:36:18,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:36:18,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:36:18,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:36:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:36:18,935 INFO L87 Difference]: Start difference. First operand 10778 states and 11184 transitions. Second operand 5 states. [2018-10-26 21:36:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:36:20,996 INFO L93 Difference]: Finished difference Result 22810 states and 23674 transitions. [2018-10-26 21:36:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:36:20,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1105 [2018-10-26 21:36:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:36:21,011 INFO L225 Difference]: With dead ends: 22810 [2018-10-26 21:36:21,012 INFO L226 Difference]: Without dead ends: 12034 [2018-10-26 21:36:21,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:36:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12034 states. [2018-10-26 21:36:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12034 to 11137. [2018-10-26 21:36:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11137 states. [2018-10-26 21:36:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11137 states to 11137 states and 11547 transitions. [2018-10-26 21:36:21,159 INFO L78 Accepts]: Start accepts. Automaton has 11137 states and 11547 transitions. Word has length 1105 [2018-10-26 21:36:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:36:21,160 INFO L481 AbstractCegarLoop]: Abstraction has 11137 states and 11547 transitions. [2018-10-26 21:36:21,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:36:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 11137 states and 11547 transitions. [2018-10-26 21:36:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2018-10-26 21:36:21,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:36:21,192 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:36:21,193 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:36:21,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:36:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1518888912, now seen corresponding path program 1 times [2018-10-26 21:36:21,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:36:21,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:36:21,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:21,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:36:21,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 3516 proven. 441 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-10-26 21:36:23,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:36:23,842 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:36:23,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:36:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:24,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:36:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 3586 proven. 371 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-10-26 21:36:26,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:36:26,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-26 21:36:26,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:36:26,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:36:26,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:36:26,360 INFO L87 Difference]: Start difference. First operand 11137 states and 11547 transitions. Second operand 10 states. [2018-10-26 21:36:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:36:34,250 INFO L93 Difference]: Finished difference Result 24248 states and 25159 transitions. [2018-10-26 21:36:34,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:36:34,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1646 [2018-10-26 21:36:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:36:34,269 INFO L225 Difference]: With dead ends: 24248 [2018-10-26 21:36:34,269 INFO L226 Difference]: Without dead ends: 13113 [2018-10-26 21:36:34,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1662 GetRequests, 1648 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:36:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13113 states. [2018-10-26 21:36:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13113 to 12575. [2018-10-26 21:36:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12575 states. [2018-10-26 21:36:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12575 states to 12575 states and 12968 transitions. [2018-10-26 21:36:34,410 INFO L78 Accepts]: Start accepts. Automaton has 12575 states and 12968 transitions. Word has length 1646 [2018-10-26 21:36:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:36:34,411 INFO L481 AbstractCegarLoop]: Abstraction has 12575 states and 12968 transitions. [2018-10-26 21:36:34,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:36:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 12575 states and 12968 transitions. [2018-10-26 21:36:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1821 [2018-10-26 21:36:34,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:36:34,443 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:36:34,443 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:36:34,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:36:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1871214169, now seen corresponding path program 1 times [2018-10-26 21:36:34,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:36:34,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:36:34,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:34,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:36:34,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:36:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:36:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10200 backedges. 4382 proven. 0 refuted. 0 times theorem prover too weak. 5818 trivial. 0 not checked. [2018-10-26 21:36:36,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:36:36,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:36:36,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:36:36,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:36:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:36:36,846 INFO L87 Difference]: Start difference. First operand 12575 states and 12968 transitions. Second operand 4 states. [2018-10-26 21:36:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:36:37,927 INFO L93 Difference]: Finished difference Result 23710 states and 24414 transitions. [2018-10-26 21:36:37,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:36:37,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1820 [2018-10-26 21:36:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:36:37,928 INFO L225 Difference]: With dead ends: 23710 [2018-10-26 21:36:37,928 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:36:37,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:36:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:36:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:36:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:36:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:36:37,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1820 [2018-10-26 21:36:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:36:37,937 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:36:37,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:36:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:36:37,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:36:37,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:36:37,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:37,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:37,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:37,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:37,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,199 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 156 [2018-10-26 21:36:38,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:36:38,436 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 158 [2018-10-26 21:36:41,828 WARN L179 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2018-10-26 21:36:43,490 WARN L179 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 131 DAG size of output: 78 [2018-10-26 21:36:43,494 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-10-26 21:36:43,494 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-10-26 21:36:43,494 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,494 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,494 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,494 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-10-26 21:36:43,494 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,495 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-10-26 21:36:43,496 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-10-26 21:36:43,496 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-26 21:36:43,496 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-26 21:36:43,496 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-26 21:36:43,496 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-10-26 21:36:43,496 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-10-26 21:36:43,496 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-10-26 21:36:43,496 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,496 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,497 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,497 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-10-26 21:36:43,497 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-26 21:36:43,497 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-26 21:36:43,497 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-26 21:36:43,497 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-10-26 21:36:43,497 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-10-26 21:36:43,497 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-10-26 21:36:43,497 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-10-26 21:36:43,498 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-10-26 21:36:43,498 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,498 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,498 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,498 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-10-26 21:36:43,498 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-26 21:36:43,498 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-26 21:36:43,498 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-26 21:36:43,499 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-10-26 21:36:43,499 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-10-26 21:36:43,499 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-10-26 21:36:43,499 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,499 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,499 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,499 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-10-26 21:36:43,499 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-26 21:36:43,500 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-26 21:36:43,500 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-26 21:36:43,500 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-10-26 21:36:43,500 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-10-26 21:36:43,500 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-10-26 21:36:43,500 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-10-26 21:36:43,500 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-10-26 21:36:43,500 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,500 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,501 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,501 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-10-26 21:36:43,501 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-26 21:36:43,501 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-26 21:36:43,501 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-26 21:36:43,501 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-10-26 21:36:43,501 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-10-26 21:36:43,501 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-10-26 21:36:43,501 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-10-26 21:36:43,502 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,502 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,502 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,502 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-26 21:36:43,502 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-26 21:36:43,502 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-26 21:36:43,502 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-10-26 21:36:43,502 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-10-26 21:36:43,502 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-10-26 21:36:43,503 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-10-26 21:36:43,503 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-10-26 21:36:43,503 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,503 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,503 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,503 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-10-26 21:36:43,503 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-10-26 21:36:43,503 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:36:43,504 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-26 21:36:43,504 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-26 21:36:43,504 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-26 21:36:43,504 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-10-26 21:36:43,504 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-10-26 21:36:43,504 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-10-26 21:36:43,504 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,504 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,504 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,505 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-26 21:36:43,505 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-26 21:36:43,505 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-26 21:36:43,505 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-10-26 21:36:43,505 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-10-26 21:36:43,505 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-10-26 21:36:43,505 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-10-26 21:36:43,505 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-10-26 21:36:43,505 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-26 21:36:43,506 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-10-26 21:36:43,507 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-10-26 21:36:43,507 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,507 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,507 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,507 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-10-26 21:36:43,507 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-26 21:36:43,507 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-26 21:36:43,507 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-26 21:36:43,508 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-26 21:36:43,509 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-26 21:36:43,509 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-10-26 21:36:43,509 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-10-26 21:36:43,509 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-10-26 21:36:43,509 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-10-26 21:36:43,509 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,509 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,509 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-10-26 21:36:43,509 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-10-26 21:36:43,510 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-26 21:36:43,511 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-26 21:36:43,511 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-10-26 21:36:43,511 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-10-26 21:36:43,511 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-10-26 21:36:43,511 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,511 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,512 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse21 (+ ~a12~0 43))) (let ((.cse8 (= ~a21~0 7)) (.cse9 (= ~a15~0 8)) (.cse4 (= ~a24~0 1)) (.cse7 (<= .cse21 0))) (let ((.cse11 (<= ~a24~0 1)) (.cse16 (and .cse4 .cse7)) (.cse10 (<= ~a12~0 11)) (.cse13 (< 0 .cse21)) (.cse20 (= ~a15~0 7)) (.cse3 (= ~a21~0 9)) (.cse5 (<= ~a15~0 8)) (.cse6 (<= ~a21~0 6)) (.cse14 (= ~a21~0 10)) (.cse2 (< 80 ~a12~0)) (.cse0 (not (= 7 ~a15~0))) (.cse12 (= ~a21~0 8)) (.cse18 (<= ~a12~0 72)) (.cse1 (not .cse9)) (.cse19 (<= 19 ~a12~0)) (.cse15 (<= ~a12~0 80)) (.cse17 (not .cse8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 (not (= ~a15~0 5)) .cse4 .cse8 .cse5) (and .cse0 .cse1 .cse8 .cse2) (and .cse9 .cse4 .cse10) (and .cse0 .cse1 .cse11 .cse5 .cse6) (and .cse0 .cse12 .cse1 .cse10 .cse13) (and .cse4 .cse14 .cse5) (and .cse15 .cse0 (or (< 11 ~a12~0) .cse16) .cse1 .cse11 .cse5 .cse17) (and .cse0 .cse7 .cse1 .cse5 .cse6) (and .cse0 .cse18 .cse1 .cse11 .cse5 .cse19) (and .cse16 .cse14) (and .cse0 .cse12 (<= (+ ~a12~0 526767) 0) .cse1) (and .cse20 .cse4 .cse12) (and .cse0 .cse14 .cse1 .cse10 .cse13) (and .cse4 .cse18 .cse5 .cse17 .cse19) (and .cse20 .cse4 .cse2 .cse3) (and (<= ~a12~0 73282) .cse4 .cse12 .cse5) (and (<= ~a12~0 95434) (<= 95381 ~a12~0) .cse0 .cse1 .cse6) (and .cse0 .cse14 .cse1 .cse2) (and .cse0 .cse12 .cse1 .cse2) (and .cse0 .cse12 .cse18 .cse1 .cse19) (= ~a15~0 6) (and .cse15 .cse9 .cse4 .cse17))))) [2018-10-26 21:36:43,512 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-10-26 21:36:43,512 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-10-26 21:36:43,512 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-26 21:36:43,512 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-26 21:36:43,512 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-10-26 21:36:43,512 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-10-26 21:36:43,512 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-10-26 21:36:43,512 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-10-26 21:36:43,513 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,514 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse21 (+ ~a12~0 43))) (let ((.cse8 (= ~a21~0 7)) (.cse9 (= ~a15~0 8)) (.cse4 (= ~a24~0 1)) (.cse7 (<= .cse21 0))) (let ((.cse11 (<= ~a24~0 1)) (.cse16 (and .cse4 .cse7)) (.cse10 (<= ~a12~0 11)) (.cse13 (< 0 .cse21)) (.cse20 (= ~a15~0 7)) (.cse3 (= ~a21~0 9)) (.cse5 (<= ~a15~0 8)) (.cse6 (<= ~a21~0 6)) (.cse14 (= ~a21~0 10)) (.cse2 (< 80 ~a12~0)) (.cse0 (not (= 7 ~a15~0))) (.cse12 (= ~a21~0 8)) (.cse18 (<= ~a12~0 72)) (.cse1 (not .cse9)) (.cse19 (<= 19 ~a12~0)) (.cse15 (<= ~a12~0 80)) (.cse17 (not .cse8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 (not (= ~a15~0 5)) .cse4 .cse8 .cse5) (and .cse0 .cse1 .cse8 .cse2) (and .cse9 .cse4 .cse10) (and .cse0 .cse1 .cse11 .cse5 .cse6) (and .cse0 .cse12 .cse1 .cse10 .cse13) (and .cse4 .cse14 .cse5) (and .cse15 .cse0 (or (< 11 ~a12~0) .cse16) .cse1 .cse11 .cse5 .cse17) (and .cse0 .cse7 .cse1 .cse5 .cse6) (and .cse0 .cse18 .cse1 .cse11 .cse5 .cse19) (and .cse16 .cse14) (and .cse0 .cse12 (<= (+ ~a12~0 526767) 0) .cse1) (and .cse20 .cse4 .cse12) (and .cse0 .cse14 .cse1 .cse10 .cse13) (and .cse4 .cse18 .cse5 .cse17 .cse19) (and .cse20 .cse4 .cse2 .cse3) (and (<= ~a12~0 73282) .cse4 .cse12 .cse5) (and (<= ~a12~0 95434) (<= 95381 ~a12~0) .cse0 .cse1 .cse6) (and .cse0 .cse14 .cse1 .cse2) (and .cse0 .cse12 .cse1 .cse2) (and .cse0 .cse12 .cse18 .cse1 .cse19) (= ~a15~0 6) (and .cse15 .cse9 .cse4 .cse17))))) [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-26 21:36:43,515 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-10-26 21:36:43,516 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-10-26 21:36:43,516 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-10-26 21:36:43,516 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-10-26 21:36:43,516 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,516 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,516 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,516 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-10-26 21:36:43,516 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-26 21:36:43,516 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,517 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,518 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-10-26 21:36:43,519 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,520 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,520 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:36:43,520 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-10-26 21:36:43,520 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-26 21:36:43,520 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-26 21:36:43,520 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-26 21:36:43,520 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-10-26 21:36:43,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:36:43 BoogieIcfgContainer [2018-10-26 21:36:43,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:36:43,549 INFO L168 Benchmark]: Toolchain (without parser) took 81328.30 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-26 21:36:43,550 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:36:43,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.48 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-26 21:36:43,551 INFO L168 Benchmark]: Boogie Procedure Inliner took 266.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:36:43,552 INFO L168 Benchmark]: Boogie Preprocessor took 127.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-26 21:36:43,553 INFO L168 Benchmark]: RCFGBuilder took 3811.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 135.7 MB). Peak memory consumption was 135.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:36:43,554 INFO L168 Benchmark]: TraceAbstraction took 76323.30 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -681.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-26 21:36:43,559 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.48 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 266.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3811.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 135.7 MB). Peak memory consumption was 135.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76323.30 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -681.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(7 == a15) && !(a15 == 8)) && 80 < a12) && a21 == 9) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) || ((((a12 + 43 <= 0 && !(a15 == 5)) && a24 == 1) && a21 == 7) && a15 <= 8)) || (((!(7 == a15) && !(a15 == 8)) && a21 == 7) && 80 < a12)) || ((a15 == 8 && a24 == 1) && a12 <= 11)) || ((((!(7 == a15) && !(a15 == 8)) && a24 <= 1) && a15 <= 8) && a21 <= 6)) || ((((!(7 == a15) && a21 == 8) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || ((a24 == 1 && a21 == 10) && a15 <= 8)) || ((((((a12 <= 80 && !(7 == a15)) && (11 < a12 || (a24 == 1 && a12 + 43 <= 0))) && !(a15 == 8)) && a24 <= 1) && a15 <= 8) && !(a21 == 7))) || ((((!(7 == a15) && a12 + 43 <= 0) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || (((((!(7 == a15) && a12 <= 72) && !(a15 == 8)) && a24 <= 1) && a15 <= 8) && 19 <= a12)) || ((a24 == 1 && a12 + 43 <= 0) && a21 == 10)) || (((!(7 == a15) && a21 == 8) && a12 + 526767 <= 0) && !(a15 == 8))) || ((a15 == 7 && a24 == 1) && a21 == 8)) || ((((!(7 == a15) && a21 == 10) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 72) && a15 <= 8) && !(a21 == 7)) && 19 <= a12)) || (((a15 == 7 && a24 == 1) && 80 < a12) && a21 == 9)) || (((a12 <= 73282 && a24 == 1) && a21 == 8) && a15 <= 8)) || ((((a12 <= 95434 && 95381 <= a12) && !(7 == a15)) && !(a15 == 8)) && a21 <= 6)) || (((!(7 == a15) && a21 == 10) && !(a15 == 8)) && 80 < a12)) || (((!(7 == a15) && a21 == 8) && !(a15 == 8)) && 80 < a12)) || ((((!(7 == a15) && a21 == 8) && a12 <= 72) && !(a15 == 8)) && 19 <= a12)) || a15 == 6) || (((a12 <= 80 && a15 == 8) && a24 == 1) && !(a21 == 7)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(7 == a15) && !(a15 == 8)) && 80 < a12) && a21 == 9) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) || ((((a12 + 43 <= 0 && !(a15 == 5)) && a24 == 1) && a21 == 7) && a15 <= 8)) || (((!(7 == a15) && !(a15 == 8)) && a21 == 7) && 80 < a12)) || ((a15 == 8 && a24 == 1) && a12 <= 11)) || ((((!(7 == a15) && !(a15 == 8)) && a24 <= 1) && a15 <= 8) && a21 <= 6)) || ((((!(7 == a15) && a21 == 8) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || ((a24 == 1 && a21 == 10) && a15 <= 8)) || ((((((a12 <= 80 && !(7 == a15)) && (11 < a12 || (a24 == 1 && a12 + 43 <= 0))) && !(a15 == 8)) && a24 <= 1) && a15 <= 8) && !(a21 == 7))) || ((((!(7 == a15) && a12 + 43 <= 0) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || (((((!(7 == a15) && a12 <= 72) && !(a15 == 8)) && a24 <= 1) && a15 <= 8) && 19 <= a12)) || ((a24 == 1 && a12 + 43 <= 0) && a21 == 10)) || (((!(7 == a15) && a21 == 8) && a12 + 526767 <= 0) && !(a15 == 8))) || ((a15 == 7 && a24 == 1) && a21 == 8)) || ((((!(7 == a15) && a21 == 10) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 72) && a15 <= 8) && !(a21 == 7)) && 19 <= a12)) || (((a15 == 7 && a24 == 1) && 80 < a12) && a21 == 9)) || (((a12 <= 73282 && a24 == 1) && a21 == 8) && a15 <= 8)) || ((((a12 <= 95434 && 95381 <= a12) && !(7 == a15)) && !(a15 == 8)) && a21 <= 6)) || (((!(7 == a15) && a21 == 10) && !(a15 == 8)) && 80 < a12)) || (((!(7 == a15) && a21 == 8) && !(a15 == 8)) && 80 < a12)) || ((((!(7 == a15) && a21 == 8) && a12 <= 72) && !(a15 == 8)) && 19 <= a12)) || a15 == 6) || (((a12 <= 80 && a15 == 8) && a24 == 1) && !(a21 == 7)) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 76.2s OverallTime, 16 OverallIterations, 15 TraceHistogramMax, 45.8s AutomataDifference, 0.0s DeadEndRemovalTime, 5.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2424 SDtfs, 8853 SDslu, 1793 SDs, 0 SdLazy, 27461 SolverSat, 2852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3749 GetRequests, 3665 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12575occurred in iteration=15, 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: 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 2706 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 146 NumberOfFragments, 761 HoareAnnotationTreeSize, 3 FomulaSimplifications, 27731 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3034 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 14805 NumberOfCodeBlocks, 14805 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 14784 ConstructedInterpolants, 0 QuantifiedInterpolants, 39192256 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4514 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 48553/50112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...