java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:49:13,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:49:13,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:49:13,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:49:13,370 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:49:13,371 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:49:13,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:49:13,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:49:13,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:49:13,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:49:13,377 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:49:13,378 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:49:13,379 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:49:13,379 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:49:13,381 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:49:13,381 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:49:13,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:49:13,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:49:13,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:49:13,388 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:49:13,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:49:13,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:49:13,393 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:49:13,393 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:49:13,393 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:49:13,394 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:49:13,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:49:13,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:49:13,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:49:13,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:49:13,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:49:13,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:49:13,400 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:49:13,400 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:49:13,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:49:13,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:49:13,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:49:13,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:49:13,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:49:13,419 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:49:13,419 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:49:13,419 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:49:13,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:49:13,420 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:49:13,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:49:13,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:49:13,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:49:13,421 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:49:13,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:49:13,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:49:13,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:49:13,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:49:13,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:49:13,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:49:13,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:49:13,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:49:13,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:49:13,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:49:13,423 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:49:13,423 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:49:13,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:49:13,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:49:13,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:49:13,424 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:49:13,424 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:49:13,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:49:13,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:49:13,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:49:13,499 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:49:13,499 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:49:13,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-10-24 14:49:13,568 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/247899cbe/5d5d1fcbc0364008ada8663a3ea866ba/FLAGaa00fb7de [2018-10-24 14:49:14,141 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:49:14,143 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-10-24 14:49:14,157 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/247899cbe/5d5d1fcbc0364008ada8663a3ea866ba/FLAGaa00fb7de [2018-10-24 14:49:14,181 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/247899cbe/5d5d1fcbc0364008ada8663a3ea866ba [2018-10-24 14:49:14,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:49:14,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:49:14,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:49:14,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:49:14,206 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:49:14,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:14,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d01221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14, skipping insertion in model container [2018-10-24 14:49:14,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:14,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:49:14,280 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:49:14,732 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:49:14,736 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:49:14,868 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:49:14,896 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:49:14,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14 WrapperNode [2018-10-24 14:49:14,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:49:14,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:49:14,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:49:14,898 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:49:14,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:14,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:15,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:49:15,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:49:15,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:49:15,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:49:15,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:15,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:15,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:15,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:15,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:15,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:15,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... [2018-10-24 14:49:15,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:49:15,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:49:15,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:49:15,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:49:15,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:49:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:49:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:49:15,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:49:18,665 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:49:18,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:18 BoogieIcfgContainer [2018-10-24 14:49:18,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:49:18,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:49:18,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:49:18,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:49:18,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:49:14" (1/3) ... [2018-10-24 14:49:18,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7705a58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:18, skipping insertion in model container [2018-10-24 14:49:18,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:14" (2/3) ... [2018-10-24 14:49:18,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7705a58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:18, skipping insertion in model container [2018-10-24 14:49:18,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:18" (3/3) ... [2018-10-24 14:49:18,676 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label05_true-unreach-call_false-termination.c [2018-10-24 14:49:18,686 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:49:18,699 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:49:18,717 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:49:18,755 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:49:18,755 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:49:18,755 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:49:18,756 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:49:18,756 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:49:18,756 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:49:18,756 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:49:18,757 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:49:18,757 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:49:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:49:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-24 14:49:18,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:18,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:18,797 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:18,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash 995514023, now seen corresponding path program 1 times [2018-10-24 14:49:18,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:18,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:18,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:19,383 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:49:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:49:19,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:19,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:49:19,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:19,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:19,524 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-10-24 14:49:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:21,792 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-10-24 14:49:21,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:21,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-10-24 14:49:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:21,817 INFO L225 Difference]: With dead ends: 666 [2018-10-24 14:49:21,818 INFO L226 Difference]: Without dead ends: 460 [2018-10-24 14:49:21,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 14:49:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-24 14:49:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-10-24 14:49:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-24 14:49:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 732 transitions. [2018-10-24 14:49:21,915 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 732 transitions. Word has length 95 [2018-10-24 14:49:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:21,916 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 732 transitions. [2018-10-24 14:49:21,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 732 transitions. [2018-10-24 14:49:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-24 14:49:21,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:21,923 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:21,923 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:21,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:21,924 INFO L82 PathProgramCache]: Analyzing trace with hash 227515764, now seen corresponding path program 1 times [2018-10-24 14:49:21,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:21,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:21,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:21,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:21,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:49:22,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:22,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:49:22,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:22,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:22,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:22,069 INFO L87 Difference]: Start difference. First operand 460 states and 732 transitions. Second operand 4 states. [2018-10-24 14:49:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:23,527 INFO L93 Difference]: Finished difference Result 1710 states and 2800 transitions. [2018-10-24 14:49:23,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:23,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-24 14:49:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:23,542 INFO L225 Difference]: With dead ends: 1710 [2018-10-24 14:49:23,544 INFO L226 Difference]: Without dead ends: 1252 [2018-10-24 14:49:23,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-10-24 14:49:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-10-24 14:49:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-24 14:49:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1863 transitions. [2018-10-24 14:49:23,618 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1863 transitions. Word has length 102 [2018-10-24 14:49:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:23,619 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1863 transitions. [2018-10-24 14:49:23,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1863 transitions. [2018-10-24 14:49:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-24 14:49:23,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:23,624 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:23,624 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:23,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash -741187437, now seen corresponding path program 1 times [2018-10-24 14:49:23,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:23,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:49:23,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:23,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:49:23,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:23,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:23,842 INFO L87 Difference]: Start difference. First operand 1252 states and 1863 transitions. Second operand 3 states. [2018-10-24 14:49:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:27,199 INFO L93 Difference]: Finished difference Result 3418 states and 5040 transitions. [2018-10-24 14:49:27,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:27,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-10-24 14:49:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:27,210 INFO L225 Difference]: With dead ends: 3418 [2018-10-24 14:49:27,211 INFO L226 Difference]: Without dead ends: 2168 [2018-10-24 14:49:27,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-24 14:49:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2018-10-24 14:49:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2018-10-24 14:49:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2909 transitions. [2018-10-24 14:49:27,258 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2909 transitions. Word has length 103 [2018-10-24 14:49:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:27,258 INFO L481 AbstractCegarLoop]: Abstraction has 2168 states and 2909 transitions. [2018-10-24 14:49:27,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2909 transitions. [2018-10-24 14:49:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-24 14:49:27,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:27,264 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:27,264 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:27,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1481918287, now seen corresponding path program 1 times [2018-10-24 14:49:27,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:27,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:27,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:49:27,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:27,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:49:27,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:27,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:27,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:27,396 INFO L87 Difference]: Start difference. First operand 2168 states and 2909 transitions. Second operand 3 states. [2018-10-24 14:49:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:28,333 INFO L93 Difference]: Finished difference Result 4862 states and 6615 transitions. [2018-10-24 14:49:28,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:28,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-10-24 14:49:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:28,347 INFO L225 Difference]: With dead ends: 4862 [2018-10-24 14:49:28,347 INFO L226 Difference]: Without dead ends: 2696 [2018-10-24 14:49:28,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2018-10-24 14:49:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2696. [2018-10-24 14:49:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-10-24 14:49:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3630 transitions. [2018-10-24 14:49:28,401 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3630 transitions. Word has length 131 [2018-10-24 14:49:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:28,402 INFO L481 AbstractCegarLoop]: Abstraction has 2696 states and 3630 transitions. [2018-10-24 14:49:28,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3630 transitions. [2018-10-24 14:49:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-24 14:49:28,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:28,408 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:49:28,408 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:28,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:28,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1704669628, now seen corresponding path program 1 times [2018-10-24 14:49:28,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:28,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:28,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:28,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:28,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 14:49:28,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:28,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:49:28,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:28,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:28,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:28,531 INFO L87 Difference]: Start difference. First operand 2696 states and 3630 transitions. Second operand 3 states. [2018-10-24 14:49:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:29,427 INFO L93 Difference]: Finished difference Result 7634 states and 10229 transitions. [2018-10-24 14:49:29,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:29,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-10-24 14:49:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:29,448 INFO L225 Difference]: With dead ends: 7634 [2018-10-24 14:49:29,448 INFO L226 Difference]: Without dead ends: 4940 [2018-10-24 14:49:29,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2018-10-24 14:49:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4940. [2018-10-24 14:49:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-10-24 14:49:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6302 transitions. [2018-10-24 14:49:29,542 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6302 transitions. Word has length 155 [2018-10-24 14:49:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:29,542 INFO L481 AbstractCegarLoop]: Abstraction has 4940 states and 6302 transitions. [2018-10-24 14:49:29,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6302 transitions. [2018-10-24 14:49:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-24 14:49:29,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:29,551 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:29,551 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:29,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2127113900, now seen corresponding path program 1 times [2018-10-24 14:49:29,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:29,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:29,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-24 14:49:29,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:29,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:49:29,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:29,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:29,699 INFO L87 Difference]: Start difference. First operand 4940 states and 6302 transitions. Second operand 3 states. [2018-10-24 14:49:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:30,897 INFO L93 Difference]: Finished difference Result 9878 states and 12602 transitions. [2018-10-24 14:49:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:30,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2018-10-24 14:49:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:30,913 INFO L225 Difference]: With dead ends: 9878 [2018-10-24 14:49:30,913 INFO L226 Difference]: Without dead ends: 4940 [2018-10-24 14:49:30,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2018-10-24 14:49:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4940. [2018-10-24 14:49:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-10-24 14:49:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6230 transitions. [2018-10-24 14:49:30,994 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6230 transitions. Word has length 161 [2018-10-24 14:49:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:30,995 INFO L481 AbstractCegarLoop]: Abstraction has 4940 states and 6230 transitions. [2018-10-24 14:49:30,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6230 transitions. [2018-10-24 14:49:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-24 14:49:31,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:31,004 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, 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] [2018-10-24 14:49:31,004 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:31,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:31,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1684111721, now seen corresponding path program 1 times [2018-10-24 14:49:31,005 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:31,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:31,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:31,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:31,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 14:49:31,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:31,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:49:31,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:31,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:31,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:31,166 INFO L87 Difference]: Start difference. First operand 4940 states and 6230 transitions. Second operand 3 states. [2018-10-24 14:49:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:32,202 INFO L93 Difference]: Finished difference Result 9878 states and 12458 transitions. [2018-10-24 14:49:32,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:32,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-10-24 14:49:32,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:32,224 INFO L225 Difference]: With dead ends: 9878 [2018-10-24 14:49:32,224 INFO L226 Difference]: Without dead ends: 4940 [2018-10-24 14:49:32,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2018-10-24 14:49:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4940. [2018-10-24 14:49:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-10-24 14:49:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6158 transitions. [2018-10-24 14:49:32,318 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6158 transitions. Word has length 180 [2018-10-24 14:49:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:32,318 INFO L481 AbstractCegarLoop]: Abstraction has 4940 states and 6158 transitions. [2018-10-24 14:49:32,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6158 transitions. [2018-10-24 14:49:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-24 14:49:32,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:32,328 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 14:49:32,328 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:32,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:32,329 INFO L82 PathProgramCache]: Analyzing trace with hash 6364353, now seen corresponding path program 1 times [2018-10-24 14:49:32,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:32,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:32,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:32,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:32,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:32,943 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-24 14:49:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 14:49:33,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:33,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:49:33,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:49:33,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:49:33,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:49:33,280 INFO L87 Difference]: Start difference. First operand 4940 states and 6158 transitions. Second operand 7 states. [2018-10-24 14:49:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:36,491 INFO L93 Difference]: Finished difference Result 9954 states and 12390 transitions. [2018-10-24 14:49:36,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:49:36,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2018-10-24 14:49:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:36,519 INFO L225 Difference]: With dead ends: 9954 [2018-10-24 14:49:36,526 INFO L226 Difference]: Without dead ends: 5016 [2018-10-24 14:49:36,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:49:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5016 states. [2018-10-24 14:49:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5016 to 4940. [2018-10-24 14:49:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-10-24 14:49:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6134 transitions. [2018-10-24 14:49:36,609 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6134 transitions. Word has length 185 [2018-10-24 14:49:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:36,609 INFO L481 AbstractCegarLoop]: Abstraction has 4940 states and 6134 transitions. [2018-10-24 14:49:36,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:49:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6134 transitions. [2018-10-24 14:49:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 14:49:36,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:36,618 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 14:49:36,618 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:36,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:36,619 INFO L82 PathProgramCache]: Analyzing trace with hash 905871299, now seen corresponding path program 1 times [2018-10-24 14:49:36,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:36,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:36,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-10-24 14:49:36,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:36,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:49:36,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:36,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:36,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:36,893 INFO L87 Difference]: Start difference. First operand 4940 states and 6134 transitions. Second operand 3 states. [2018-10-24 14:49:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:38,151 INFO L93 Difference]: Finished difference Result 13306 states and 16358 transitions. [2018-10-24 14:49:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:38,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-24 14:49:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:38,169 INFO L225 Difference]: With dead ends: 13306 [2018-10-24 14:49:38,169 INFO L226 Difference]: Without dead ends: 8368 [2018-10-24 14:49:38,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8368 states. [2018-10-24 14:49:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8368 to 8236. [2018-10-24 14:49:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8236 states. [2018-10-24 14:49:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 9844 transitions. [2018-10-24 14:49:38,292 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 9844 transitions. Word has length 202 [2018-10-24 14:49:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:38,293 INFO L481 AbstractCegarLoop]: Abstraction has 8236 states and 9844 transitions. [2018-10-24 14:49:38,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 9844 transitions. [2018-10-24 14:49:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-24 14:49:38,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:38,304 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:38,304 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:38,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:38,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2017222658, now seen corresponding path program 1 times [2018-10-24 14:49:38,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:38,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-24 14:49:38,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:38,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:49:38,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:38,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:38,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:38,569 INFO L87 Difference]: Start difference. First operand 8236 states and 9844 transitions. Second operand 4 states. [2018-10-24 14:49:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:40,051 INFO L93 Difference]: Finished difference Result 17268 states and 20691 transitions. [2018-10-24 14:49:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:40,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2018-10-24 14:49:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:40,077 INFO L225 Difference]: With dead ends: 17268 [2018-10-24 14:49:40,077 INFO L226 Difference]: Without dead ends: 9166 [2018-10-24 14:49:40,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9166 states. [2018-10-24 14:49:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9166 to 9166. [2018-10-24 14:49:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9166 states. [2018-10-24 14:49:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9166 states to 9166 states and 10442 transitions. [2018-10-24 14:49:40,223 INFO L78 Accepts]: Start accepts. Automaton has 9166 states and 10442 transitions. Word has length 221 [2018-10-24 14:49:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:40,224 INFO L481 AbstractCegarLoop]: Abstraction has 9166 states and 10442 transitions. [2018-10-24 14:49:40,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 9166 states and 10442 transitions. [2018-10-24 14:49:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-24 14:49:40,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:40,236 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:40,237 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:40,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1747382289, now seen corresponding path program 1 times [2018-10-24 14:49:40,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:40,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:40,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:40,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:40,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-24 14:49:40,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:40,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:49:40,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:40,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:40,548 INFO L87 Difference]: Start difference. First operand 9166 states and 10442 transitions. Second operand 4 states. [2018-10-24 14:49:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:41,995 INFO L93 Difference]: Finished difference Result 18198 states and 20744 transitions. [2018-10-24 14:49:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:41,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2018-10-24 14:49:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:42,013 INFO L225 Difference]: With dead ends: 18198 [2018-10-24 14:49:42,013 INFO L226 Difference]: Without dead ends: 9166 [2018-10-24 14:49:42,023 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-24 14:49:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9166 states. [2018-10-24 14:49:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9166 to 9166. [2018-10-24 14:49:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9166 states. [2018-10-24 14:49:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9166 states to 9166 states and 10418 transitions. [2018-10-24 14:49:42,144 INFO L78 Accepts]: Start accepts. Automaton has 9166 states and 10418 transitions. Word has length 227 [2018-10-24 14:49:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:42,144 INFO L481 AbstractCegarLoop]: Abstraction has 9166 states and 10418 transitions. [2018-10-24 14:49:42,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 9166 states and 10418 transitions. [2018-10-24 14:49:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-24 14:49:42,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:42,157 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:49:42,157 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:42,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:42,158 INFO L82 PathProgramCache]: Analyzing trace with hash 255667232, now seen corresponding path program 1 times [2018-10-24 14:49:42,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:42,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:42,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:42,450 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:49:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-24 14:49:42,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:42,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:49:42,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:49:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:49:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:49:42,521 INFO L87 Difference]: Start difference. First operand 9166 states and 10418 transitions. Second operand 6 states. [2018-10-24 14:49:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:44,091 INFO L93 Difference]: Finished difference Result 18322 states and 20773 transitions. [2018-10-24 14:49:44,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:49:44,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2018-10-24 14:49:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:44,107 INFO L225 Difference]: With dead ends: 18322 [2018-10-24 14:49:44,107 INFO L226 Difference]: Without dead ends: 9290 [2018-10-24 14:49:44,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:49:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9290 states. [2018-10-24 14:49:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9290 to 8634. [2018-10-24 14:49:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8634 states. [2018-10-24 14:49:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8634 states to 8634 states and 9637 transitions. [2018-10-24 14:49:44,234 INFO L78 Accepts]: Start accepts. Automaton has 8634 states and 9637 transitions. Word has length 249 [2018-10-24 14:49:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:44,234 INFO L481 AbstractCegarLoop]: Abstraction has 8634 states and 9637 transitions. [2018-10-24 14:49:44,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:49:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8634 states and 9637 transitions. [2018-10-24 14:49:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-24 14:49:44,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:44,247 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:44,247 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:44,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash 254713047, now seen corresponding path program 1 times [2018-10-24 14:49:44,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:44,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:44,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:44,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 283 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-24 14:49:45,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:49:45,608 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:49:45,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:45,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:49:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-24 14:49:46,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:49:46,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-24 14:49:46,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 14:49:46,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 14:49:46,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-24 14:49:46,185 INFO L87 Difference]: Start difference. First operand 8634 states and 9637 transitions. Second operand 14 states. [2018-10-24 14:49:50,594 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2018-10-24 14:49:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:51,086 INFO L93 Difference]: Finished difference Result 14663 states and 16308 transitions. [2018-10-24 14:49:51,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:49:51,086 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 271 [2018-10-24 14:49:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:51,087 INFO L225 Difference]: With dead ends: 14663 [2018-10-24 14:49:51,087 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:49:51,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 274 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-10-24 14:49:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:49:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:49:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:49:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:49:51,096 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 271 [2018-10-24 14:49:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:51,096 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:49:51,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 14:49:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:49:51,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:49:51,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:49:51,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,317 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 115 [2018-10-24 14:49:51,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:51,527 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 115 [2018-10-24 14:49:52,587 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2018-10-24 14:49:52,990 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:49:52,993 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,994 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:49:52,995 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:49:52,996 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:49:52,996 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:49:52,996 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:49:52,996 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:49:52,996 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:49:52,996 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:49:52,996 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:49:52,996 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:49:52,996 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,997 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,997 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,997 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,997 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,997 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:49:52,997 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:49:52,997 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:49:52,997 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:49:52,997 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:49:52,998 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:49:52,998 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:49:52,998 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:49:52,998 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:49:52,999 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1)) (.cse3 (= ~a16~0 6)) (.cse11 (= ~a7~0 1)) (.cse12 (= ~a8~0 13))) (let ((.cse9 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1)) (.cse10 (not .cse12)) (.cse0 (<= ~a21~0 0)) (.cse8 (= ~a16~0 4)) (.cse7 (not .cse11)) (.cse4 (not .cse3)) (.cse1 (= ~a12~0 8)) (.cse6 (= ~a21~0 1)) (.cse13 (not .cse5))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse6 .cse2) (and .cse7 .cse1 .cse5 .cse6 .cse2) (and .cse7 (= ~a8~0 15) .cse1 .cse6) (and .cse1 (and .cse8 .cse9 .cse6 .cse10)) (and .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse11 .cse0 .cse12 .cse1 .cse5 .cse2) (and .cse1 .cse6 .cse13 .cse10 (= ~a16~0 5)) (and .cse11 .cse0 .cse8 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse12 .cse5 .cse1 (<= ~a20~0 0)) (and .cse7 .cse4 .cse1 .cse6 .cse13)))) [2018-10-24 14:49:52,999 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,999 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,999 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,999 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,999 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:52,999 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:49:52,999 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:49:53,000 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:49:53,001 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:49:53,001 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:49:53,001 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,001 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,001 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,001 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,001 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,001 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:49:53,001 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:49:53,001 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,002 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:49:53,003 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:49:53,004 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:49:53,004 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:49:53,004 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:49:53,004 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:49:53,004 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,004 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,004 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,004 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1)) (.cse3 (= ~a16~0 6)) (.cse11 (= ~a7~0 1)) (.cse12 (= ~a8~0 13))) (let ((.cse9 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1)) (.cse10 (not .cse12)) (.cse0 (<= ~a21~0 0)) (.cse8 (= ~a16~0 4)) (.cse7 (not .cse11)) (.cse4 (not .cse3)) (.cse1 (= ~a12~0 8)) (.cse6 (= ~a21~0 1)) (.cse13 (not .cse5))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse6 .cse2) (and .cse7 .cse1 .cse5 .cse6 .cse2) (and .cse7 (= ~a8~0 15) .cse1 .cse6) (and .cse1 (and .cse8 .cse9 .cse6 .cse10)) (and .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse11 .cse0 .cse12 .cse1 .cse5 .cse2) (and .cse1 .cse6 .cse13 .cse10 (= ~a16~0 5)) (and .cse11 .cse0 .cse8 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse12 .cse5 .cse1 (<= ~a20~0 0)) (and .cse7 .cse4 .cse1 .cse6 .cse13)))) [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,005 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:49:53,006 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:49:53,007 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,008 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:49:53,009 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:49:53,010 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:49:53,011 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:49:53,011 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:49:53,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:49:53 BoogieIcfgContainer [2018-10-24 14:49:53,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:49:53,036 INFO L168 Benchmark]: Toolchain (without parser) took 38840.18 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -575.0 MB). Peak memory consumption was 633.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:53,037 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:49:53,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.25 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:53,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 176.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:53,039 INFO L168 Benchmark]: Boogie Preprocessor took 71.26 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:49:53,043 INFO L168 Benchmark]: RCFGBuilder took 3521.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.1 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:53,044 INFO L168 Benchmark]: TraceAbstraction took 34367.59 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 475.0 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 81.7 MB). Peak memory consumption was 556.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:53,051 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.28 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 696.25 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 176.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.26 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3521.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.1 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34367.59 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 475.0 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 81.7 MB). Peak memory consumption was 556.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((a21 <= 0 && a12 == 8) && a20 == 1) && a16 == 6) || ((((!(a16 == 6) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (a12 == 8 && ((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((((a21 <= 0 && a16 == 4) && a12 == 8) && a17 <= 0) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 == 1) && a20 == 1)) || ((((a12 == 8 && a21 == 1) && !(a17 == 1)) && !(a8 == 13)) && a16 == 5)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0)) || ((((!(a7 == 1) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((a21 <= 0 && a12 == 8) && a20 == 1) && a16 == 6) || ((((!(a16 == 6) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (a12 == 8 && ((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((((a21 <= 0 && a16 == 4) && a12 == 8) && a17 <= 0) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 == 1) && a20 == 1)) || ((((a12 == 8 && a21 == 1) && !(a17 == 1)) && !(a8 == 13)) && a16 == 5)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0)) || ((((!(a7 == 1) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 34.2s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1818 SDtfs, 3635 SDslu, 968 SDs, 0 SdLazy, 9788 SolverSat, 1683 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 290 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9166occurred in iteration=10, 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 864 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 104 NumberOfFragments, 375 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5939 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 996 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2553 NumberOfCodeBlocks, 2553 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2539 ConstructedInterpolants, 0 QuantifiedInterpolants, 1750117 SizeOfPredicates, 1 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 2256/2261 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...