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_label25_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:06:11,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:06:11,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:06:11,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:06:11,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:06:11,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:06:11,222 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:06:11,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:06:11,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:06:11,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:06:11,230 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:06:11,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:06:11,232 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:06:11,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:06:11,240 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:06:11,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:06:11,243 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:06:11,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:06:11,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:06:11,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:06:11,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:06:11,253 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:06:11,256 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:06:11,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:06:11,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:06:11,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:06:11,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:06:11,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:06:11,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:06:11,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:06:11,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:06:11,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:06:11,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:06:11,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:06:11,266 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:06:11,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:06:11,268 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:06:11,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:06:11,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:06:11,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:06:11,284 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:06:11,284 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:06:11,285 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:06:11,285 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:06:11,285 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:06:11,285 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:06:11,285 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:06:11,285 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:06:11,286 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:06:11,286 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:06:11,286 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:06:11,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:06:11,287 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:06:11,287 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:06:11,287 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:06:11,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:06:11,288 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:06:11,288 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:06:11,288 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:06:11,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:06:11,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:06:11,289 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:06:11,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:06:11,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:06:11,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:06:11,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:06:11,290 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:06:11,290 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:06:11,290 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:06:11,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:06:11,290 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:06:11,291 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:06:11,291 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:06:11,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:06:11,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:06:11,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:06:11,371 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:06:11,372 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:06:11,373 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c [2018-10-25 00:06:11,433 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7fe132bcf/49bc9d012f2f4c158907ac630c5938f4/FLAG0d8c7ee38 [2018-10-25 00:06:11,947 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:06:11,948 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c [2018-10-25 00:06:11,960 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7fe132bcf/49bc9d012f2f4c158907ac630c5938f4/FLAG0d8c7ee38 [2018-10-25 00:06:11,980 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7fe132bcf/49bc9d012f2f4c158907ac630c5938f4 [2018-10-25 00:06:11,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:06:11,994 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:06:11,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:06:11,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:06:11,999 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:06:12,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:06:11" (1/1) ... [2018-10-25 00:06:12,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc5d6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12, skipping insertion in model container [2018-10-25 00:06:12,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:06:11" (1/1) ... [2018-10-25 00:06:12,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:06:12,085 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:06:12,569 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:06:12,574 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:06:12,699 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:06:12,717 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:06:12,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12 WrapperNode [2018-10-25 00:06:12,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:06:12,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:06:12,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:06:12,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:06:12,729 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:06:12" (1/1) ... [2018-10-25 00:06:12,751 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:06:12" (1/1) ... [2018-10-25 00:06:12,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:06:12,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:06:12,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:06:12,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:06:12,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12" (1/1) ... [2018-10-25 00:06:12,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12" (1/1) ... [2018-10-25 00:06:12,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12" (1/1) ... [2018-10-25 00:06:12,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12" (1/1) ... [2018-10-25 00:06:12,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12" (1/1) ... [2018-10-25 00:06:12,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12" (1/1) ... [2018-10-25 00:06:12,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12" (1/1) ... [2018-10-25 00:06:12,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:06:12,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:06:12,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:06:12,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:06:12,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12" (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:06:13,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:06:13,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:06:13,079 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:06:13,080 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:06:13,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:06:13,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:06:13,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:06:13,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:06:16,625 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:06:16,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:06:16 BoogieIcfgContainer [2018-10-25 00:06:16,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:06:16,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:06:16,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:06:16,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:06:16,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:06:11" (1/3) ... [2018-10-25 00:06:16,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e8446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:06:16, skipping insertion in model container [2018-10-25 00:06:16,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:12" (2/3) ... [2018-10-25 00:06:16,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e8446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:06:16, skipping insertion in model container [2018-10-25 00:06:16,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:06:16" (3/3) ... [2018-10-25 00:06:16,646 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label25_true-unreach-call_false-termination.c [2018-10-25 00:06:16,656 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:06:16,666 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:06:16,684 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:06:16,723 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:06:16,724 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:06:16,724 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:06:16,724 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:06:16,724 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:06:16,725 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:06:16,725 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:06:16,725 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:06:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:06:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 00:06:16,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:16,774 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, 1, 1, 1, 1, 1, 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:06:16,777 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:16,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1914702647, now seen corresponding path program 1 times [2018-10-25 00:06:16,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:16,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:16,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:16,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:17,439 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:06:17,584 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:06:17,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:06:17,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:06:17,588 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:17,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:06:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:06:17,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:06:17,617 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:06:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:19,003 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-10-25 00:06:19,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:06:19,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2018-10-25 00:06:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:19,025 INFO L225 Difference]: With dead ends: 618 [2018-10-25 00:06:19,025 INFO L226 Difference]: Without dead ends: 379 [2018-10-25 00:06:19,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:06:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-25 00:06:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-25 00:06:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-25 00:06:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-10-25 00:06:19,127 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 141 [2018-10-25 00:06:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:19,128 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-10-25 00:06:19,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:06:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-10-25 00:06:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-25 00:06:19,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:19,139 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:19,139 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:19,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:19,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1933191934, now seen corresponding path program 1 times [2018-10-25 00:06:19,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:19,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:19,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:19,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:19,142 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:19,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:06:19,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:06:19,505 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:19,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:06:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:06:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:06:19,508 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-10-25 00:06:19,749 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 00:06:21,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:21,887 INFO L93 Difference]: Finished difference Result 1229 states and 2094 transitions. [2018-10-25 00:06:21,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:06:21,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-10-25 00:06:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:21,898 INFO L225 Difference]: With dead ends: 1229 [2018-10-25 00:06:21,898 INFO L226 Difference]: Without dead ends: 856 [2018-10-25 00:06:21,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:06:21,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-25 00:06:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2018-10-25 00:06:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-25 00:06:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1292 transitions. [2018-10-25 00:06:21,978 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1292 transitions. Word has length 157 [2018-10-25 00:06:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:21,979 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 1292 transitions. [2018-10-25 00:06:21,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:06:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1292 transitions. [2018-10-25 00:06:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-25 00:06:21,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:21,989 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:06:21,989 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:21,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:21,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1310013485, now seen corresponding path program 1 times [2018-10-25 00:06:21,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:21,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:21,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:21,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:22,304 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:06:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:22,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:06:22,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:06:22,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:22,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:06:22,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:06:22,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:06:22,362 INFO L87 Difference]: Start difference. First operand 823 states and 1292 transitions. Second operand 6 states. [2018-10-25 00:06:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:26,106 INFO L93 Difference]: Finished difference Result 2557 states and 4222 transitions. [2018-10-25 00:06:26,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:06:26,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-25 00:06:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:26,135 INFO L225 Difference]: With dead ends: 2557 [2018-10-25 00:06:26,135 INFO L226 Difference]: Without dead ends: 1740 [2018-10-25 00:06:26,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:06:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2018-10-25 00:06:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1682. [2018-10-25 00:06:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-10-25 00:06:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2540 transitions. [2018-10-25 00:06:26,236 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2540 transitions. Word has length 164 [2018-10-25 00:06:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:26,237 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 2540 transitions. [2018-10-25 00:06:26,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:06:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2540 transitions. [2018-10-25 00:06:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-25 00:06:26,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:26,247 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:26,247 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:26,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1460724459, now seen corresponding path program 1 times [2018-10-25 00:06:26,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:26,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:26,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:26,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:26,249 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 00:06:26,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:26,477 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:26,478 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-10-25 00:06:26,480 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [799], [801], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:26,534 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:26,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:27,167 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:06:27,168 INFO L272 AbstractInterpreter]: Visited 142 different actions 142 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-25 00:06:27,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:27,219 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:06:27,758 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 81.34% of their original sizes. [2018-10-25 00:06:27,758 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:06:27,967 INFO L413 sIntCurrentIteration]: We have 165 unified AI predicates [2018-10-25 00:06:27,968 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:06:27,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:06:27,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:06:27,969 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:27,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:06:27,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:06:27,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:06:27,970 INFO L87 Difference]: Start difference. First operand 1682 states and 2540 transitions. Second operand 6 states. [2018-10-25 00:06:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:37,535 INFO L93 Difference]: Finished difference Result 3506 states and 5281 transitions. [2018-10-25 00:06:37,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:06:37,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-10-25 00:06:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:37,546 INFO L225 Difference]: With dead ends: 3506 [2018-10-25 00:06:37,546 INFO L226 Difference]: Without dead ends: 1830 [2018-10-25 00:06:37,552 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:06:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-10-25 00:06:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1827. [2018-10-25 00:06:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-10-25 00:06:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2692 transitions. [2018-10-25 00:06:37,603 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2692 transitions. Word has length 166 [2018-10-25 00:06:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:37,603 INFO L481 AbstractCegarLoop]: Abstraction has 1827 states and 2692 transitions. [2018-10-25 00:06:37,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:06:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2692 transitions. [2018-10-25 00:06:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-25 00:06:37,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:37,612 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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:06:37,612 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:37,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2035656138, now seen corresponding path program 1 times [2018-10-25 00:06:37,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:37,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:37,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:06:37,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:37,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:37,836 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-10-25 00:06:37,837 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [799], [801], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:37,843 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:37,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:38,590 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:06:38,590 INFO L272 AbstractInterpreter]: Visited 146 different actions 435 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:06:38,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:38,613 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:06:39,865 INFO L232 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 82.41% of their original sizes. [2018-10-25 00:06:39,865 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:06:44,491 INFO L413 sIntCurrentIteration]: We have 175 unified AI predicates [2018-10-25 00:06:44,492 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:06:44,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:06:44,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-10-25 00:06:44,492 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:44,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:06:44,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:06:44,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:06:44,494 INFO L87 Difference]: Start difference. First operand 1827 states and 2692 transitions. Second operand 12 states. [2018-10-25 00:06:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:57,474 INFO L93 Difference]: Finished difference Result 5086 states and 7444 transitions. [2018-10-25 00:06:57,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:06:57,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 176 [2018-10-25 00:06:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:57,491 INFO L225 Difference]: With dead ends: 5086 [2018-10-25 00:06:57,492 INFO L226 Difference]: Without dead ends: 3265 [2018-10-25 00:06:57,498 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 179 GetRequests, 28 SyntacticMatches, 137 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:06:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2018-10-25 00:06:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3069. [2018-10-25 00:06:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3069 states. [2018-10-25 00:06:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 4237 transitions. [2018-10-25 00:06:57,586 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 4237 transitions. Word has length 176 [2018-10-25 00:06:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:57,587 INFO L481 AbstractCegarLoop]: Abstraction has 3069 states and 4237 transitions. [2018-10-25 00:06:57,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:06:57,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4237 transitions. [2018-10-25 00:06:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-25 00:06:57,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:57,598 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-10-25 00:06:57,599 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:57,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash -223071856, now seen corresponding path program 1 times [2018-10-25 00:06:57,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:57,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:57,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:57,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:57,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:57,740 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-10-25 00:06:57,740 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], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [799], [801], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:57,746 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:57,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:58,243 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:58,243 INFO L272 AbstractInterpreter]: Visited 146 different actions 433 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:06:58,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:58,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:58,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:58,253 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:06:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:58,262 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:58,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:58,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:59,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:59,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 00:06:59,488 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:59,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:06:59,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:06:59,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:06:59,489 INFO L87 Difference]: Start difference. First operand 3069 states and 4237 transitions. Second operand 9 states. [2018-10-25 00:07:00,576 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-25 00:07:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:02,144 INFO L93 Difference]: Finished difference Result 7120 states and 10414 transitions. [2018-10-25 00:07:02,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 00:07:02,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2018-10-25 00:07:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:02,173 INFO L225 Difference]: With dead ends: 7120 [2018-10-25 00:07:02,173 INFO L226 Difference]: Without dead ends: 4629 [2018-10-25 00:07:02,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 370 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:07:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2018-10-25 00:07:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4553. [2018-10-25 00:07:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4553 states. [2018-10-25 00:07:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6395 transitions. [2018-10-25 00:07:02,330 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6395 transitions. Word has length 187 [2018-10-25 00:07:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:02,331 INFO L481 AbstractCegarLoop]: Abstraction has 4553 states and 6395 transitions. [2018-10-25 00:07:02,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:07:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6395 transitions. [2018-10-25 00:07:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-25 00:07:02,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:02,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:02,347 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:02,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1020466792, now seen corresponding path program 1 times [2018-10-25 00:07:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:02,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:02,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:02,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:02,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:02,819 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-10-25 00:07:02,820 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], [127], [128], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [799], [801], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:02,836 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:02,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:04,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:07:04,111 INFO L272 AbstractInterpreter]: Visited 146 different actions 436 times. Merged at 7 different actions 22 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:07:04,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:04,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:07:04,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:04,137 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:07:04,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:04,149 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:07:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:04,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:07:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:07:04,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:07:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:07:04,850 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:04,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-10-25 00:07:04,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:04,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:07:04,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:07:04,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:07:04,852 INFO L87 Difference]: Start difference. First operand 4553 states and 6395 transitions. Second operand 3 states. [2018-10-25 00:07:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:06,750 INFO L93 Difference]: Finished difference Result 10434 states and 15227 transitions. [2018-10-25 00:07:06,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:07:06,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-10-25 00:07:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:06,785 INFO L225 Difference]: With dead ends: 10434 [2018-10-25 00:07:06,785 INFO L226 Difference]: Without dead ends: 6447 [2018-10-25 00:07:06,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:07:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6447 states. [2018-10-25 00:07:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6447 to 6417. [2018-10-25 00:07:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6417 states. [2018-10-25 00:07:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6417 states to 6417 states and 8622 transitions. [2018-10-25 00:07:06,992 INFO L78 Accepts]: Start accepts. Automaton has 6417 states and 8622 transitions. Word has length 191 [2018-10-25 00:07:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:06,993 INFO L481 AbstractCegarLoop]: Abstraction has 6417 states and 8622 transitions. [2018-10-25 00:07:06,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:07:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6417 states and 8622 transitions. [2018-10-25 00:07:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-25 00:07:07,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:07,015 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:07,015 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:07,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:07,016 INFO L82 PathProgramCache]: Analyzing trace with hash 615764323, now seen corresponding path program 1 times [2018-10-25 00:07:07,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:07,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:07,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:07,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:07,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 74 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-25 00:07:07,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:07,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:07,491 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-10-25 00:07:07,492 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [799], [801], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:07,495 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:07,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:08,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:07:08,160 INFO L272 AbstractInterpreter]: Visited 147 different actions 442 times. Merged at 8 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:07:08,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:08,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:07:08,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:08,196 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:07:08,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:08,215 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:07:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:08,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:07:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:07:08,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:07:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:07:08,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:07:08,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:07:08,533 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:07:08,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:07:08,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:07:08,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:07:08,535 INFO L87 Difference]: Start difference. First operand 6417 states and 8622 transitions. Second operand 9 states. [2018-10-25 00:07:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:12,947 INFO L93 Difference]: Finished difference Result 13633 states and 18655 transitions. [2018-10-25 00:07:12,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-25 00:07:12,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2018-10-25 00:07:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:12,971 INFO L225 Difference]: With dead ends: 13633 [2018-10-25 00:07:12,971 INFO L226 Difference]: Without dead ends: 5199 [2018-10-25 00:07:13,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 432 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=1063, Unknown=0, NotChecked=0, Total=1406 [2018-10-25 00:07:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2018-10-25 00:07:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 5005. [2018-10-25 00:07:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5005 states. [2018-10-25 00:07:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 5915 transitions. [2018-10-25 00:07:13,143 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 5915 transitions. Word has length 207 [2018-10-25 00:07:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:13,143 INFO L481 AbstractCegarLoop]: Abstraction has 5005 states and 5915 transitions. [2018-10-25 00:07:13,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:07:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 5915 transitions. [2018-10-25 00:07:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-25 00:07:13,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:13,157 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:13,158 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:13,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2104340435, now seen corresponding path program 1 times [2018-10-25 00:07:13,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:13,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:13,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:13,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:13,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 64 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:07:14,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:14,298 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:14,298 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-10-25 00:07:14,299 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [799], [801], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:14,302 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:14,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:15,129 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:15,129 INFO L272 AbstractInterpreter]: Visited 146 different actions 430 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:07:15,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:15,139 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:16,435 INFO L232 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 82.64% of their original sizes. [2018-10-25 00:07:16,435 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:21,305 INFO L413 sIntCurrentIteration]: We have 207 unified AI predicates [2018-10-25 00:07:21,306 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:21,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:21,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2018-10-25 00:07:21,306 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:21,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:07:21,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:07:21,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:07:21,307 INFO L87 Difference]: Start difference. First operand 5005 states and 5915 transitions. Second operand 13 states. [2018-10-25 00:07:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:36,434 INFO L93 Difference]: Finished difference Result 10568 states and 12568 transitions. [2018-10-25 00:07:36,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:07:36,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 208 [2018-10-25 00:07:36,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:36,452 INFO L225 Difference]: With dead ends: 10568 [2018-10-25 00:07:36,452 INFO L226 Difference]: Without dead ends: 6190 [2018-10-25 00:07:36,459 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 32 SyntacticMatches, 164 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:07:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6190 states. [2018-10-25 00:07:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6190 to 6163. [2018-10-25 00:07:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6163 states. [2018-10-25 00:07:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6163 states to 6163 states and 7142 transitions. [2018-10-25 00:07:36,594 INFO L78 Accepts]: Start accepts. Automaton has 6163 states and 7142 transitions. Word has length 208 [2018-10-25 00:07:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:36,595 INFO L481 AbstractCegarLoop]: Abstraction has 6163 states and 7142 transitions. [2018-10-25 00:07:36,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:07:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6163 states and 7142 transitions. [2018-10-25 00:07:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-25 00:07:36,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:36,612 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:36,612 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:36,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2051198752, now seen corresponding path program 1 times [2018-10-25 00:07:36,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:36,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:36,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 71 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:07:36,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:36,980 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:36,980 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-10-25 00:07:36,980 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [799], [801], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:36,983 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:36,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:37,583 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:37,583 INFO L272 AbstractInterpreter]: Visited 147 different actions 589 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-25 00:07:37,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:37,590 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:39,170 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 81.94% of their original sizes. [2018-10-25 00:07:39,171 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:43,640 INFO L413 sIntCurrentIteration]: We have 212 unified AI predicates [2018-10-25 00:07:43,640 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:43,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:43,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2018-10-25 00:07:43,641 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:43,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:07:43,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:07:43,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:07:43,642 INFO L87 Difference]: Start difference. First operand 6163 states and 7142 transitions. Second operand 13 states. [2018-10-25 00:07:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:52,882 INFO L93 Difference]: Finished difference Result 9970 states and 11645 transitions. [2018-10-25 00:07:52,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:07:52,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 213 [2018-10-25 00:07:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:52,898 INFO L225 Difference]: With dead ends: 9970 [2018-10-25 00:07:52,898 INFO L226 Difference]: Without dead ends: 5360 [2018-10-25 00:07:52,904 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 43 SyntacticMatches, 158 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-10-25 00:07:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5360 states. [2018-10-25 00:07:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5360 to 5261. [2018-10-25 00:07:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5261 states. [2018-10-25 00:07:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 6061 transitions. [2018-10-25 00:07:53,031 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 6061 transitions. Word has length 213 [2018-10-25 00:07:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:53,031 INFO L481 AbstractCegarLoop]: Abstraction has 5261 states and 6061 transitions. [2018-10-25 00:07:53,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:07:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 6061 transitions. [2018-10-25 00:07:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-25 00:07:53,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:53,047 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:07:53,048 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:53,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:53,048 INFO L82 PathProgramCache]: Analyzing trace with hash -886973938, now seen corresponding path program 1 times [2018-10-25 00:07:53,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:53,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:53,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:53,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:53,049 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:53,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:53,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:53,968 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-10-25 00:07:53,969 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], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [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], [324], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [799], [801], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:53,973 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:53,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:54,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:07:54,395 INFO L272 AbstractInterpreter]: Visited 146 different actions 433 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:07:54,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:54,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:07:54,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:54,400 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:07:54,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:54,408 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:07:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:54,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:07:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:07:54,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:07:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:07:54,776 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:54,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2018-10-25 00:07:54,776 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:54,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:07:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:07:54,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:07:54,778 INFO L87 Difference]: Start difference. First operand 5261 states and 6061 transitions. Second operand 3 states. [2018-10-25 00:07:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:55,733 INFO L93 Difference]: Finished difference Result 10844 states and 12721 transitions. [2018-10-25 00:07:55,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:07:55,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-10-25 00:07:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:55,734 INFO L225 Difference]: With dead ends: 10844 [2018-10-25 00:07:55,734 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:07:55,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 447 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:07:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:07:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:07:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:07:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:07:55,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2018-10-25 00:07:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:55,746 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:07:55,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:07:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:07:55,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:07:55,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:07:56,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:56,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:56,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:56,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:56,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:56,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,248 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 192 [2018-10-25 00:07:57,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:57,649 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 197 [2018-10-25 00:07:58,355 WARN L179 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-25 00:07:58,809 WARN L179 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 77 [2018-10-25 00:08:10,376 WARN L179 SmtUtils]: Spent 11.54 s on a formula simplification. DAG size of input: 303 DAG size of output: 109 [2018-10-25 00:08:11,512 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 212 DAG size of output: 104 [2018-10-25 00:08:13,062 WARN L179 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 218 DAG size of output: 109 [2018-10-25 00:08:13,065 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:08:13,065 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-25 00:08:13,065 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:08:13,066 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,066 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,066 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,066 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,066 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,066 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:08:13,066 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:08:13,066 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:08:13,066 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:08:13,067 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:08:13,067 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:08:13,067 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:08:13,067 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:08:13,067 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:08:13,067 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:08:13,067 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:08:13,067 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:08:13,068 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:08:13,068 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,068 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,068 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,068 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,068 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:08:13,068 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,068 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:08:13,068 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:08:13,069 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:08:13,069 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:08:13,069 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:08:13,069 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:08:13,069 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:08:13,069 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:08:13,069 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:08:13,069 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:08:13,070 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:08:13,070 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:08:13,070 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:08:13,070 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:08:13,070 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:08:13,070 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,070 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,070 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,071 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,071 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,071 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:08:13,071 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:08:13,071 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:08:13,071 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:08:13,071 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:08:13,071 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:08:13,072 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:08:13,072 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:08:13,072 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:08:13,072 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:08:13,072 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:08:13,072 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,072 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,072 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,072 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,073 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,073 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:08:13,073 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:08:13,073 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:08:13,073 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:08:13,073 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:08:13,073 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:08:13,073 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:08:13,074 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:08:13,074 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:08:13,074 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 574) no Hoare annotation was computed. [2018-10-25 00:08:13,074 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:08:13,074 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:08:13,074 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:08:13,074 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:08:13,075 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,075 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,075 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,075 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,075 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,075 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:08:13,075 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:08:13,075 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:08:13,076 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:08:13,076 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:08:13,076 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:08:13,076 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:08:13,076 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:08:13,076 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:08:13,076 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:08:13,076 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:08:13,076 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:08:13,077 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:08:13,077 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:08:13,077 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:08:13,077 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:08:13,077 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,077 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,077 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,077 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,078 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:08:13,078 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,078 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:08:13,078 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,078 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:08:13,078 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:08:13,078 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:08:13,078 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,078 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,079 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:08:13,079 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:08:13,079 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:08:13,079 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:08:13,079 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:08:13,079 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:08:13,079 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:08:13,079 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:08:13,079 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:08:13,080 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:08:13,080 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:08:13,080 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,080 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,080 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,080 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,080 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,080 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,081 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:08:13,081 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:08:13,081 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:08:13,081 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:08:13,081 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:08:13,081 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:08:13,081 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:08:13,081 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:08:13,081 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:08:13,082 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:08:13,082 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:08:13,082 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,082 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,082 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,082 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,082 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,082 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,082 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:08:13,083 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:08:13,083 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:08:13,083 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:08:13,083 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:08:13,083 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:08:13,083 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:08:13,083 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:08:13,083 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:08:13,083 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:08:13,084 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:08:13,084 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:08:13,084 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:08:13,084 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:08:13,084 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,084 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,084 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,085 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse24 (not (= 1 |old(~a19~0)|))) (.cse15 (not (= ~v~0 22))) (.cse16 (not (= ~u~0 21))) (.cse17 (not (= ~a21~0 1))) (.cse18 (not (= ~y~0 25))) (.cse19 (= |old(~a28~0)| 0)) (.cse20 (not (= 3 ~c~0))) (.cse21 (= |calculate_output_#in~input| 0)) (.cse22 (not (= ~a~0 1))) (.cse23 (not (= 26 ~z~0))) (.cse25 (not (= ~x~0 24))) (.cse26 (not (= 8 |old(~a17~0)|))) (.cse27 (not (= ~e~0 5))) (.cse28 (not (= ~d~0 4))) (.cse29 (not (= 6 ~f~0))) (.cse30 (not (= ~w~0 23))) (.cse31 (= 1 |old(~a25~0)|)) (.cse9 (= |old(~a28~0)| ~a28~0)) (.cse32 (= |old(~a19~0)| ~a19~0)) (.cse10 (= ~a11~0 |old(~a11~0)|)) (.cse11 (= ~a17~0 8)) (.cse13 (= ~a25~0 |old(~a25~0)|))) (let ((.cse1 (< 9 |old(~a28~0)|)) (.cse6 (< 7 |old(~a28~0)|)) (.cse14 (< 10 |old(~a28~0)|)) (.cse4 (and .cse9 .cse32 .cse10 .cse11 .cse13)) (.cse7 (not .cse31)) (.cse12 (= ~a19~0 1)) (.cse5 (or .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30)) (.cse2 (= |old(~a11~0)| |old(~a19~0)|)) (.cse8 (or (not (= 1 ~a21~0)) .cse24 (= 0 |old(~a28~0)|) .cse26)) (.cse0 (and (<= ~a17~0 |old(~a17~0)|) .cse9 .cse32 .cse10 .cse13)) (.cse3 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5) (or .cse6 .cse7 .cse8 (and .cse9 .cse10 (and .cse11 .cse12) .cse13)) (or .cse14 (or .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse9 .cse10 (and .cse12 .cse11) .cse13) .cse2) (or .cse6 .cse0 .cse3) (or .cse14 .cse7 .cse4 .cse5) (or .cse7 (and .cse10 .cse9 .cse11 .cse12 .cse13) .cse5 .cse2 .cse8) (or .cse0 .cse3 .cse31)))) [2018-10-25 00:08:13,085 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,085 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,085 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,085 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:08:13,085 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:08:13,086 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:08:13,086 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:08:13,086 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:08:13,086 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:08:13,086 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:08:13,086 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:08:13,086 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:08:13,086 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:08:13,086 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:08:13,087 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:08:13,087 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:08:13,087 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,087 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,087 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,087 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,087 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,087 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:08:13,088 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,089 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,090 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:13,090 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:08:13,090 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:08:13,090 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:08:13,090 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:08:13,090 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:08:13,090 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:08:13,090 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:08:13,091 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:08:13,091 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:08:13,091 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:08:13,091 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:08:13,091 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:08:13,091 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:08:13,091 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:08:13,091 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:08:13,091 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:08:13,092 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:08:13,092 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:08:13,092 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:08:13,092 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:08:13,092 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) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-25 00:08:13,092 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:08:13,092 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:08:13,093 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)) (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (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)) (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:08:13,093 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:08:13,093 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse4 (not (= ~a28~0 0))) (.cse5 (= ~a17~0 8)) (.cse12 (= ~a19~0 1)) (.cse7 (= ~a21~0 1))) (let ((.cse6 (<= ~a28~0 9)) (.cse8 (<= ~a28~0 7)) (.cse10 (<= ~a17~0 7)) (.cse1 (<= ~a28~0 10)) (.cse0 (= 1 ~a25~0)) (.cse9 (and .cse4 .cse5 .cse12 .cse7)) (.cse11 (not (= ~a19~0 ~a11~0))) (.cse2 (not (= main_~input~0 0))) (.cse3 (not (= main_~output~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse4 .cse5) (not .cse7) (not (= ~y~0 25)) (and .cse8 .cse0 .cse9) (and (and .cse10 .cse11) .cse6) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and (and (= ~a11~0 0) .cse12 .cse3 .cse5) (= ~a28~0 7) (= ~a25~0 |old(~a25~0)|)) (not (= 21 ~u~0)) (and .cse10 .cse8) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and (and .cse1 .cse9 .cse11) .cse2 .cse3) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse10 (not (= ~a25~0 1)) .cse1) (not (= |old(~a28~0)| 7)) (and (and .cse0 .cse9 .cse11) .cse2 .cse3) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:08:13,093 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:08:13,094 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:08:13,094 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse4 (not (= ~a28~0 0))) (.cse5 (= ~a17~0 8)) (.cse7 (= ~a21~0 1))) (let ((.cse6 (<= ~a28~0 9)) (.cse8 (<= ~a28~0 7)) (.cse10 (<= ~a17~0 7)) (.cse1 (<= ~a28~0 10)) (.cse0 (= 1 ~a25~0)) (.cse9 (and .cse4 .cse5 (= ~a19~0 1) .cse7)) (.cse11 (not (= ~a19~0 ~a11~0))) (.cse2 (not (= main_~input~0 0))) (.cse3 (not (= main_~output~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse4 .cse5) (not .cse7) (not (= ~y~0 25)) (and .cse8 .cse0 .cse9) (and (and .cse10 .cse11) .cse6) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and .cse10 .cse8) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and (and .cse1 .cse9 .cse11) .cse2 .cse3) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse10 (not (= ~a25~0 1)) .cse1) (not (= |old(~a28~0)| 7)) (and (and .cse0 .cse9 .cse11) .cse2 .cse3) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:08:13,094 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:08:13,094 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:08:13,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:08:13 BoogieIcfgContainer [2018-10-25 00:08:13,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:08:13,115 INFO L168 Benchmark]: Toolchain (without parser) took 121121.40 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-25 00:08:13,116 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:08:13,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.83 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:08:13,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:08:13,118 INFO L168 Benchmark]: Boogie Preprocessor took 100.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-10-25 00:08:13,119 INFO L168 Benchmark]: RCFGBuilder took 3630.60 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.7 MB). Peak memory consumption was 118.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:08:13,119 INFO L168 Benchmark]: TraceAbstraction took 116481.06 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-25 00:08:13,124 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.83 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 174.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3630.60 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.7 MB). Peak memory consumption was 118.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 116481.06 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 574]: 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: (((((((((((((((((((((((((((((1 == a25 && a28 <= 10) && !(input == 0)) && !(output == 0)) && !(a28 == 0)) && a17 == 8) || ((((a28 <= 9 && !(input == 0)) && !(output == 0)) && !(a28 == 0)) && a17 == 8)) || !(a21 == 1)) || !(y == 25)) || ((a28 <= 7 && 1 == a25) && ((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1)) || ((a17 <= 7 && !(a19 == a11)) && a28 <= 9)) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || (((((a11 == 0 && a19 == 1) && !(output == 0)) && a17 == 8) && a28 == 7) && a25 == \old(a25))) || !(21 == u)) || (a17 <= 7 && a28 <= 7)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || ((((a28 <= 10 && ((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1) && !(a19 == a11)) && !(input == 0)) && !(output == 0))) || !(3 == c)) || !(23 == w)) || ((a17 <= 7 && !(a25 == 1)) && a28 <= 10)) || !(\old(a28) == 7)) || ((((1 == a25 && ((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1) && !(a19 == a11)) && !(input == 0)) && !(output == 0))) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 116.3s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 64.7s AutomataDifference, 0.0s DeadEndRemovalTime, 17.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1592 SDtfs, 7804 SDslu, 1774 SDs, 0 SdLazy, 15519 SolverSat, 1810 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.3s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2498 GetRequests, 1900 SyntacticMatches, 468 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3041 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6417occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.9s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.9968626466533934 AbsIntWeakeningRatio, 0.20553359683794467 AbsIntAvgWeakeningVarsNumRemoved, 6.353096179183136 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 716 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 239 PreInvPairs, 361 NumberOfFragments, 1092 HoareAnnotationTreeSize, 239 FomulaSimplifications, 40948 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 49331 FormulaSimplificationTreeSizeReductionInter, 15.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2843 NumberOfCodeBlocks, 2843 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3633 ConstructedInterpolants, 0 QuantifiedInterpolants, 1617187 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1874 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 1114/1228 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...