java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:08:42,513 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:08:42,516 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:08:42,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:08:42,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:08:42,534 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:08:42,536 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:08:42,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:08:42,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:08:42,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:08:42,545 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:08:42,545 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:08:42,547 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:08:42,548 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:08:42,558 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:08:42,559 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:08:42,560 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:08:42,562 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:08:42,564 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:08:42,565 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:08:42,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:08:42,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:08:42,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:08:42,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:08:42,570 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:08:42,571 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:08:42,572 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:08:42,572 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:08:42,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:08:42,574 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:08:42,574 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:08:42,575 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:08:42,575 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:08:42,575 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:08:42,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:08:42,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:08:42,577 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:08:42,594 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:08:42,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:08:42,595 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:08:42,596 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:08:42,596 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:08:42,596 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:08:42,596 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:08:42,597 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:08:42,597 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:08:42,597 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:08:42,597 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:08:42,597 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:08:42,597 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:08:42,598 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:08:42,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:08:42,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:08:42,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:08:42,599 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:08:42,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:08:42,599 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:08:42,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:08:42,600 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:08:42,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:08:42,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:08:42,600 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:08:42,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:08:42,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:08:42,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:08:42,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:08:42,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:08:42,601 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:08:42,602 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:08:42,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:08:42,602 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:08:42,602 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:08:42,602 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:08:42,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:08:42,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:08:42,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:08:42,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:08:42,670 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:08:42,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-10-25 00:08:42,749 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc132b84a/8308b5cd6d774608ab50241f06a2b782/FLAGf43b66371 [2018-10-25 00:08:43,357 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:08:43,360 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-10-25 00:08:43,390 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc132b84a/8308b5cd6d774608ab50241f06a2b782/FLAGf43b66371 [2018-10-25 00:08:43,415 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc132b84a/8308b5cd6d774608ab50241f06a2b782 [2018-10-25 00:08:43,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:08:43,428 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:08:43,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:43,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:08:43,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:08:43,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:43" (1/1) ... [2018-10-25 00:08:43,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ddff4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:43, skipping insertion in model container [2018-10-25 00:08:43,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:43" (1/1) ... [2018-10-25 00:08:43,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:08:43,521 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:08:43,958 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:43,963 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:08:44,062 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:44,087 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:08:44,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44 WrapperNode [2018-10-25 00:08:44,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:44,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:44,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:08:44,089 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:08:44,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... [2018-10-25 00:08:44,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... [2018-10-25 00:08:44,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:44,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:08:44,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:08:44,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:08:44,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... [2018-10-25 00:08:44,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... [2018-10-25 00:08:44,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... [2018-10-25 00:08:44,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... [2018-10-25 00:08:44,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... [2018-10-25 00:08:44,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... [2018-10-25 00:08:44,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... [2018-10-25 00:08:44,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:08:44,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:08:44,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:08:44,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:08:44,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:08:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:08:44,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:08:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:08:44,450 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:08:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:08:44,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:08:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:08:44,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:08:47,933 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:08:47,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:47 BoogieIcfgContainer [2018-10-25 00:08:47,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:08:47,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:08:47,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:08:47,939 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:08:47,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:08:43" (1/3) ... [2018-10-25 00:08:47,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d03476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:47, skipping insertion in model container [2018-10-25 00:08:47,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:44" (2/3) ... [2018-10-25 00:08:47,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d03476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:47, skipping insertion in model container [2018-10-25 00:08:47,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:47" (3/3) ... [2018-10-25 00:08:47,943 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label55_true-unreach-call_false-termination.c [2018-10-25 00:08:47,954 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:08:47,964 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:08:47,983 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:08:48,023 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:08:48,023 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:08:48,024 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:08:48,024 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:08:48,024 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:08:48,024 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:08:48,025 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:08:48,025 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:08:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:08:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-25 00:08:48,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:48,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:48,075 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:48,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:48,082 INFO L82 PathProgramCache]: Analyzing trace with hash -301102600, now seen corresponding path program 1 times [2018-10-25 00:08:48,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:48,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:48,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:48,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:48,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:48,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:48,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:08:48,797 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:48,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:08:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:08:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:48,824 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:08:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:50,296 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-10-25 00:08:50,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:50,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-10-25 00:08:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:50,319 INFO L225 Difference]: With dead ends: 627 [2018-10-25 00:08:50,319 INFO L226 Difference]: Without dead ends: 388 [2018-10-25 00:08:50,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-25 00:08:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-10-25 00:08:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-25 00:08:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-10-25 00:08:50,410 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 112 [2018-10-25 00:08:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:50,411 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-10-25 00:08:50,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-10-25 00:08:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 00:08:50,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:50,421 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:50,421 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:50,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:50,422 INFO L82 PathProgramCache]: Analyzing trace with hash 178328325, now seen corresponding path program 1 times [2018-10-25 00:08:50,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:50,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:50,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:50,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:50,424 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:51,003 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:08:51,195 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 00:08:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:51,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:51,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:51,293 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:51,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:51,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:51,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:51,297 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-10-25 00:08:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:53,284 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-10-25 00:08:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:53,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-25 00:08:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:53,291 INFO L225 Difference]: With dead ends: 905 [2018-10-25 00:08:53,291 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:08:53,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:08:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:08:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:08:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-10-25 00:08:53,325 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 121 [2018-10-25 00:08:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:53,326 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-10-25 00:08:53,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-10-25 00:08:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-25 00:08:53,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:53,329 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:53,330 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:53,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:53,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1372472321, now seen corresponding path program 1 times [2018-10-25 00:08:53,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:53,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:53,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:53,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:53,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:53,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:53,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:08:53,505 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:53,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:53,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:53,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:08:53,507 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-10-25 00:08:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:56,093 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-10-25 00:08:56,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:08:56,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-10-25 00:08:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:56,103 INFO L225 Difference]: With dead ends: 1241 [2018-10-25 00:08:56,104 INFO L226 Difference]: Without dead ends: 865 [2018-10-25 00:08:56,107 INFO L605 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-10-25 00:08:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-10-25 00:08:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-10-25 00:08:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-25 00:08:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-10-25 00:08:56,172 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 123 [2018-10-25 00:08:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:56,173 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-10-25 00:08:56,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:08:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-10-25 00:08:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-25 00:08:56,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:56,176 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:56,177 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:56,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1586168017, now seen corresponding path program 1 times [2018-10-25 00:08:56,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:56,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:56,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:56,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:56,460 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:56,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:56,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:08:56,520 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:56,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:08:56,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:08:56,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:56,522 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 3 states. [2018-10-25 00:08:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:58,788 INFO L93 Difference]: Finished difference Result 2297 states and 3692 transitions. [2018-10-25 00:08:58,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:58,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-25 00:08:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:58,803 INFO L225 Difference]: With dead ends: 2297 [2018-10-25 00:08:58,803 INFO L226 Difference]: Without dead ends: 1485 [2018-10-25 00:08:58,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:58,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2018-10-25 00:08:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1478. [2018-10-25 00:08:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-10-25 00:08:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2327 transitions. [2018-10-25 00:08:58,882 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2327 transitions. Word has length 126 [2018-10-25 00:08:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:58,883 INFO L481 AbstractCegarLoop]: Abstraction has 1478 states and 2327 transitions. [2018-10-25 00:08:58,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2327 transitions. [2018-10-25 00:08:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-25 00:08:58,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:58,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:58,891 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:58,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:58,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1132847554, now seen corresponding path program 1 times [2018-10-25 00:08:58,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:59,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:59,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:59,185 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:59,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:59,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:59,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:59,187 INFO L87 Difference]: Start difference. First operand 1478 states and 2327 transitions. Second operand 5 states. [2018-10-25 00:09:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:00,253 INFO L93 Difference]: Finished difference Result 3050 states and 4851 transitions. [2018-10-25 00:09:00,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:09:00,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-10-25 00:09:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:00,269 INFO L225 Difference]: With dead ends: 3050 [2018-10-25 00:09:00,269 INFO L226 Difference]: Without dead ends: 1430 [2018-10-25 00:09:00,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:09:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-10-25 00:09:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2018-10-25 00:09:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-10-25 00:09:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2227 transitions. [2018-10-25 00:09:00,315 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2227 transitions. Word has length 137 [2018-10-25 00:09:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:00,316 INFO L481 AbstractCegarLoop]: Abstraction has 1430 states and 2227 transitions. [2018-10-25 00:09:00,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:09:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2227 transitions. [2018-10-25 00:09:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-25 00:09:00,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:00,322 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:00,323 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:00,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:00,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2082625773, now seen corresponding path program 1 times [2018-10-25 00:09:00,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:00,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:00,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:00,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:00,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:00,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:00,542 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:00,542 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-10-25 00:09:00,545 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:00,594 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:00,594 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:02,156 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:09:02,159 INFO L272 AbstractInterpreter]: Visited 116 different actions 340 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:09:02,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:02,205 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:09:03,806 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 83.33% of their original sizes. [2018-10-25 00:09:03,807 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:09:09,934 INFO L413 sIntCurrentIteration]: We have 162 unified AI predicates [2018-10-25 00:09:09,935 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:09:09,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:09:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2018-10-25 00:09:09,936 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:09,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:09:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:09:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:09:09,938 INFO L87 Difference]: Start difference. First operand 1430 states and 2227 transitions. Second operand 12 states. [2018-10-25 00:09:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:32,300 INFO L93 Difference]: Finished difference Result 4524 states and 7206 transitions. [2018-10-25 00:09:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:09:32,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 163 [2018-10-25 00:09:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:32,315 INFO L225 Difference]: With dead ends: 4524 [2018-10-25 00:09:32,316 INFO L226 Difference]: Without dead ends: 3100 [2018-10-25 00:09:32,325 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 25 SyntacticMatches, 127 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-10-25 00:09:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-10-25 00:09:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3087. [2018-10-25 00:09:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3087 states. [2018-10-25 00:09:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4429 transitions. [2018-10-25 00:09:32,414 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4429 transitions. Word has length 163 [2018-10-25 00:09:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:32,415 INFO L481 AbstractCegarLoop]: Abstraction has 3087 states and 4429 transitions. [2018-10-25 00:09:32,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:09:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4429 transitions. [2018-10-25 00:09:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-25 00:09:32,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:32,426 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-25 00:09:32,427 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:32,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1378921477, now seen corresponding path program 1 times [2018-10-25 00:09:32,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:32,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:32,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:32,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 78 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:09:32,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:32,598 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:32,598 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-10-25 00:09:32,598 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:32,604 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:32,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:32,812 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:09:32,813 INFO L272 AbstractInterpreter]: Visited 117 different actions 228 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:09:32,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:32,820 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:09:33,159 INFO L232 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 80.87% of their original sizes. [2018-10-25 00:09:33,159 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:09:33,276 INFO L413 sIntCurrentIteration]: We have 185 unified AI predicates [2018-10-25 00:09:33,277 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:09:33,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:09:33,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:09:33,277 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:33,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:09:33,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:09:33,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:09:33,278 INFO L87 Difference]: Start difference. First operand 3087 states and 4429 transitions. Second operand 10 states. [2018-10-25 00:09:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:39,786 INFO L93 Difference]: Finished difference Result 6005 states and 8691 transitions. [2018-10-25 00:09:39,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:09:39,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2018-10-25 00:09:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:39,802 INFO L225 Difference]: With dead ends: 6005 [2018-10-25 00:09:39,802 INFO L226 Difference]: Without dead ends: 3535 [2018-10-25 00:09:39,809 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:09:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2018-10-25 00:09:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3385. [2018-10-25 00:09:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-25 00:09:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4762 transitions. [2018-10-25 00:09:39,900 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4762 transitions. Word has length 186 [2018-10-25 00:09:39,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:39,900 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4762 transitions. [2018-10-25 00:09:39,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:09:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4762 transitions. [2018-10-25 00:09:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-25 00:09:39,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:39,912 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-25 00:09:39,913 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:39,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1556294915, now seen corresponding path program 1 times [2018-10-25 00:09:39,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:39,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:39,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 86 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-25 00:09:40,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:40,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:40,048 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-25 00:09:40,048 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:40,052 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:40,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:40,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:09:40,633 INFO L272 AbstractInterpreter]: Visited 118 different actions 470 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:09:40,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:40,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:09:40,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:40,641 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:09:40,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:40,650 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:09:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:40,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:09:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:41,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:09:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:41,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:09:41,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:09:41,929 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:09:41,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:09:41,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:09:41,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:09:41,931 INFO L87 Difference]: Start difference. First operand 3385 states and 4762 transitions. Second operand 9 states. [2018-10-25 00:09:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:46,588 INFO L93 Difference]: Finished difference Result 9307 states and 13895 transitions. [2018-10-25 00:09:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:09:46,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2018-10-25 00:09:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:46,617 INFO L225 Difference]: With dead ends: 9307 [2018-10-25 00:09:46,617 INFO L226 Difference]: Without dead ends: 4548 [2018-10-25 00:09:46,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-10-25 00:09:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2018-10-25 00:09:46,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 4208. [2018-10-25 00:09:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4208 states. [2018-10-25 00:09:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 5314 transitions. [2018-10-25 00:09:46,785 INFO L78 Accepts]: Start accepts. Automaton has 4208 states and 5314 transitions. Word has length 190 [2018-10-25 00:09:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:46,785 INFO L481 AbstractCegarLoop]: Abstraction has 4208 states and 5314 transitions. [2018-10-25 00:09:46,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:09:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4208 states and 5314 transitions. [2018-10-25 00:09:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-25 00:09:46,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:46,799 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:46,799 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:46,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2143335736, now seen corresponding path program 1 times [2018-10-25 00:09:46,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:46,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:46,802 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 104 proven. 39 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-25 00:09:47,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:47,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:47,300 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-10-25 00:09:47,303 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:47,318 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:47,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:48,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:09:48,514 INFO L272 AbstractInterpreter]: Visited 118 different actions 354 times. Merged at 8 different actions 24 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:09:48,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:48,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:09:48,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:48,560 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:09:48,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:48,575 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:09:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:48,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:09:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-25 00:09:49,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:09:49,479 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:09:49,582 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:09:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 13 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-25 00:09:50,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:09:50,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:09:50,185 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:09:50,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:09:50,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:09:50,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:09:50,186 INFO L87 Difference]: Start difference. First operand 4208 states and 5314 transitions. Second operand 9 states. [2018-10-25 00:09:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:54,148 INFO L93 Difference]: Finished difference Result 11347 states and 14378 transitions. [2018-10-25 00:09:54,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-25 00:09:54,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 206 [2018-10-25 00:09:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:54,178 INFO L225 Difference]: With dead ends: 11347 [2018-10-25 00:09:54,178 INFO L226 Difference]: Without dead ends: 7293 [2018-10-25 00:09:54,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-10-25 00:09:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7293 states. [2018-10-25 00:09:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7293 to 7084. [2018-10-25 00:09:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7084 states. [2018-10-25 00:09:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 8071 transitions. [2018-10-25 00:09:54,386 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 8071 transitions. Word has length 206 [2018-10-25 00:09:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:54,386 INFO L481 AbstractCegarLoop]: Abstraction has 7084 states and 8071 transitions. [2018-10-25 00:09:54,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:09:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 8071 transitions. [2018-10-25 00:09:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-25 00:09:54,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:54,406 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-25 00:09:54,406 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:54,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:54,406 INFO L82 PathProgramCache]: Analyzing trace with hash 681352106, now seen corresponding path program 1 times [2018-10-25 00:09:54,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:54,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:54,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:54,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:54,408 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:54,779 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-10-25 00:09:55,160 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-25 00:09:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 142 proven. 44 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-10-25 00:09:55,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:55,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:55,356 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-10-25 00:09:55,357 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [37], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [115], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:55,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:55,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:56,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:09:56,023 INFO L272 AbstractInterpreter]: Visited 120 different actions 380 times. Merged at 10 different actions 44 times. Widened at 1 different actions 5 times. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:09:56,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:56,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:09:56,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:56,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:09:56,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:56,076 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:09:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:56,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:09:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-25 00:09:56,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:09:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 167 proven. 54 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-25 00:09:56,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:09:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 00:09:56,824 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:09:56,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:09:56,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:09:56,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:09:56,825 INFO L87 Difference]: Start difference. First operand 7084 states and 8071 transitions. Second operand 9 states. [2018-10-25 00:09:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:59,220 INFO L93 Difference]: Finished difference Result 14701 states and 16918 transitions. [2018-10-25 00:09:59,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-25 00:09:59,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 242 [2018-10-25 00:09:59,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:59,249 INFO L225 Difference]: With dead ends: 14701 [2018-10-25 00:09:59,249 INFO L226 Difference]: Without dead ends: 8079 [2018-10-25 00:09:59,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 496 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2018-10-25 00:09:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8079 states. [2018-10-25 00:09:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8079 to 7875. [2018-10-25 00:09:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7875 states. [2018-10-25 00:09:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 8727 transitions. [2018-10-25 00:09:59,451 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 8727 transitions. Word has length 242 [2018-10-25 00:09:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:59,451 INFO L481 AbstractCegarLoop]: Abstraction has 7875 states and 8727 transitions. [2018-10-25 00:09:59,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:09:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 8727 transitions. [2018-10-25 00:09:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-25 00:09:59,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:59,473 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:09:59,473 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:59,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:59,474 INFO L82 PathProgramCache]: Analyzing trace with hash -858570813, now seen corresponding path program 1 times [2018-10-25 00:09:59,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:59,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:59,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:59,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:59,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:59,748 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:10:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 132 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-25 00:10:00,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:10:00,340 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:10:00,341 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-10-25 00:10:00,341 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:10:00,344 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:10:00,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:10:01,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:10:01,147 INFO L272 AbstractInterpreter]: Visited 119 different actions 480 times. Merged at 8 different actions 40 times. Widened at 1 different actions 4 times. Found 7 fixpoints after 5 different actions. Largest state had 38 variables. [2018-10-25 00:10:01,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:01,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:10:01,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:10:01,165 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:10:01,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:01,174 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:10:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:01,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:10:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 170 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-25 00:10:01,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:10:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-25 00:10:01,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:10:01,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-10-25 00:10:01,659 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:10:01,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:10:01,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:10:01,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:10:01,660 INFO L87 Difference]: Start difference. First operand 7875 states and 8727 transitions. Second operand 8 states. [2018-10-25 00:10:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:10:02,903 INFO L93 Difference]: Finished difference Result 13756 states and 15253 transitions. [2018-10-25 00:10:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 00:10:02,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 244 [2018-10-25 00:10:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:10:02,919 INFO L225 Difference]: With dead ends: 13756 [2018-10-25 00:10:02,920 INFO L226 Difference]: Without dead ends: 7165 [2018-10-25 00:10:02,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 486 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:10:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2018-10-25 00:10:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 7109. [2018-10-25 00:10:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2018-10-25 00:10:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 7837 transitions. [2018-10-25 00:10:03,079 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 7837 transitions. Word has length 244 [2018-10-25 00:10:03,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:10:03,080 INFO L481 AbstractCegarLoop]: Abstraction has 7109 states and 7837 transitions. [2018-10-25 00:10:03,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:10:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 7837 transitions. [2018-10-25 00:10:03,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-25 00:10:03,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:10:03,100 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-25 00:10:03,101 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:10:03,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:03,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1158742300, now seen corresponding path program 1 times [2018-10-25 00:10:03,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:10:03,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:03,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:03,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:03,102 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:10:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 137 proven. 110 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-25 00:10:03,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:10:03,625 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:10:03,625 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 249 with the following transitions: [2018-10-25 00:10:03,625 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [29], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [115], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:10:03,628 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:10:03,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:10:04,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:10:04,457 INFO L272 AbstractInterpreter]: Visited 119 different actions 479 times. Merged at 9 different actions 39 times. Widened at 1 different actions 2 times. Found 8 fixpoints after 5 different actions. Largest state had 38 variables. [2018-10-25 00:10:04,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:04,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:10:04,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:10:04,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:10:04,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:04,511 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:10:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:04,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:10:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-25 00:10:04,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:10:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 148 proven. 78 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-25 00:10:04,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:10:04,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2018-10-25 00:10:04,979 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:10:04,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:10:04,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:10:04,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:10:04,981 INFO L87 Difference]: Start difference. First operand 7109 states and 7837 transitions. Second operand 13 states. [2018-10-25 00:10:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:10:08,415 INFO L93 Difference]: Finished difference Result 14192 states and 15972 transitions. [2018-10-25 00:10:08,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:10:08,416 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 248 [2018-10-25 00:10:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:10:08,441 INFO L225 Difference]: With dead ends: 14192 [2018-10-25 00:10:08,442 INFO L226 Difference]: Without dead ends: 7652 [2018-10-25 00:10:08,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:10:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2018-10-25 00:10:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 5247. [2018-10-25 00:10:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5247 states. [2018-10-25 00:10:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5247 states to 5247 states and 5685 transitions. [2018-10-25 00:10:08,598 INFO L78 Accepts]: Start accepts. Automaton has 5247 states and 5685 transitions. Word has length 248 [2018-10-25 00:10:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:10:08,599 INFO L481 AbstractCegarLoop]: Abstraction has 5247 states and 5685 transitions. [2018-10-25 00:10:08,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:10:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5247 states and 5685 transitions. [2018-10-25 00:10:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-25 00:10:08,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:10:08,615 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:10:08,615 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:10:08,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2002622650, now seen corresponding path program 1 times [2018-10-25 00:10:08,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:10:08,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:08,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:08,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:08,617 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:10:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 235 proven. 62 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-25 00:10:08,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:10:08,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:10:08,946 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 292 with the following transitions: [2018-10-25 00:10:08,946 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:10:08,948 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:10:08,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:10:09,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:10:09,755 INFO L272 AbstractInterpreter]: Visited 119 different actions 501 times. Merged at 9 different actions 61 times. Widened at 1 different actions 9 times. Found 11 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:10:09,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:09,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:10:09,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:10:09,760 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:10:09,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:09,769 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:10:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:09,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:10:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-25 00:10:09,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:10:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 250 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-25 00:10:10,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:10:10,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:10:10,163 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:10:10,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:10:10,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:10:10,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:10:10,164 INFO L87 Difference]: Start difference. First operand 5247 states and 5685 transitions. Second operand 11 states. [2018-10-25 00:10:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:10:12,632 INFO L93 Difference]: Finished difference Result 9782 states and 10625 transitions. [2018-10-25 00:10:12,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:10:12,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 291 [2018-10-25 00:10:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:10:12,634 INFO L225 Difference]: With dead ends: 9782 [2018-10-25 00:10:12,634 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:10:12,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 589 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2018-10-25 00:10:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:10:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:10:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:10:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:10:12,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 291 [2018-10-25 00:10:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:10:12,650 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:10:12,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:10:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:10:12,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:10:12,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:10:12,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:12,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:12,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:12,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,679 WARN L179 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 274 [2018-10-25 00:10:13,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:13,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:10:14,347 WARN L179 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 270 [2018-10-25 00:10:14,870 WARN L179 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-10-25 00:10:16,328 WARN L179 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 144 DAG size of output: 77 [2018-10-25 00:10:19,403 WARN L179 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 376 DAG size of output: 108 [2018-10-25 00:10:21,262 WARN L179 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 290 DAG size of output: 130 [2018-10-25 00:10:23,028 WARN L179 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 287 DAG size of output: 125 [2018-10-25 00:10:23,031 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:10:23,032 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-25 00:10:23,032 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:10:23,032 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,032 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,032 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,032 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:10:23,033 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:10:23,034 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,035 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,036 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,036 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,036 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:10:23,036 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:10:23,036 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:10:23,036 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:10:23,036 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:10:23,036 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:10:23,036 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:10:23,037 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:10:23,037 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:10:23,037 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:10:23,037 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:10:23,037 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,037 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,037 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,037 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,037 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,038 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:10:23,038 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:10:23,038 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:10:23,038 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:10:23,038 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:10:23,038 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:10:23,038 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:10:23,038 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:10:23,038 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:10:23,039 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:10:23,039 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:10:23,039 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:10:23,039 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:10:23,039 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,039 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,039 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,039 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 487) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:10:23,040 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:10:23,041 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:10:23,041 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:10:23,041 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:10:23,041 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:10:23,041 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:10:23,041 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:10:23,041 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:10:23,041 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:10:23,041 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,042 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,042 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,042 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,042 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:10:23,042 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,042 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:10:23,042 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,042 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:10:23,042 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:10:23,043 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,044 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:10:23,045 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:10:23,046 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:10:23,047 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:10:23,047 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:10:23,047 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:10:23,047 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:10:23,047 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:10:23,047 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:10:23,047 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:10:23,047 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:10:23,047 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,048 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,048 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,048 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse8 (= ~a28~0 |old(~a28~0)|)) (.cse9 (= ~a25~0 |old(~a25~0)|)) (.cse27 (not (= ~a28~0 10))) (.cse25 (<= ~a17~0 |old(~a17~0)|)) (.cse21 (= ~a11~0 |old(~a11~0)|)) (.cse26 (not (= ~a25~0 1))) (.cse7 (= ~a19~0 |old(~a19~0)|)) (.cse4 (= 9 |old(~a28~0)|)) (.cse22 (= ~a17~0 8)) (.cse17 (= 1 |old(~a25~0)|)) (.cse11 (not (= 1 ~a21~0))) (.cse23 (not (= 0 |old(~a11~0)|))) (.cse24 (not (= 8 |old(~a17~0)|)))) (let ((.cse1 (or .cse11 (= 0 |old(~a28~0)|) .cse23 .cse24)) (.cse2 (not .cse17)) (.cse6 (and (= ~a11~0 0) (not (= ~a28~0 0)) .cse22 (= ~a21~0 1))) (.cse28 (not .cse4)) (.cse29 (and .cse25 .cse21 .cse26 .cse7)) (.cse19 (< 7 |old(~a17~0)|)) (.cse20 (and .cse25 .cse21 .cse7 .cse27)) (.cse12 (not (= 1 |old(~a19~0)|))) (.cse13 (= |old(~a11~0)| |old(~a19~0)|)) (.cse3 (< |old(~a28~0)| 9)) (.cse0 (< 10 |old(~a28~0)|)) (.cse14 (< |old(~a17~0)| 8)) (.cse15 (= 10 |old(~a28~0)|)) (.cse18 (= 8 |old(~a28~0)|)) (.cse5 (< 0 |old(~a19~0)|)) (.cse16 (< 8 |old(~a17~0)|)) (.cse10 (and .cse21 (= |old(~a17~0)| ~a17~0) .cse7 .cse8 .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9)) (or .cse10 (or .cse11 .cse2 (< |old(~a28~0)| 11) .cse12 (not (= |old(~a17~0)| 8)) .cse13)) (or .cse0 .cse11 .cse14 .cse15 .cse4 .cse5 .cse16 .cse10 .cse17) (or (and (= |old(~a28~0)| ~a28~0) .cse6 .cse7 .cse9) .cse4 (or .cse1 .cse15 .cse5 .cse17)) (or .cse0 .cse11 .cse14 .cse10 .cse2 .cse12 .cse18 .cse16) (or .cse11 .cse15 .cse13 .cse19 .cse20) (or (and (and .cse21 .cse22 .cse7) .cse8 .cse9) (or (or (not (= 7 |old(~a28~0)|)) (or .cse11 .cse23 .cse24 (= |calculate_output_#in~input| 0) (not (= 0 |old(~a25~0)|)))) .cse12)) (or (or .cse1 .cse2 .cse12) (and .cse6 .cse8 .cse7 .cse9)) (or .cse11 (and .cse25 .cse21 .cse26 .cse7 .cse27) .cse15 .cse19 .cse17) (or .cse28 (or .cse11 .cse14 .cse12 .cse16) .cse10) (or .cse11 .cse29 .cse13 .cse19 .cse17) (or .cse10 .cse11 .cse14 .cse13 .cse5 .cse16 .cse28 .cse17) (or .cse11 .cse29 .cse12 .cse19 .cse17) (or .cse11 .cse12 .cse15 .cse19 .cse20) (or .cse10 (or .cse0 .cse11 .cse14 .cse12 .cse13 .cse16) .cse3) (or .cse0 .cse11 .cse14 .cse15 .cse18 .cse4 .cse5 .cse16 .cse10)))) [2018-10-25 00:10:23,048 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,048 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,049 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,049 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:10:23,049 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:10:23,049 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:10:23,049 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:10:23,049 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:10:23,049 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:10:23,049 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:10:23,049 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:10:23,050 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:10:23,050 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:10:23,050 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:10:23,050 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:10:23,050 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:10:23,050 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,050 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,050 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,050 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,051 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,051 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,051 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:10:23,051 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:10:23,051 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:10:23,051 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:10:23,051 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:10:23,051 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:10:23,051 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:10:23,052 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:10:23,053 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:10:23,054 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:10:23,055 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:10:23,055 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:10:23,055 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:10:23,055 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:10:23,055 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~a11~0 0) (= ~x~0 24) (= ~a25~0 0) (= ~a~0 1) (= ~a19~0 1) (= ~a17~0 8) (= ~a28~0 7)) [2018-10-25 00:10:23,055 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:10:23,055 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:10:23,056 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and (= |old(~a17~0)| ~a17~0) (= ~a25~0 0) (= ~a19~0 1) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:10:23,056 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:10:23,056 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse13 (= ~a21~0 1))) (let ((.cse4 (= 9 ~a28~0)) (.cse8 (= |old(~a17~0)| ~a17~0)) (.cse14 (not (= ~a28~0 8))) (.cse11 (= 8 ~a17~0)) (.cse7 (= 1 ~a19~0)) (.cse0 (<= ~a17~0 7)) (.cse5 (not (= ~a19~0 ~a11~0))) (.cse3 (<= ~a19~0 0)) (.cse1 (not (= ~a25~0 1))) (.cse2 (not (= ~a28~0 10))) (.cse6 (<= ~a17~0 8)) (.cse9 (<= ~a28~0 10)) (.cse10 (<= 9 ~a28~0)) (.cse12 (= 1 ~a25~0)) (.cse16 (and (= ~a11~0 0) (not (= ~a28~0 0)) (= ~a17~0 8) .cse13)) (.cse17 (<= ~a19~0 |old(~a19~0)|)) (.cse15 (not (= ~a28~0 9)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse5 .cse6) (and (and (and .cse7 .cse5) .cse8 .cse9) .cse10) (and .cse4 .cse11 .cse7) (and .cse12 (<= 11 ~a28~0) .cse7 .cse5 .cse6) (not .cse13) (not (= ~y~0 25)) (and .cse0 .cse1 .cse5) (and .cse12 .cse9 .cse14 .cse2 .cse7 .cse6) (and .cse3 .cse8 .cse9 .cse14 .cse2 .cse15) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse12 .cse11 .cse7 (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse7 .cse2) (not (= 21 ~u~0)) (and .cse16 .cse17 (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse0 .cse1 .cse7) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse12 .cse7 .cse16) (and (and .cse3 .cse1 .cse16 .cse2) .cse15) (not (= 3 ~c~0)) (and .cse0 .cse5 .cse2) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse3 .cse1 .cse9 .cse2 .cse6 .cse15) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and .cse9 .cse10 (and .cse12 .cse16 .cse17) .cse15) (not (= 6 ~f~0))))) [2018-10-25 00:10:23,056 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:10:23,056 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:10:23,057 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse16 (= ~a11~0 0)) (.cse17 (= ~a17~0 8)) (.cse13 (= ~a21~0 1))) (let ((.cse4 (= 9 ~a28~0)) (.cse8 (= |old(~a17~0)| ~a17~0)) (.cse14 (not (= ~a28~0 8))) (.cse11 (= 8 ~a17~0)) (.cse7 (= 1 ~a19~0)) (.cse0 (<= ~a17~0 7)) (.cse5 (not (= ~a19~0 ~a11~0))) (.cse3 (<= ~a19~0 0)) (.cse1 (not (= ~a25~0 1))) (.cse2 (not (= ~a28~0 10))) (.cse6 (<= ~a17~0 8)) (.cse9 (<= ~a28~0 10)) (.cse10 (<= 9 ~a28~0)) (.cse12 (= 1 ~a25~0)) (.cse18 (and .cse16 (not (= ~a28~0 0)) .cse17 .cse13)) (.cse15 (not (= ~a28~0 9)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse5 .cse6) (and (and (and .cse7 .cse5) .cse8 .cse9) .cse10) (and .cse4 .cse11 .cse7) (and .cse12 (<= 11 ~a28~0) .cse7 .cse5 .cse6) (not .cse13) (not (= ~y~0 25)) (and .cse0 .cse1 .cse5) (and .cse12 .cse9 .cse14 .cse2 .cse7 .cse6) (and .cse3 .cse8 .cse9 .cse14 .cse2 .cse15) (and (= ~a28~0 7) (and .cse16 (not (= main_~input~0 0)) (= ~a25~0 0) .cse17 (= ~a19~0 1))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse12 .cse11 .cse7 (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse7 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse0 .cse1 .cse7) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse12 .cse7 .cse18) (and (and .cse3 .cse1 .cse18 .cse2) .cse15) (not (= 3 ~c~0)) (and .cse0 .cse5 .cse2) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse3 .cse1 .cse9 .cse2 .cse6 .cse15) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and .cse9 .cse10 (and .cse12 .cse18 (<= ~a19~0 |old(~a19~0)|)) .cse15) (not (= 6 ~f~0))))) [2018-10-25 00:10:23,057 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:10:23,057 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:10:23,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:10:23 BoogieIcfgContainer [2018-10-25 00:10:23,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:10:23,085 INFO L168 Benchmark]: Toolchain (without parser) took 99656.23 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:10:23,086 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:10:23,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.42 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-10-25 00:10:23,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 198.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-10-25 00:10:23,090 INFO L168 Benchmark]: Boogie Preprocessor took 79.92 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:10:23,091 INFO L168 Benchmark]: RCFGBuilder took 3566.01 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: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:10:23,092 INFO L168 Benchmark]: TraceAbstraction took 95146.51 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-25 00:10:23,103 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.35 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 659.42 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 198.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.92 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3566.01 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: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95146.51 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 487]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((a17 <= 7 && !(a25 == 1)) && !(a28 == 10)) || ((((a19 <= 0 && !(a25 == 1)) && 9 == a28) && !(a19 == a11)) && a17 <= 8)) || ((((1 == a19 && !(a19 == a11)) && \old(a17) == a17) && a28 <= 10) && 9 <= a28)) || ((9 == a28 && 8 == a17) && 1 == a19)) || ((((1 == a25 && 11 <= a28) && 1 == a19) && !(a19 == a11)) && a17 <= 8)) || !(a21 == 1)) || !(y == 25)) || ((a17 <= 7 && !(a25 == 1)) && !(a19 == a11))) || (((((1 == a25 && a28 <= 10) && !(a28 == 8)) && !(a28 == 10)) && 1 == a19) && a17 <= 8)) || (((((a19 <= 0 && \old(a17) == a17) && a28 <= 10) && !(a28 == 8)) && !(a28 == 10)) && !(a28 == 9))) || !(1 == \old(a19))) || !(x == 24)) || (((1 == a25 && 8 == a17) && 1 == a19) && 10 == a28)) || !(e == 5)) || !(d == 4)) || ((a17 <= 7 && 1 == a19) && !(a28 == 10))) || !(21 == u)) || ((((((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1) && a19 <= \old(a19)) && a28 == \old(a28)) && a25 == \old(a25))) || !(22 == v)) || !(\old(a11) == 0)) || ((a17 <= 7 && !(a25 == 1)) && 1 == a19)) || !(z == 26)) || !(0 == \old(a25))) || ((1 == a25 && 1 == a19) && ((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1)) || ((((a19 <= 0 && !(a25 == 1)) && ((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1) && !(a28 == 10)) && !(a28 == 9))) || !(3 == c)) || ((a17 <= 7 && !(a19 == a11)) && !(a28 == 10))) || !(23 == w)) || !(\old(a28) == 7)) || (((((a19 <= 0 && !(a25 == 1)) && a28 <= 10) && !(a28 == 10)) && a17 <= 8) && !(a28 == 9))) || !(a == 1)) || !(\old(a17) == 8)) || (((a28 <= 10 && 9 <= a28) && (1 == a25 && ((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1) && a19 <= \old(a19)) && !(a28 == 9))) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 95.0s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 56.8s AutomataDifference, 0.0s DeadEndRemovalTime, 10.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1529 SDtfs, 14617 SDslu, 2187 SDs, 0 SdLazy, 21711 SolverSat, 2941 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3441 GetRequests, 3106 SyntacticMatches, 145 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7875occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.9s AbstIntTime, 8 AbstIntIterations, 2 AbstIntStrong, 0.9969332723613114 AbsIntWeakeningRatio, 0.207492795389049 AbsIntAvgWeakeningVarsNumRemoved, 0.19596541786743515 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 3436 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 303 PreInvPairs, 421 NumberOfFragments, 1573 HoareAnnotationTreeSize, 303 FomulaSimplifications, 31920 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 27390 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 3810 NumberOfCodeBlocks, 3810 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5206 ConstructedInterpolants, 0 QuantifiedInterpolants, 2409444 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3540 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 4148/4724 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...