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_label17_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:05:29,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:05:29,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:05:29,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:05:29,909 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:05:29,910 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:05:29,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:05:29,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:05:29,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:05:29,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:05:29,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:05:29,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:05:29,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:05:29,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:05:29,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:05:29,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:05:29,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:05:29,936 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:05:29,941 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:05:29,942 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:05:29,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:05:29,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:05:29,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:05:29,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:05:29,950 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:05:29,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:05:29,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:05:29,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:05:29,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:05:29,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:05:29,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:05:29,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:05:29,959 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:05:29,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:05:29,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:05:29,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:05:29,961 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:05:29,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:05:29,988 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:05:29,989 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:05:29,989 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:05:29,990 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:05:29,990 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:05:29,990 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:05:29,990 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:05:29,991 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:05:29,991 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:05:29,991 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:05:29,991 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:05:29,991 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:05:29,991 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:05:29,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:05:29,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:05:29,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:05:29,994 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:05:29,994 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:05:29,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:05:29,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:05:29,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:05:29,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:05:29,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:05:29,995 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:05:29,995 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:05:29,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:05:29,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:05:29,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:05:29,996 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:05:29,996 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:05:29,996 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:05:29,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:05:29,997 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:05:29,997 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:05:29,997 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:05:30,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:05:30,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:05:30,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:05:30,078 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:05:30,079 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:05:30,081 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label17_true-unreach-call_false-termination.c [2018-10-25 00:05:30,159 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1922ebd68/09f17646b4a740ae93afdbee538d9703/FLAGf84a95031 [2018-10-25 00:05:30,759 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:05:30,760 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label17_true-unreach-call_false-termination.c [2018-10-25 00:05:30,780 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1922ebd68/09f17646b4a740ae93afdbee538d9703/FLAGf84a95031 [2018-10-25 00:05:30,805 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1922ebd68/09f17646b4a740ae93afdbee538d9703 [2018-10-25 00:05:30,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:05:30,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:05:30,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:05:30,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:05:30,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:05:30,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:05:30" (1/1) ... [2018-10-25 00:05:30,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2e66ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:30, skipping insertion in model container [2018-10-25 00:05:30,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:05:30" (1/1) ... [2018-10-25 00:05:30,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:05:30,927 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:05:31,342 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:05:31,352 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:05:31,497 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:05:31,516 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:05:31,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31 WrapperNode [2018-10-25 00:05:31,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:05:31,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:05:31,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:05:31,518 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:05:31,529 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:05:31" (1/1) ... [2018-10-25 00:05:31,557 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:05:31" (1/1) ... [2018-10-25 00:05:31,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:05:31,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:05:31,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:05:31,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:05:31,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31" (1/1) ... [2018-10-25 00:05:31,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31" (1/1) ... [2018-10-25 00:05:31,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31" (1/1) ... [2018-10-25 00:05:31,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31" (1/1) ... [2018-10-25 00:05:31,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31" (1/1) ... [2018-10-25 00:05:31,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31" (1/1) ... [2018-10-25 00:05:31,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31" (1/1) ... [2018-10-25 00:05:31,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:05:31,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:05:31,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:05:31,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:05:31,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31" (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:05:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:05:31,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:05:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:05:31,884 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:05:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:05:31,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:05:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:05:31,884 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:05:35,171 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:05:35,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:05:35 BoogieIcfgContainer [2018-10-25 00:05:35,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:05:35,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:05:35,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:05:35,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:05:35,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:05:30" (1/3) ... [2018-10-25 00:05:35,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd63f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:05:35, skipping insertion in model container [2018-10-25 00:05:35,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:31" (2/3) ... [2018-10-25 00:05:35,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd63f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:05:35, skipping insertion in model container [2018-10-25 00:05:35,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:05:35" (3/3) ... [2018-10-25 00:05:35,181 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label17_true-unreach-call_false-termination.c [2018-10-25 00:05:35,192 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:05:35,204 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:05:35,222 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:05:35,261 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:05:35,261 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:05:35,261 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:05:35,261 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:05:35,262 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:05:35,262 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:05:35,262 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:05:35,262 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:05:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:05:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-25 00:05:35,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:35,305 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] [2018-10-25 00:05:35,307 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:35,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:35,314 INFO L82 PathProgramCache]: Analyzing trace with hash -346865840, now seen corresponding path program 1 times [2018-10-25 00:05:35,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:35,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:35,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:35,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:36,058 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:05:36,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:36,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:05:36,061 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:36,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:05:36,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:05:36,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:05:36,091 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:05:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:37,828 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-10-25 00:05:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:05:37,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-25 00:05:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:37,862 INFO L225 Difference]: With dead ends: 618 [2018-10-25 00:05:37,862 INFO L226 Difference]: Without dead ends: 379 [2018-10-25 00:05:37,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:05:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-25 00:05:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-25 00:05:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-25 00:05:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-10-25 00:05:37,960 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 126 [2018-10-25 00:05:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:37,961 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-10-25 00:05:37,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:05:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-10-25 00:05:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-25 00:05:37,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:37,969 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] [2018-10-25 00:05:37,969 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:37,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash -837125915, now seen corresponding path program 1 times [2018-10-25 00:05:37,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:37,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:37,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:38,204 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:05:38,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:38,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:05:38,204 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:38,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:05:38,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:05:38,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:05:38,207 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-10-25 00:05:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:40,586 INFO L93 Difference]: Finished difference Result 1229 states and 2094 transitions. [2018-10-25 00:05:40,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:05:40,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-10-25 00:05:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:40,607 INFO L225 Difference]: With dead ends: 1229 [2018-10-25 00:05:40,607 INFO L226 Difference]: Without dead ends: 856 [2018-10-25 00:05:40,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:05:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-25 00:05:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2018-10-25 00:05:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-25 00:05:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1292 transitions. [2018-10-25 00:05:40,689 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1292 transitions. Word has length 142 [2018-10-25 00:05:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:40,689 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 1292 transitions. [2018-10-25 00:05:40,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:05:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1292 transitions. [2018-10-25 00:05:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-25 00:05:40,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:40,696 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] [2018-10-25 00:05:40,696 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:40,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -517700326, now seen corresponding path program 1 times [2018-10-25 00:05:40,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:40,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:40,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:40,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:40,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:40,996 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:05:41,314 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:05:41,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:41,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:05:41,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:41,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:05:41,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:05:41,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:05:41,317 INFO L87 Difference]: Start difference. First operand 823 states and 1292 transitions. Second operand 6 states. [2018-10-25 00:05:45,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:45,299 INFO L93 Difference]: Finished difference Result 2557 states and 4222 transitions. [2018-10-25 00:05:45,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:05:45,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-25 00:05:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:45,319 INFO L225 Difference]: With dead ends: 2557 [2018-10-25 00:05:45,319 INFO L226 Difference]: Without dead ends: 1740 [2018-10-25 00:05:45,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:05:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2018-10-25 00:05:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1682. [2018-10-25 00:05:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-10-25 00:05:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2540 transitions. [2018-10-25 00:05:45,419 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2540 transitions. Word has length 149 [2018-10-25 00:05:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:45,420 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 2540 transitions. [2018-10-25 00:05:45,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:05:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2540 transitions. [2018-10-25 00:05:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-25 00:05:45,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:45,429 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] [2018-10-25 00:05:45,429 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:45,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1972736718, now seen corresponding path program 1 times [2018-10-25 00:05:45,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:45,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:45,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:45,696 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:05:46,102 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:05:46,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:46,102 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:46,103 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-10-25 00:05:46,107 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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:05:46,183 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:46,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:46,856 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:46,857 INFO L272 AbstractInterpreter]: Visited 127 different actions 127 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-25 00:05:46,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:46,892 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:47,300 INFO L232 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 81.13% of their original sizes. [2018-10-25 00:05:47,301 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:47,468 INFO L413 sIntCurrentIteration]: We have 150 unified AI predicates [2018-10-25 00:05:47,469 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:47,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:47,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:05:47,470 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:47,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:05:47,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:05:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:05:47,471 INFO L87 Difference]: Start difference. First operand 1682 states and 2540 transitions. Second operand 6 states. [2018-10-25 00:05:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:58,786 INFO L93 Difference]: Finished difference Result 3506 states and 5281 transitions. [2018-10-25 00:05:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:05:58,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-10-25 00:05:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:58,796 INFO L225 Difference]: With dead ends: 3506 [2018-10-25 00:05:58,797 INFO L226 Difference]: Without dead ends: 1830 [2018-10-25 00:05:58,803 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 146 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:05:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-10-25 00:05:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1827. [2018-10-25 00:05:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-10-25 00:05:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2692 transitions. [2018-10-25 00:05:58,862 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2692 transitions. Word has length 151 [2018-10-25 00:05:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:58,863 INFO L481 AbstractCegarLoop]: Abstraction has 1827 states and 2692 transitions. [2018-10-25 00:05:58,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:05:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2692 transitions. [2018-10-25 00:05:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-25 00:05:58,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:58,871 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] [2018-10-25 00:05:58,871 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:58,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:58,872 INFO L82 PathProgramCache]: Analyzing trace with hash -336940495, now seen corresponding path program 1 times [2018-10-25 00:05:58,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:58,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:58,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:58,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:58,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:59,210 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:05:59,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:59,210 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:59,211 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-10-25 00:05:59,211 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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:05:59,217 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:59,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:59,883 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:59,883 INFO L272 AbstractInterpreter]: Visited 131 different actions 390 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:05:59,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:59,896 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:06:01,240 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 81.94% of their original sizes. [2018-10-25 00:06:01,240 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:06:06,434 INFO L413 sIntCurrentIteration]: We have 160 unified AI predicates [2018-10-25 00:06:06,434 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:06:06,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:06:06,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-10-25 00:06:06,435 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:06,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:06:06,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:06:06,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:06:06,436 INFO L87 Difference]: Start difference. First operand 1827 states and 2692 transitions. Second operand 12 states. [2018-10-25 00:06:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:22,814 INFO L93 Difference]: Finished difference Result 5086 states and 7444 transitions. [2018-10-25 00:06:22,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:06:22,815 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 161 [2018-10-25 00:06:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:22,833 INFO L225 Difference]: With dead ends: 5086 [2018-10-25 00:06:22,833 INFO L226 Difference]: Without dead ends: 3265 [2018-10-25 00:06:22,842 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 27 SyntacticMatches, 123 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:06:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2018-10-25 00:06:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3069. [2018-10-25 00:06:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3069 states. [2018-10-25 00:06:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 4237 transitions. [2018-10-25 00:06:22,947 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 4237 transitions. Word has length 161 [2018-10-25 00:06:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:22,948 INFO L481 AbstractCegarLoop]: Abstraction has 3069 states and 4237 transitions. [2018-10-25 00:06:22,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:06:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4237 transitions. [2018-10-25 00:06:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-25 00:06:22,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:22,959 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] [2018-10-25 00:06:22,959 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:22,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1986244073, now seen corresponding path program 1 times [2018-10-25 00:06:22,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:22,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:22,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:22,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:22,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:23,213 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:06:23,299 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:23,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:23,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:23,299 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-10-25 00:06:23,300 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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:23,305 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:23,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:24,055 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:06:24,056 INFO L272 AbstractInterpreter]: Visited 130 different actions 387 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:24,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:24,066 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:06:24,898 INFO L232 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 83.33% of their original sizes. [2018-10-25 00:06:24,898 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:06:28,544 INFO L413 sIntCurrentIteration]: We have 171 unified AI predicates [2018-10-25 00:06:28,544 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:06:28,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:06:28,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-25 00:06:28,544 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:28,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:06:28,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:06:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:06:28,546 INFO L87 Difference]: Start difference. First operand 3069 states and 4237 transitions. Second operand 11 states. [2018-10-25 00:06:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:44,220 INFO L93 Difference]: Finished difference Result 7286 states and 10443 transitions. [2018-10-25 00:06:44,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:06:44,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 172 [2018-10-25 00:06:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:44,244 INFO L225 Difference]: With dead ends: 7286 [2018-10-25 00:06:44,244 INFO L226 Difference]: Without dead ends: 4854 [2018-10-25 00:06:44,256 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 24 SyntacticMatches, 138 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:06:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4854 states. [2018-10-25 00:06:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4854 to 4675. [2018-10-25 00:06:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4675 states. [2018-10-25 00:06:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 6285 transitions. [2018-10-25 00:06:44,395 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 6285 transitions. Word has length 172 [2018-10-25 00:06:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:44,395 INFO L481 AbstractCegarLoop]: Abstraction has 4675 states and 6285 transitions. [2018-10-25 00:06:44,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:06:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 6285 transitions. [2018-10-25 00:06:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-25 00:06:44,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:44,414 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:06:44,414 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:44,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1746497625, now seen corresponding path program 1 times [2018-10-25 00:06:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:44,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:44,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:06:44,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:44,573 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:44,573 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-10-25 00:06:44,574 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [107], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:44,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:44,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:45,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:45,064 INFO L272 AbstractInterpreter]: Visited 132 different actions 393 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:06:45,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:45,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:45,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:45,093 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:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:45,104 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:45,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:06:45,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:06:46,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:46,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 00:06:46,418 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:46,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:06:46,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:06:46,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:06:46,419 INFO L87 Difference]: Start difference. First operand 4675 states and 6285 transitions. Second operand 9 states. [2018-10-25 00:06:46,926 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:06:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:51,435 INFO L93 Difference]: Finished difference Result 9745 states and 13601 transitions. [2018-10-25 00:06:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:06:51,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 194 [2018-10-25 00:06:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:51,447 INFO L225 Difference]: With dead ends: 9745 [2018-10-25 00:06:51,448 INFO L226 Difference]: Without dead ends: 2671 [2018-10-25 00:06:51,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 396 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-10-25 00:06:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2018-10-25 00:06:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2472. [2018-10-25 00:06:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-10-25 00:06:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 2948 transitions. [2018-10-25 00:06:51,554 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 2948 transitions. Word has length 194 [2018-10-25 00:06:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:51,555 INFO L481 AbstractCegarLoop]: Abstraction has 2472 states and 2948 transitions. [2018-10-25 00:06:51,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:06:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 2948 transitions. [2018-10-25 00:06:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-25 00:06:51,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:51,562 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:06:51,562 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:51,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:51,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1370992587, now seen corresponding path program 1 times [2018-10-25 00:06:51,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:51,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:51,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:51,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:51,564 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 79 proven. 48 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:06:52,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:52,121 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:52,121 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-10-25 00:06:52,122 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], [107], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:52,125 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:52,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:53,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:53,111 INFO L272 AbstractInterpreter]: Visited 132 different actions 525 times. Merged at 8 different actions 33 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:06:53,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:53,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:53,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:53,148 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:06:53,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:53,169 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:53,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-25 00:06:53,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 90 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-25 00:06:53,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:53,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2018-10-25 00:06:53,802 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:53,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:06:53,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:06:53,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:06:53,804 INFO L87 Difference]: Start difference. First operand 2472 states and 2948 transitions. Second operand 13 states. [2018-10-25 00:06:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:56,021 INFO L93 Difference]: Finished difference Result 4447 states and 5502 transitions. [2018-10-25 00:06:56,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-25 00:06:56,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 208 [2018-10-25 00:06:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:56,032 INFO L225 Difference]: With dead ends: 4447 [2018-10-25 00:06:56,032 INFO L226 Difference]: Without dead ends: 2290 [2018-10-25 00:06:56,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 432 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=409, Invalid=1073, Unknown=0, NotChecked=0, Total=1482 [2018-10-25 00:06:56,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2018-10-25 00:06:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2214. [2018-10-25 00:06:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2018-10-25 00:06:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2621 transitions. [2018-10-25 00:06:56,102 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2621 transitions. Word has length 208 [2018-10-25 00:06:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:56,103 INFO L481 AbstractCegarLoop]: Abstraction has 2214 states and 2621 transitions. [2018-10-25 00:06:56,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:06:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2621 transitions. [2018-10-25 00:06:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-25 00:06:56,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:56,111 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] [2018-10-25 00:06:56,111 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:56,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:56,111 INFO L82 PathProgramCache]: Analyzing trace with hash 248413529, now seen corresponding path program 1 times [2018-10-25 00:06:56,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:56,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:56,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:56,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:56,113 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:57,298 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:06:57,563 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:06:57,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:57,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:57,564 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-10-25 00:06:57,564 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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:57,567 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:57,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:58,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:58,118 INFO L272 AbstractInterpreter]: Visited 131 different actions 388 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,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:58,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:58,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:58,153 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:06:58,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:58,171 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:58,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:58,407 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:06:58,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:58,504 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:06:58,525 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:06:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 12 [2018-10-25 00:06:58,526 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:58,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:06:58,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:06:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:06:58,527 INFO L87 Difference]: Start difference. First operand 2214 states and 2621 transitions. Second operand 3 states. [2018-10-25 00:06:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:59,653 INFO L93 Difference]: Finished difference Result 4555 states and 5531 transitions. [2018-10-25 00:06:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:06:59,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-10-25 00:06:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:59,654 INFO L225 Difference]: With dead ends: 4555 [2018-10-25 00:06:59,654 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:06:59,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:06:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:06:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:06:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:06:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:06:59,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 209 [2018-10-25 00:06:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:59,666 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:06:59,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:06:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:06:59,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:06:59,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:07:00,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:00,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:00,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:00,231 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 155 [2018-10-25 00:07:00,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:00,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:00,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:00,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:00,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:07:00,443 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 157 [2018-10-25 00:07:01,455 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-25 00:07:03,516 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 136 DAG size of output: 77 [2018-10-25 00:07:07,740 WARN L179 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 262 DAG size of output: 72 [2018-10-25 00:07:08,482 WARN L179 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 99 [2018-10-25 00:07:09,041 WARN L179 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 99 [2018-10-25 00:07:09,046 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:07:09,046 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-10-25 00:07:09,046 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:07:09,047 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,047 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,047 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,047 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,047 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,047 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:07:09,047 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:07:09,047 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:07:09,047 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:07:09,048 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:07:09,048 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:07:09,048 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:07:09,048 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:07:09,048 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:07:09,048 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:07:09,048 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:07:09,048 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:07:09,048 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:07:09,049 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,049 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,049 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,049 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,049 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:07:09,049 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,049 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:07:09,049 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:07:09,050 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:07:09,050 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:07:09,050 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:07:09,050 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:07:09,050 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:07:09,050 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:07:09,050 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:07:09,050 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:07:09,050 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:07:09,051 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:07:09,051 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:07:09,051 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:07:09,051 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:07:09,051 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,051 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,051 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,051 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,051 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,052 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:07:09,052 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:07:09,052 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:07:09,052 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:07:09,052 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:07:09,052 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:07:09,052 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:07:09,052 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:07:09,052 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:07:09,053 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:07:09,053 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:07:09,053 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,053 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,053 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,053 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,053 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,053 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:07:09,054 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:07:09,054 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:07:09,054 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:07:09,054 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:07:09,054 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:07:09,054 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:07:09,054 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:07:09,054 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:07:09,054 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:07:09,055 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:07:09,056 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:07:09,057 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,058 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:07:09,058 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,058 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:07:09,058 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:07:09,058 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:07:09,058 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,058 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,058 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:07:09,059 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:07:09,059 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:07:09,059 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:07:09,059 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:07:09,059 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:07:09,059 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:07:09,059 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:07:09,059 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:07:09,059 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:07:09,060 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:07:09,061 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:07:09,061 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:07:09,061 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:07:09,061 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:07:09,061 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 529) no Hoare annotation was computed. [2018-10-25 00:07:09,061 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:07:09,061 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:07:09,061 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:07:09,062 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:07:09,062 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,062 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,062 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,062 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,062 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,062 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,062 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:07:09,063 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:07:09,064 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,064 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,064 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,064 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse7 (= |old(~a19~0)| ~a19~0)) (.cse13 (= 1 ~a11~0)) (.cse9 (= |old(~a17~0)| ~a17~0)) (.cse10 (= |old(~a25~0)| ~a25~0)) (.cse11 (= ~a28~0 |old(~a28~0)|)) (.cse5 (= 1 |old(~a11~0)|)) (.cse15 (not (= 1 ~a21~0))) (.cse16 (not (= 1 |old(~a19~0)|))) (.cse17 (= 0 |old(~a28~0)|))) (let ((.cse2 (= |old(~a11~0)| |old(~a19~0)|)) (.cse14 (and (not (= ~a28~0 0)) (= ~a19~0 1) (= ~a21~0 1) (not (= ~a17~0 0)))) (.cse19 (= 1 |old(~a25~0)|)) (.cse8 (= ~a11~0 |old(~a11~0)|)) (.cse18 (<= ~a17~0 |old(~a17~0)|)) (.cse20 (or .cse15 (= 0 |old(~a17~0)|) .cse16 .cse17)) (.cse4 (< 7 |old(~a17~0)|)) (.cse6 (= 7 |old(~a17~0)|)) (.cse3 (not .cse5)) (.cse1 (= 8 |old(~a28~0)|)) (.cse12 (< 8 |old(~a17~0)|)) (.cse0 (and .cse7 .cse13 .cse9 .cse10 .cse11))) (and (or (< 9 |old(~a28~0)|) .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (or (and .cse13 .cse10 (= ~a17~0 8) .cse14) (or .cse15 .cse16 .cse17 (not (= 8 |old(~a17~0)|))) .cse3) (or .cse18 .cse4 .cse19) (or (and .cse18 .cse7 (not (= ~a17~0 7)) .cse13 .cse10) .cse6 .cse2 .cse3) (or .cse20 (and .cse8 .cse10 .cse14) .cse4) (or .cse4 .cse19 (and .cse7 .cse8 .cse10)) (or .cse18 .cse20 .cse4) (or (or .cse6 .cse3) .cse1 .cse12 .cse0)))) [2018-10-25 00:07:09,064 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,064 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,065 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,065 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:07:09,065 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:07:09,065 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:07:09,065 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:07:09,065 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:07:09,065 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:07:09,065 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:07:09,065 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:07:09,066 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:07:09,066 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:07:09,066 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:07:09,066 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:07:09,066 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:07:09,066 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,066 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,066 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,067 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,067 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,067 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,067 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:07:09,067 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:07:09,067 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:07:09,067 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:07:09,067 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:07:09,067 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:07:09,068 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:07:09,069 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,069 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,069 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,069 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,069 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:09,069 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:07:09,069 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:07:09,069 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:07:09,069 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:07:09,070 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:07:09,071 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:07:09,071 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:07:09,071 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:07:09,071 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:07:09,071 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:07:09,071 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:07:09,071 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:07:09,072 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:07:09,072 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:07:09,072 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a25~0 0) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 8)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (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:07:09,072 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:07:09,072 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse2 (not (= ~a19~0 ~a11~0))) (.cse1 (= 1 ~a11~0)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse3 (<= ~a17~0 7))) (or (and (= ~a11~0 |old(~a11~0)|) .cse0) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and (<= ~a17~0 |old(~a17~0)|) (not (= ~a17~0 7)) .cse1 .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse3 (and (not (= ~a28~0 0)) (= ~a19~0 1) (not (= ~a17~0 0)))) (and .cse1 (not (= ~a28~0 8)) .cse2 (<= ~a17~0 8) (<= ~a28~0 9)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse1 .cse0) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse3 (not (= ~a25~0 1))) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:07:09,072 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:07:09,072 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:07:09,073 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse2 (not (= ~a19~0 ~a11~0))) (.cse1 (= 1 ~a11~0)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse3 (<= ~a17~0 7))) (or (and (= ~a11~0 |old(~a11~0)|) .cse0) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and (<= ~a17~0 |old(~a17~0)|) (not (= ~a17~0 7)) .cse1 .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse3 (and (not (= ~a28~0 0)) (= ~a19~0 1) (not (= ~a17~0 0)))) (and .cse1 (not (= ~a28~0 8)) .cse2 (<= ~a17~0 8) (<= ~a28~0 9)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse1 .cse0) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse3 (not (= ~a25~0 1))) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:07:09,073 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:07:09,073 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:07:09,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:07:09 BoogieIcfgContainer [2018-10-25 00:07:09,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:07:09,089 INFO L168 Benchmark]: Toolchain (without parser) took 98268.49 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-25 00:07:09,090 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:07:09,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.12 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:07:09,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 194.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:07:09,092 INFO L168 Benchmark]: Boogie Preprocessor took 95.88 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:07:09,093 INFO L168 Benchmark]: RCFGBuilder took 3363.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:07:09,093 INFO L168 Benchmark]: TraceAbstraction took 93914.24 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -638.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-25 00:07:09,098 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.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 695.12 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 194.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.88 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3363.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93914.24 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -638.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 529]: 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: ((((((((((((((((((((((a11 == \old(a11) && \old(a17) == a17) || !(a21 == 1)) || !(y == 25)) || (((a17 <= \old(a17) && !(a17 == 7)) && 1 == a11) && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || (a17 <= 7 && (!(a28 == 0) && a19 == 1) && !(a17 == 0))) || ((((1 == a11 && !(a28 == 8)) && !(a19 == a11)) && a17 <= 8) && a28 <= 9)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || (1 == a11 && \old(a17) == a17)) || !(z == 26)) || !(0 == \old(a25))) || (a17 <= 7 && !(a25 == 1))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 93.8s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 60.0s AutomataDifference, 0.0s DeadEndRemovalTime, 9.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1252 SDtfs, 8220 SDslu, 1327 SDs, 0 SdLazy, 13857 SolverSat, 2139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.3s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1835 GetRequests, 1449 SyntacticMatches, 268 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4675occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.3s AbstIntTime, 6 AbstIntIterations, 3 AbstIntStrong, 0.9970702187713325 AbsIntWeakeningRatio, 0.2182952182952183 AbsIntAvgWeakeningVarsNumRemoved, 9.087318087318087 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 744 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 121 PreInvPairs, 185 NumberOfFragments, 697 HoareAnnotationTreeSize, 121 FomulaSimplifications, 15219 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 13571 FormulaSimplificationTreeSizeReductionInter, 8.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2123 NumberOfCodeBlocks, 2123 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2719 ConstructedInterpolants, 0 QuantifiedInterpolants, 1213543 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1468 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 1036/1152 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...