java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label22_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:02:42,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:02:42,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:02:42,436 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:02:42,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:02:42,439 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:02:42,440 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:02:42,443 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:02:42,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:02:42,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:02:42,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:02:42,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:02:42,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:02:42,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:02:42,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:02:42,465 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:02:42,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:02:42,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:02:42,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:02:42,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:02:42,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:02:42,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:02:42,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:02:42,486 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:02:42,487 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:02:42,488 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:02:42,489 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:02:42,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:02:42,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:02:42,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:02:42,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:02:42,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:02:42,495 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:02:42,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:02:42,498 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:02:42,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:02:42,499 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:02:42,516 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:02:42,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:02:42,517 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:02:42,517 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:02:42,518 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:02:42,518 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:02:42,518 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:02:42,518 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:02:42,518 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:02:42,519 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:02:42,519 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:02:42,519 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:02:42,519 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:02:42,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:02:42,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:02:42,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:02:42,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:02:42,521 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:02:42,521 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:02:42,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:02:42,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:02:42,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:02:42,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:02:42,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:02:42,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:02:42,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:02:42,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:02:42,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:02:42,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:02:42,523 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:02:42,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:02:42,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:02:42,524 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:02:42,524 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:02:42,524 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:02:42,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:02:42,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:02:42,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:02:42,597 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:02:42,598 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:02:42,599 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label22_true-unreach-call.c [2018-11-07 20:02:42,670 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2b0c10a/f6fc3c7af847431c92d6008446b8b8b1/FLAG862aa5966 [2018-11-07 20:02:43,282 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:02:43,283 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label22_true-unreach-call.c [2018-11-07 20:02:43,295 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2b0c10a/f6fc3c7af847431c92d6008446b8b8b1/FLAG862aa5966 [2018-11-07 20:02:43,311 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2b0c10a/f6fc3c7af847431c92d6008446b8b8b1 [2018-11-07 20:02:43,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:02:43,324 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:02:43,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:02:43,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:02:43,329 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:02:43,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:02:43" (1/1) ... [2018-11-07 20:02:43,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673adebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:43, skipping insertion in model container [2018-11-07 20:02:43,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:02:43" (1/1) ... [2018-11-07 20:02:43,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:02:43,400 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:02:43,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:02:43,843 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:02:43,977 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:02:44,001 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:02:44,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44 WrapperNode [2018-11-07 20:02:44,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:02:44,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:02:44,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:02:44,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:02:44,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... [2018-11-07 20:02:44,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... [2018-11-07 20:02:44,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:02:44,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:02:44,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:02:44,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:02:44,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... [2018-11-07 20:02:44,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... [2018-11-07 20:02:44,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... [2018-11-07 20:02:44,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... [2018-11-07 20:02:44,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... [2018-11-07 20:02:44,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... [2018-11-07 20:02:44,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... [2018-11-07 20:02:44,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:02:44,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:02:44,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:02:44,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:02:44,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:02:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:02:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:02:44,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:02:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:02:44,348 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:02:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:02:44,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:02:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:02:44,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:02:47,592 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:02:47,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:02:47 BoogieIcfgContainer [2018-11-07 20:02:47,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:02:47,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:02:47,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:02:47,599 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:02:47,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:02:43" (1/3) ... [2018-11-07 20:02:47,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a99961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:02:47, skipping insertion in model container [2018-11-07 20:02:47,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:02:44" (2/3) ... [2018-11-07 20:02:47,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a99961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:02:47, skipping insertion in model container [2018-11-07 20:02:47,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:02:47" (3/3) ... [2018-11-07 20:02:47,605 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label22_true-unreach-call.c [2018-11-07 20:02:47,618 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:02:47,629 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:02:47,653 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:02:47,699 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:02:47,700 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:02:47,700 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:02:47,700 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:02:47,700 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:02:47,700 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:02:47,701 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:02:47,701 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:02:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-07 20:02:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 20:02:47,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:02:47,740 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] [2018-11-07 20:02:47,742 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:02:47,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:02:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash 625689180, now seen corresponding path program 1 times [2018-11-07 20:02:47,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:02:47,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:02:47,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:02:47,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:02:47,802 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:02:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:02:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:02:48,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:02:48,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:02:48,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:02:48,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:02:48,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:02:48,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:02:48,269 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-11-07 20:02:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:02:50,804 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-11-07 20:02:50,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:02:50,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-07 20:02:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:02:50,829 INFO L225 Difference]: With dead ends: 737 [2018-11-07 20:02:50,829 INFO L226 Difference]: Without dead ends: 515 [2018-11-07 20:02:50,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-11-07 20:02:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-07 20:02:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-11-07 20:02:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-07 20:02:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 848 transitions. [2018-11-07 20:02:50,942 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 848 transitions. Word has length 44 [2018-11-07 20:02:50,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:02:50,943 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 848 transitions. [2018-11-07 20:02:50,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:02:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 848 transitions. [2018-11-07 20:02:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 20:02:50,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:02:50,952 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:02:50,952 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:02:50,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:02:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2101120931, now seen corresponding path program 1 times [2018-11-07 20:02:50,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:02:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:02:50,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:02:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:02:50,954 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:02:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:02:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:02:51,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:02:51,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:02:51,319 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:02:51,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:02:51,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:02:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:02:51,322 INFO L87 Difference]: Start difference. First operand 515 states and 848 transitions. Second operand 6 states. [2018-11-07 20:02:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:02:54,113 INFO L93 Difference]: Finished difference Result 1863 states and 3251 transitions. [2018-11-07 20:02:54,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:02:54,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-07 20:02:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:02:54,129 INFO L225 Difference]: With dead ends: 1863 [2018-11-07 20:02:54,130 INFO L226 Difference]: Without dead ends: 1354 [2018-11-07 20:02:54,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:02:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-07 20:02:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1331. [2018-11-07 20:02:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-11-07 20:02:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2051 transitions. [2018-11-07 20:02:54,254 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2051 transitions. Word has length 119 [2018-11-07 20:02:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:02:54,254 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2051 transitions. [2018-11-07 20:02:54,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:02:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2051 transitions. [2018-11-07 20:02:54,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 20:02:54,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:02:54,259 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:02:54,260 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:02:54,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:02:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash 51887807, now seen corresponding path program 1 times [2018-11-07 20:02:54,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:02:54,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:02:54,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:02:54,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:02:54,262 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:02:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:02:54,526 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:02:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:02:54,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:02:54,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:02:54,581 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:02:54,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:02:54,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:02:54,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:02:54,583 INFO L87 Difference]: Start difference. First operand 1331 states and 2051 transitions. Second operand 6 states. [2018-11-07 20:02:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:02:58,112 INFO L93 Difference]: Finished difference Result 3512 states and 5693 transitions. [2018-11-07 20:02:58,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:02:58,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-07 20:02:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:02:58,128 INFO L225 Difference]: With dead ends: 3512 [2018-11-07 20:02:58,129 INFO L226 Difference]: Without dead ends: 2187 [2018-11-07 20:02:58,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:02:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-11-07 20:02:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2165. [2018-11-07 20:02:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-11-07 20:02:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3178 transitions. [2018-11-07 20:02:58,207 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3178 transitions. Word has length 121 [2018-11-07 20:02:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:02:58,208 INFO L480 AbstractCegarLoop]: Abstraction has 2165 states and 3178 transitions. [2018-11-07 20:02:58,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:02:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3178 transitions. [2018-11-07 20:02:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-07 20:02:58,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:02:58,212 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:02:58,212 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:02:58,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:02:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash -344279760, now seen corresponding path program 1 times [2018-11-07 20:02:58,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:02:58,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:02:58,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:02:58,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:02:58,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:02:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:02:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:02:58,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:02:58,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 20:02:58,548 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:02:58,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:02:58,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:02:58,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:02:58,549 INFO L87 Difference]: Start difference. First operand 2165 states and 3178 transitions. Second operand 7 states. [2018-11-07 20:03:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:03:00,844 INFO L93 Difference]: Finished difference Result 5115 states and 7643 transitions. [2018-11-07 20:03:00,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 20:03:00,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-11-07 20:03:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:03:00,861 INFO L225 Difference]: With dead ends: 5115 [2018-11-07 20:03:00,861 INFO L226 Difference]: Without dead ends: 2160 [2018-11-07 20:03:00,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:03:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2018-11-07 20:03:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2160. [2018-11-07 20:03:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2018-11-07 20:03:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 3146 transitions. [2018-11-07 20:03:00,962 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 3146 transitions. Word has length 124 [2018-11-07 20:03:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:03:00,962 INFO L480 AbstractCegarLoop]: Abstraction has 2160 states and 3146 transitions. [2018-11-07 20:03:00,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:03:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 3146 transitions. [2018-11-07 20:03:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 20:03:00,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:03:00,967 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:03:00,967 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:03:00,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash -303205129, now seen corresponding path program 1 times [2018-11-07 20:03:00,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:03:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:00,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:03:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:00,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:03:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:03:01,264 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:03:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 20:03:01,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:03:01,512 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:03:01,513 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-11-07 20:03:01,515 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:03:01,573 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:03:01,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:03:02,065 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:03:02,067 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:03:02,068 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 20:03:02,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:02,116 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:03:02,555 INFO L227 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 73.49% of their original sizes. [2018-11-07 20:03:02,556 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:03:02,857 INFO L415 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2018-11-07 20:03:02,857 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:03:02,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:03:02,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2018-11-07 20:03:02,860 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:03:02,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:03:02,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:03:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:03:02,862 INFO L87 Difference]: Start difference. First operand 2160 states and 3146 transitions. Second operand 7 states. [2018-11-07 20:03:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:03:19,479 INFO L93 Difference]: Finished difference Result 4460 states and 6503 transitions. [2018-11-07 20:03:19,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:03:19,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-11-07 20:03:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:03:19,492 INFO L225 Difference]: With dead ends: 4460 [2018-11-07 20:03:19,492 INFO L226 Difference]: Without dead ends: 2306 [2018-11-07 20:03:19,501 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:03:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2018-11-07 20:03:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2304. [2018-11-07 20:03:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2018-11-07 20:03:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3298 transitions. [2018-11-07 20:03:19,561 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3298 transitions. Word has length 125 [2018-11-07 20:03:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:03:19,562 INFO L480 AbstractCegarLoop]: Abstraction has 2304 states and 3298 transitions. [2018-11-07 20:03:19,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:03:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3298 transitions. [2018-11-07 20:03:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-07 20:03:19,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:03:19,566 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:03:19,566 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:03:19,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:19,567 INFO L82 PathProgramCache]: Analyzing trace with hash -679371352, now seen corresponding path program 1 times [2018-11-07 20:03:19,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:03:19,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:19,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:03:19,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:19,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:03:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:03:19,873 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:03:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 20:03:20,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:03:20,127 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:03:20,128 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-11-07 20:03:20,128 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:03:20,147 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:03:20,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:03:20,342 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:03:20,496 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:03:20,497 INFO L272 AbstractInterpreter]: Visited 123 different actions 242 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:03:20,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:20,532 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:03:20,797 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 76.33% of their original sizes. [2018-11-07 20:03:20,797 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:03:21,566 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-11-07 20:03:21,567 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:03:21,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:03:21,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [4] total 21 [2018-11-07 20:03:21,567 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:03:21,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:03:21,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:03:21,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:03:21,568 INFO L87 Difference]: Start difference. First operand 2304 states and 3298 transitions. Second operand 19 states. [2018-11-07 20:03:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:03:40,042 INFO L93 Difference]: Finished difference Result 5681 states and 8617 transitions. [2018-11-07 20:03:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 20:03:40,043 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 160 [2018-11-07 20:03:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:03:40,062 INFO L225 Difference]: With dead ends: 5681 [2018-11-07 20:03:40,062 INFO L226 Difference]: Without dead ends: 3527 [2018-11-07 20:03:40,075 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=375, Invalid=1695, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 20:03:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2018-11-07 20:03:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3349. [2018-11-07 20:03:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3349 states. [2018-11-07 20:03:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 4521 transitions. [2018-11-07 20:03:40,169 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 4521 transitions. Word has length 160 [2018-11-07 20:03:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:03:40,170 INFO L480 AbstractCegarLoop]: Abstraction has 3349 states and 4521 transitions. [2018-11-07 20:03:40,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:03:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 4521 transitions. [2018-11-07 20:03:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 20:03:40,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:03:40,176 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:03:40,176 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:03:40,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1316459295, now seen corresponding path program 1 times [2018-11-07 20:03:40,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:03:40,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:40,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:03:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:03:40,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:03:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:03:40,439 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:03:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-07 20:03:40,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:03:40,572 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:03:40,572 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-07 20:03:40,573 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [598], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:03:40,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:03:40,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:03:40,628 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:03:40,814 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:03:40,815 INFO L272 AbstractInterpreter]: Visited 104 different actions 299 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:03:40,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:03:40,824 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:03:41,637 INFO L227 lantSequenceWeakener]: Weakened 43 states. On average, predicates are now at 76.37% of their original sizes. [2018-11-07 20:03:41,637 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:03:43,063 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-11-07 20:03:43,063 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:03:43,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:03:43,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-07 20:03:43,064 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:03:43,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:03:43,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:03:43,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:03:43,066 INFO L87 Difference]: Start difference. First operand 3349 states and 4521 transitions. Second operand 21 states. [2018-11-07 20:04:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:07,248 INFO L93 Difference]: Finished difference Result 7005 states and 9569 transitions. [2018-11-07 20:04:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 20:04:07,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 211 [2018-11-07 20:04:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:07,268 INFO L225 Difference]: With dead ends: 7005 [2018-11-07 20:04:07,268 INFO L226 Difference]: Without dead ends: 4104 [2018-11-07 20:04:07,280 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=277, Invalid=1205, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 20:04:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2018-11-07 20:04:07,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 4019. [2018-11-07 20:04:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4019 states. [2018-11-07 20:04:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5273 transitions. [2018-11-07 20:04:07,401 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5273 transitions. Word has length 211 [2018-11-07 20:04:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:07,401 INFO L480 AbstractCegarLoop]: Abstraction has 4019 states and 5273 transitions. [2018-11-07 20:04:07,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:04:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5273 transitions. [2018-11-07 20:04:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-07 20:04:07,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:07,407 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:04:07,407 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:07,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1541672056, now seen corresponding path program 1 times [2018-11-07 20:04:07,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:07,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:07,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:07,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:07,409 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-07 20:04:08,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:08,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:04:08,169 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:08,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:04:08,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:04:08,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:04:08,170 INFO L87 Difference]: Start difference. First operand 4019 states and 5273 transitions. Second operand 4 states. [2018-11-07 20:04:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:09,315 INFO L93 Difference]: Finished difference Result 9772 states and 13868 transitions. [2018-11-07 20:04:09,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:04:09,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-11-07 20:04:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:09,342 INFO L225 Difference]: With dead ends: 9772 [2018-11-07 20:04:09,342 INFO L226 Difference]: Without dead ends: 5177 [2018-11-07 20:04:09,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-07 20:04:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2018-11-07 20:04:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 5170. [2018-11-07 20:04:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2018-11-07 20:04:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 6732 transitions. [2018-11-07 20:04:09,503 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 6732 transitions. Word has length 228 [2018-11-07 20:04:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:09,504 INFO L480 AbstractCegarLoop]: Abstraction has 5170 states and 6732 transitions. [2018-11-07 20:04:09,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:04:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 6732 transitions. [2018-11-07 20:04:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-07 20:04:09,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:09,520 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 20:04:09,520 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:09,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2126865736, now seen corresponding path program 1 times [2018-11-07 20:04:09,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:09,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:09,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:09,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:09,889 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:04:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 113 proven. 8 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-07 20:04:10,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:10,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:04:10,450 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-11-07 20:04:10,450 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [706], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:04:10,454 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:04:10,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:04:10,503 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:04:10,889 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:04:10,889 INFO L272 AbstractInterpreter]: Visited 132 different actions 516 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:04:10,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:10,898 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:04:11,214 INFO L227 lantSequenceWeakener]: Weakened 70 states. On average, predicates are now at 74.94% of their original sizes. [2018-11-07 20:04:11,215 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:04:11,679 INFO L415 sIntCurrentIteration]: We unified 313 AI predicates to 313 [2018-11-07 20:04:11,679 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:04:11,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:04:11,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-07 20:04:11,680 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:11,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:04:11,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:04:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:04:11,681 INFO L87 Difference]: Start difference. First operand 5170 states and 6732 transitions. Second operand 21 states. [2018-11-07 20:04:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:20,824 INFO L93 Difference]: Finished difference Result 10854 states and 14170 transitions. [2018-11-07 20:04:20,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 20:04:20,825 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 314 [2018-11-07 20:04:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:20,853 INFO L225 Difference]: With dead ends: 10854 [2018-11-07 20:04:20,853 INFO L226 Difference]: Without dead ends: 6280 [2018-11-07 20:04:20,865 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 327 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=962, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 20:04:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2018-11-07 20:04:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 6146. [2018-11-07 20:04:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6146 states. [2018-11-07 20:04:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6146 states to 6146 states and 7802 transitions. [2018-11-07 20:04:21,020 INFO L78 Accepts]: Start accepts. Automaton has 6146 states and 7802 transitions. Word has length 314 [2018-11-07 20:04:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:21,021 INFO L480 AbstractCegarLoop]: Abstraction has 6146 states and 7802 transitions. [2018-11-07 20:04:21,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:04:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6146 states and 7802 transitions. [2018-11-07 20:04:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-07 20:04:21,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:21,046 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 20:04:21,046 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:21,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2023839100, now seen corresponding path program 1 times [2018-11-07 20:04:21,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:21,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:21,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:21,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:21,048 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 175 proven. 76 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-07 20:04:21,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:21,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:04:21,648 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 357 with the following transitions: [2018-11-07 20:04:21,649 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [706], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:04:21,652 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:04:21,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:04:22,185 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:04:22,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:04:22,502 INFO L272 AbstractInterpreter]: Visited 133 different actions 523 times. Merged at 8 different actions 27 times. Never widened. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:04:22,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:22,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:04:22,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:22,510 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:04:22,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:22,520 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:04:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:22,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:04:23,913 WARN L179 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-11-07 20:04:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 301 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 20:04:24,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:04:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 301 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 20:04:25,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:04:25,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2018-11-07 20:04:25,242 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:04:25,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 20:04:25,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 20:04:25,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:04:25,245 INFO L87 Difference]: Start difference. First operand 6146 states and 7802 transitions. Second operand 13 states. [2018-11-07 20:04:27,487 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 12 [2018-11-07 20:04:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:34,445 INFO L93 Difference]: Finished difference Result 13425 states and 18212 transitions. [2018-11-07 20:04:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 20:04:34,446 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 356 [2018-11-07 20:04:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:34,448 INFO L225 Difference]: With dead ends: 13425 [2018-11-07 20:04:34,448 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:04:34,506 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 705 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1040, Invalid=4362, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 20:04:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:04:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:04:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:04:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:04:34,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 356 [2018-11-07 20:04:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:34,508 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:04:34,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 20:04:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:04:34,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:04:34,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:04:34,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:34,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:34,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:34,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:34,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:34,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:34,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:34,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:34,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:34,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:35,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:35,090 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 141 [2018-11-07 20:04:35,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:35,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:35,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:35,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:04:35,278 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 77 [2018-11-07 20:04:35,926 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2018-11-07 20:04:36,381 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 47 [2018-11-07 20:04:37,958 WARN L179 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 246 DAG size of output: 86 [2018-11-07 20:04:38,282 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 60 [2018-11-07 20:04:38,558 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 64 [2018-11-07 20:04:38,562 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:04:38,562 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~a10~0)| ~a10~0) [2018-11-07 20:04:38,562 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:04:38,562 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-07 20:04:38,562 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,563 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,563 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,563 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,563 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,563 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,563 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2018-11-07 20:04:38,563 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-07 20:04:38,563 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,564 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 20:04:38,565 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 20:04:38,566 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,567 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,568 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,568 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,568 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-07 20:04:38,568 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-07 20:04:38,568 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-07 20:04:38,568 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 20:04:38,568 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 20:04:38,568 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 20:04:38,568 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 20:04:38,569 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 20:04:38,569 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-07 20:04:38,569 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-07 20:04:38,569 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-07 20:04:38,569 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-07 20:04:38,569 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-07 20:04:38,569 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,569 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,569 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,570 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,570 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,570 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 20:04:38,570 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 20:04:38,570 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 20:04:38,570 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 20:04:38,570 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 20:04:38,570 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-07 20:04:38,570 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-07 20:04:38,571 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-07 20:04:38,571 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-07 20:04:38,571 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,571 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,571 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,571 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,571 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,571 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,572 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,572 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-07 20:04:38,572 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-07 20:04:38,572 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-07 20:04:38,572 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-07 20:04:38,572 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 20:04:38,572 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 20:04:38,572 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 20:04:38,572 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,573 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,574 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 20:04:38,574 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,574 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-07 20:04:38,574 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-07 20:04:38,574 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-07 20:04:38,574 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 20:04:38,574 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 20:04:38,574 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 20:04:38,574 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,575 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 20:04:38,576 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 20:04:38,577 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 20:04:38,577 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-07 20:04:38,577 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-07 20:04:38,577 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse6 (<= |old(~a1~0)| ~a1~0)) (.cse0 (= |old(~a10~0)| ~a10~0))) (let ((.cse5 (<= ~a1~0 218)) (.cse7 (< 218 |old(~a1~0)|)) (.cse4 (not (= 7 ~a19~0))) (.cse12 (and .cse6 .cse0)) (.cse8 (= 3 |old(~a10~0)|)) (.cse9 (= 0 |old(~a10~0)|)) (.cse3 (= 7 |old(~a19~0)|)) (.cse16 (<= ~a1~0 23)) (.cse10 (< 6 |calculate_output_#in~input|)) (.cse11 (< |calculate_output_#in~input| 2)) (.cse1 (not (= 14 ~a4~0))) (.cse15 (= ~a19~0 9)) (.cse17 (< 23 |old(~a1~0)|)) (.cse2 (not (= 0 ~a12~0))) (.cse14 (< |old(~a10~0)| 0)) (.cse13 (not (= 9 |old(~a19~0)|)))) (and (or (and (= 8 ~a19~0) .cse0) (not (= 8 |old(~a19~0)|)) .cse1 .cse2) (or .cse3 .cse1 .cse2 (and .cse4 .cse5 .cse6 .cse0) .cse7) (or .cse8 .cse5 .cse1 .cse2 .cse7 .cse9) (or .cse10 .cse11 .cse1 .cse12 .cse2 .cse13) (or .cse3 .cse1 .cse2 .cse9 (and .cse4 .cse6 .cse0)) (or (<= (+ ~a1~0 45480) 0) .cse10 .cse11 (or (< 0 (+ |old(~a1~0)| 45480)) .cse1 (not (= 2 |old(~a10~0)|))) .cse2 .cse13 (< (+ |old(~a1~0)| 45489) 0)) (or .cse8 .cse1 .cse2 .cse12 .cse9) (or .cse10 .cse11 .cse1 .cse2 .cse14 .cse13 .cse15 (< 1 |old(~a10~0)|)) (or .cse8 .cse1 .cse2 .cse16 .cse9 .cse17) (or .cse3 .cse16 .cse1 .cse2 .cse17) (or .cse10 .cse11 .cse1 (< 2 |old(~a10~0)|) .cse15 .cse17 (< (+ |old(~a1~0)| 600000) 0) .cse2 .cse14 .cse13)))) [2018-11-07 20:04:38,578 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-07 20:04:38,578 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-07 20:04:38,578 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-07 20:04:38,578 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,578 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,578 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,578 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,578 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,579 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,579 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-07 20:04:38,579 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 20:04:38,579 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 20:04:38,579 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 20:04:38,579 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 20:04:38,579 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 20:04:38,579 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 20:04:38,579 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-07 20:04:38,580 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-07 20:04:38,580 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-07 20:04:38,580 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-07 20:04:38,580 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-07 20:04:38,580 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-07 20:04:38,580 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,580 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,580 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,580 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 20:04:38,581 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 20:04:38,582 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 20:04:38,582 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-07 20:04:38,582 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-07 20:04:38,582 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-07 20:04:38,582 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,582 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,582 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,582 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,583 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,583 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:04:38,583 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-07 20:04:38,583 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-07 20:04:38,583 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-07 20:04:38,583 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 20:04:38,583 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 20:04:38,583 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 20:04:38,583 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 20:04:38,584 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 20:04:38,584 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 20:04:38,584 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-07 20:04:38,584 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-07 20:04:38,584 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-07 20:04:38,584 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:04:38,584 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4)) [2018-11-07 20:04:38,584 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:04:38,585 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:04:38,585 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (= ~a19~0 9) (= ~a10~0 |old(~a10~0)|) (= ~a1~0 23)) (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0))) [2018-11-07 20:04:38,585 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-07 20:04:38,585 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse1 (not (= 0 ~a10~0))) (.cse2 (not (= 7 ~a19~0))) (.cse0 (<= ~a1~0 218))) (or (and (not (= ~a10~0 3)) .cse0 .cse1) (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (and .cse2 .cse1) (= 1 ~a10~0) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (and .cse2 .cse0) (not (= 3 ~inputC~0)) (= 8 ~a19~0) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (and (= ~a19~0 9) (<= main_~input~0 6) (<= 2 main_~input~0)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)))) [2018-11-07 20:04:38,585 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-07 20:04:38,585 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-07 20:04:38,585 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-07 20:04:38,586 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse1 (not (= 0 ~a10~0))) (.cse2 (not (= 7 ~a19~0))) (.cse0 (<= ~a1~0 218))) (or (and (not (= ~a10~0 3)) .cse0 .cse1) (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (and .cse2 .cse1) (= 1 ~a10~0) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (and .cse2 .cse0) (not (= 3 ~inputC~0)) (= 8 ~a19~0) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (= ~a19~0 9) (not (= |old(~a19~0)| 9)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)))) [2018-11-07 20:04:38,586 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-07 20:04:38,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:04:38 BoogieIcfgContainer [2018-11-07 20:04:38,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:04:38,600 INFO L168 Benchmark]: Toolchain (without parser) took 115276.62 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 20:04:38,601 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:04:38,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.81 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:04:38,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-11-07 20:04:38,603 INFO L168 Benchmark]: Boogie Preprocessor took 110.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-11-07 20:04:38,604 INFO L168 Benchmark]: RCFGBuilder took 3330.28 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: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. [2018-11-07 20:04:38,605 INFO L168 Benchmark]: TraceAbstraction took 111004.18 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 20:04:38,610 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 677.81 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 149.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3330.28 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: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111004.18 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: 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: 582]: Loop Invariant Derived loop invariant: ((((((((((((((((!(a10 == 3) && a1 <= 218) && !(0 == a10)) || !(\old(a1) == 23)) || !(0 == a12)) || (!(7 == a19) && !(0 == a10))) || 1 == a10) || !(4 == inputD)) || !(inputE == 5)) || (!(7 == a19) && a1 <= 218)) || !(3 == inputC)) || 8 == a19) || !(a4 == 14)) || !(2 == inputB)) || a19 == 9) || !(\old(a19) == 9)) || !(inputF == 6)) || !(\old(a10) == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 110.8s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 90.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1335 SDtfs, 13345 SDslu, 1948 SDs, 0 SdLazy, 17659 SolverSat, 3203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.1s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1690 GetRequests, 1468 SyntacticMatches, 5 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2681 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6146occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.5s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9967720420865028 AbsIntWeakeningRatio, 0.12158808933002481 AbsIntAvgWeakeningVarsNumRemoved, 17.299007444168733 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 451 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 180 PreInvPairs, 292 NumberOfFragments, 558 HoareAnnotationTreeSize, 180 FomulaSimplifications, 11333 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5793 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 2158 NumberOfCodeBlocks, 2158 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2502 ConstructedInterpolants, 0 QuantifiedInterpolants, 3738032 SizeOfPredicates, 8 NumberOfNonLiveVariables, 566 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 1767/1923 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...