java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label30_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:13:57,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:13:57,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:13:57,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:13:57,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:13:57,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:13:57,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:13:57,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:13:57,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:13:57,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:13:57,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:13:57,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:13:57,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:13:57,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:13:57,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:13:57,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:13:57,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:13:57,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:13:57,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:13:57,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:13:57,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:13:57,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:13:57,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:13:57,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:13:57,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:13:57,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:13:57,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:13:57,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:13:57,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:13:57,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:13:57,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:13:57,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:13:57,200 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:13:57,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:13:57,201 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:13:57,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:13:57,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:13:57,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:13:57,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:13:57,234 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:13:57,235 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:13:57,235 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:13:57,235 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:13:57,235 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:13:57,236 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:13:57,236 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:13:57,236 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:13:57,236 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:13:57,236 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:13:57,236 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:13:57,238 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:13:57,238 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:13:57,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:13:57,238 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:13:57,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:13:57,239 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:13:57,239 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:13:57,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:13:57,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:13:57,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:13:57,241 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:13:57,241 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:13:57,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:13:57,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:13:57,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:13:57,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:13:57,242 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:13:57,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:13:57,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:13:57,243 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:13:57,243 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:13:57,243 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:13:57,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:13:57,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:13:57,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:13:57,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:13:57,323 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:13:57,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label30_true-unreach-call_false-termination.c [2018-11-12 17:13:57,392 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d34bced/52544ee5aaf6421bbf974c7e0479d449/FLAGdbeedc164 [2018-11-12 17:13:57,982 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:13:57,983 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label30_true-unreach-call_false-termination.c [2018-11-12 17:13:57,998 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d34bced/52544ee5aaf6421bbf974c7e0479d449/FLAGdbeedc164 [2018-11-12 17:13:58,020 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d34bced/52544ee5aaf6421bbf974c7e0479d449 [2018-11-12 17:13:58,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:13:58,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:13:58,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:13:58,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:13:58,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:13:58,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:58,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665e3473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58, skipping insertion in model container [2018-11-12 17:13:58,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:58,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:13:58,123 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:13:58,658 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:13:58,663 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:13:58,805 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:13:58,825 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:13:58,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58 WrapperNode [2018-11-12 17:13:58,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:13:58,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:13:58,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:13:58,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:13:58,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:58,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:58,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:13:58,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:13:58,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:13:58,960 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:13:58,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:58,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:58,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:58,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:59,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:59,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:59,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... [2018-11-12 17:13:59,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:13:59,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:13:59,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:13:59,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:13:59,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:13:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:13:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:13:59,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:13:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:13:59,136 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:13:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:13:59,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:13:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:13:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:14:02,721 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:14:02,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:14:02 BoogieIcfgContainer [2018-11-12 17:14:02,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:14:02,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:14:02,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:14:02,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:14:02,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:13:58" (1/3) ... [2018-11-12 17:14:02,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62572693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:14:02, skipping insertion in model container [2018-11-12 17:14:02,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:58" (2/3) ... [2018-11-12 17:14:02,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62572693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:14:02, skipping insertion in model container [2018-11-12 17:14:02,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:14:02" (3/3) ... [2018-11-12 17:14:02,735 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label30_true-unreach-call_false-termination.c [2018-11-12 17:14:02,746 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:14:02,757 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:14:02,776 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:14:02,815 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:14:02,815 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:14:02,815 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:14:02,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:14:02,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:14:02,816 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:14:02,816 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:14:02,816 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:14:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:14:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-12 17:14:02,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:02,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:02,875 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:02,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:02,880 INFO L82 PathProgramCache]: Analyzing trace with hash -564012609, now seen corresponding path program 1 times [2018-11-12 17:14:02,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:02,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:02,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:02,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:02,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:03,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:03,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:14:03,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:03,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:14:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:14:03,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:14:03,612 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:14:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:05,187 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-12 17:14:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:14:05,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2018-11-12 17:14:05,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:05,211 INFO L225 Difference]: With dead ends: 618 [2018-11-12 17:14:05,211 INFO L226 Difference]: Without dead ends: 379 [2018-11-12 17:14:05,218 INFO L604 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-11-12 17:14:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-12 17:14:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-12 17:14:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-12 17:14:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-12 17:14:05,300 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 135 [2018-11-12 17:14:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:05,302 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-12 17:14:05,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:14:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-12 17:14:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-12 17:14:05,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:05,310 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:05,310 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:05,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:05,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1268148278, now seen corresponding path program 1 times [2018-11-12 17:14:05,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:05,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:05,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:05,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:05,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:05,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:05,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:14:05,544 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:05,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:14:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:14:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:14:05,547 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-12 17:14:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:07,957 INFO L93 Difference]: Finished difference Result 1231 states and 2094 transitions. [2018-11-12 17:14:07,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:14:07,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-11-12 17:14:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:07,972 INFO L225 Difference]: With dead ends: 1231 [2018-11-12 17:14:07,972 INFO L226 Difference]: Without dead ends: 858 [2018-11-12 17:14:07,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:14:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-12 17:14:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 821. [2018-11-12 17:14:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-11-12 17:14:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1290 transitions. [2018-11-12 17:14:08,055 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1290 transitions. Word has length 151 [2018-11-12 17:14:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:08,055 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1290 transitions. [2018-11-12 17:14:08,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:14:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1290 transitions. [2018-11-12 17:14:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-12 17:14:08,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:08,062 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:08,063 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:08,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:08,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1898018613, now seen corresponding path program 1 times [2018-11-12 17:14:08,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:08,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:08,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:08,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:08,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:08,366 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:14:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:08,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:08,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:14:08,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:08,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:14:08,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:14:08,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:14:08,571 INFO L87 Difference]: Start difference. First operand 821 states and 1290 transitions. Second operand 6 states. [2018-11-12 17:14:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:11,868 INFO L93 Difference]: Finished difference Result 2553 states and 4218 transitions. [2018-11-12 17:14:11,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:14:11,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-11-12 17:14:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:11,893 INFO L225 Difference]: With dead ends: 2553 [2018-11-12 17:14:11,893 INFO L226 Difference]: Without dead ends: 1738 [2018-11-12 17:14:11,901 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:14:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-12 17:14:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1680. [2018-11-12 17:14:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-11-12 17:14:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2538 transitions. [2018-11-12 17:14:11,992 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2538 transitions. Word has length 158 [2018-11-12 17:14:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:11,993 INFO L480 AbstractCegarLoop]: Abstraction has 1680 states and 2538 transitions. [2018-11-12 17:14:11,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:14:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2538 transitions. [2018-11-12 17:14:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-12 17:14:12,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:12,001 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:12,002 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:12,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash -622646755, now seen corresponding path program 1 times [2018-11-12 17:14:12,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:12,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:12,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:12,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:12,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:12,242 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:14:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 17:14:12,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:12,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:12,323 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-11-12 17:14:12,325 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:12,383 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:12,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:13,308 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:14:13,310 INFO L272 AbstractInterpreter]: Visited 136 different actions 136 times. Never merged. Never widened. Performed 1910 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1910 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 38 variables. [2018-11-12 17:14:13,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:13,355 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:14,033 INFO L227 lantSequenceWeakener]: Weakened 138 states. On average, predicates are now at 81.51% of their original sizes. [2018-11-12 17:14:14,034 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:15,288 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-11-12 17:14:15,289 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:15,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:15,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-12 17:14:15,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:15,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:14:15,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:14:15,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-12 17:14:15,292 INFO L87 Difference]: Start difference. First operand 1680 states and 2538 transitions. Second operand 14 states. [2018-11-12 17:14:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:29,382 INFO L93 Difference]: Finished difference Result 3652 states and 5496 transitions. [2018-11-12 17:14:29,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:14:29,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 160 [2018-11-12 17:14:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:29,393 INFO L225 Difference]: With dead ends: 3652 [2018-11-12 17:14:29,394 INFO L226 Difference]: Without dead ends: 1978 [2018-11-12 17:14:29,400 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:14:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2018-11-12 17:14:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1825. [2018-11-12 17:14:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-11-12 17:14:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2690 transitions. [2018-11-12 17:14:29,454 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2690 transitions. Word has length 160 [2018-11-12 17:14:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:29,455 INFO L480 AbstractCegarLoop]: Abstraction has 1825 states and 2690 transitions. [2018-11-12 17:14:29,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:14:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2690 transitions. [2018-11-12 17:14:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-12 17:14:29,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:29,464 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:29,464 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:29,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:29,465 INFO L82 PathProgramCache]: Analyzing trace with hash 9901054, now seen corresponding path program 1 times [2018-11-12 17:14:29,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:29,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:29,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:14:29,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:29,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:29,739 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-11-12 17:14:29,739 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:29,745 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:29,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:30,738 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:14:30,739 INFO L272 AbstractInterpreter]: Visited 140 different actions 419 times. Merged at 7 different actions 21 times. Never widened. Performed 5697 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5697 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:14:30,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:30,779 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:31,421 INFO L227 lantSequenceWeakener]: Weakened 167 states. On average, predicates are now at 81.23% of their original sizes. [2018-11-12 17:14:31,421 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:32,374 INFO L415 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2018-11-12 17:14:32,374 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:32,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:32,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-12 17:14:32,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:32,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:14:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:14:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:14:32,378 INFO L87 Difference]: Start difference. First operand 1825 states and 2690 transitions. Second operand 11 states. [2018-11-12 17:14:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:44,234 INFO L93 Difference]: Finished difference Result 4726 states and 6996 transitions. [2018-11-12 17:14:44,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 17:14:44,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 170 [2018-11-12 17:14:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:44,251 INFO L225 Difference]: With dead ends: 4726 [2018-11-12 17:14:44,251 INFO L226 Difference]: Without dead ends: 2907 [2018-11-12 17:14:44,259 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:14:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2018-11-12 17:14:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2819. [2018-11-12 17:14:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2018-11-12 17:14:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3871 transitions. [2018-11-12 17:14:44,342 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3871 transitions. Word has length 170 [2018-11-12 17:14:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:44,342 INFO L480 AbstractCegarLoop]: Abstraction has 2819 states and 3871 transitions. [2018-11-12 17:14:44,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:14:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3871 transitions. [2018-11-12 17:14:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-12 17:14:44,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:44,644 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:44,644 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:44,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:44,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1896536654, now seen corresponding path program 1 times [2018-11-12 17:14:44,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:44,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:44,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 17:14:45,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:45,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:45,147 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-11-12 17:14:45,152 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], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:45,166 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:45,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:46,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:46,118 INFO L272 AbstractInterpreter]: Visited 140 different actions 416 times. Merged at 7 different actions 20 times. Never widened. Performed 6056 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6056 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:46,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:46,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:46,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:46,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:46,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:46,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:46,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:46,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:46,740 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:46,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-12 17:14:46,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:46,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:14:46,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:14:46,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:14:46,742 INFO L87 Difference]: Start difference. First operand 2819 states and 3871 transitions. Second operand 3 states. [2018-11-12 17:14:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:48,740 INFO L93 Difference]: Finished difference Result 7675 states and 10955 transitions. [2018-11-12 17:14:48,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:14:48,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-11-12 17:14:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:48,766 INFO L225 Difference]: With dead ends: 7675 [2018-11-12 17:14:48,767 INFO L226 Difference]: Without dead ends: 4181 [2018-11-12 17:14:48,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 346 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:14:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2018-11-12 17:14:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4165. [2018-11-12 17:14:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4165 states. [2018-11-12 17:14:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5500 transitions. [2018-11-12 17:14:48,883 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5500 transitions. Word has length 172 [2018-11-12 17:14:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:48,884 INFO L480 AbstractCegarLoop]: Abstraction has 4165 states and 5500 transitions. [2018-11-12 17:14:48,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:14:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5500 transitions. [2018-11-12 17:14:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-12 17:14:48,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:48,899 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:48,899 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:48,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash 948524256, now seen corresponding path program 1 times [2018-11-12 17:14:48,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:48,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:48,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:48,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:48,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:49,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:49,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:49,350 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-11-12 17:14:49,351 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:49,354 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:49,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:49,995 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:14:49,995 INFO L272 AbstractInterpreter]: Visited 139 different actions 412 times. Merged at 7 different actions 17 times. Never widened. Performed 5812 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5812 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:50,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:50,001 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:50,448 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 81.14% of their original sizes. [2018-11-12 17:14:50,448 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:50,961 INFO L415 sIntCurrentIteration]: We unified 184 AI predicates to 184 [2018-11-12 17:14:50,962 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:50,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:50,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:14:50,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:50,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:14:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:14:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:14:50,964 INFO L87 Difference]: Start difference. First operand 4165 states and 5500 transitions. Second operand 11 states. [2018-11-12 17:14:59,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:59,472 INFO L93 Difference]: Finished difference Result 9813 states and 13058 transitions. [2018-11-12 17:14:59,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:14:59,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2018-11-12 17:14:59,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:59,495 INFO L225 Difference]: With dead ends: 9813 [2018-11-12 17:14:59,495 INFO L226 Difference]: Without dead ends: 5654 [2018-11-12 17:14:59,509 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:14:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2018-11-12 17:14:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 5590. [2018-11-12 17:14:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2018-11-12 17:14:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 6971 transitions. [2018-11-12 17:14:59,643 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 6971 transitions. Word has length 185 [2018-11-12 17:14:59,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:59,644 INFO L480 AbstractCegarLoop]: Abstraction has 5590 states and 6971 transitions. [2018-11-12 17:14:59,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:14:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 6971 transitions. [2018-11-12 17:14:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-12 17:14:59,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:59,661 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:59,661 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:59,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1047883593, now seen corresponding path program 1 times [2018-11-12 17:14:59,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:59,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:59,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:59,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:59,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:59,879 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:15:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 96 proven. 22 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-12 17:15:00,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:00,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:00,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-11-12 17:15:00,073 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [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], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:00,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:00,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:01,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:15:01,143 INFO L272 AbstractInterpreter]: Visited 142 different actions 574 times. Merged at 9 different actions 42 times. Widened at 1 different actions 1 times. Performed 7381 root evaluator evaluations with a maximum evaluation depth of 4. Performed 7381 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:15:01,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:01,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:15:01,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:01,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 17:15:01,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:01,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:15:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:01,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:15:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 84 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-12 17:15:01,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:15:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 96 proven. 22 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-12 17:15:01,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:15:01,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-12 17:15:01,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:15:01,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 17:15:01,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 17:15:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:15:01,546 INFO L87 Difference]: Start difference. First operand 5590 states and 6971 transitions. Second operand 8 states. [2018-11-12 17:15:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:04,527 INFO L93 Difference]: Finished difference Result 15193 states and 19291 transitions. [2018-11-12 17:15:04,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 17:15:04,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 222 [2018-11-12 17:15:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:04,571 INFO L225 Difference]: With dead ends: 15193 [2018-11-12 17:15:04,571 INFO L226 Difference]: Without dead ends: 9609 [2018-11-12 17:15:04,592 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:15:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9609 states. [2018-11-12 17:15:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9609 to 9423. [2018-11-12 17:15:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9423 states. [2018-11-12 17:15:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9423 states to 9423 states and 11432 transitions. [2018-11-12 17:15:04,860 INFO L78 Accepts]: Start accepts. Automaton has 9423 states and 11432 transitions. Word has length 222 [2018-11-12 17:15:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:04,861 INFO L480 AbstractCegarLoop]: Abstraction has 9423 states and 11432 transitions. [2018-11-12 17:15:04,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 17:15:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 9423 states and 11432 transitions. [2018-11-12 17:15:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-12 17:15:04,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:04,887 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:04,888 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:04,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1782050354, now seen corresponding path program 1 times [2018-11-12 17:15:04,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:04,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:04,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:04,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:04,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:05,126 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:15:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 117 proven. 53 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 17:15:05,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:05,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:05,296 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-11-12 17:15:05,296 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [67], [68], [72], [76], [80], [84], [88], [92], [96], [99], [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], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:05,299 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:05,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:06,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:15:06,645 INFO L272 AbstractInterpreter]: Visited 142 different actions 714 times. Merged at 9 different actions 51 times. Widened at 1 different actions 1 times. Performed 9502 root evaluator evaluations with a maximum evaluation depth of 4. Performed 9502 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:15:06,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:06,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:15:06,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:06,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 17:15:06,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:06,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:15:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:06,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:15:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 154 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 17:15:06,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:15:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 129 proven. 28 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-12 17:15:07,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:15:07,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-12 17:15:07,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:15:07,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:15:07,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:15:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:15:07,281 INFO L87 Difference]: Start difference. First operand 9423 states and 11432 transitions. Second operand 11 states. [2018-11-12 17:15:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:08,904 INFO L93 Difference]: Finished difference Result 16286 states and 19844 transitions. [2018-11-12 17:15:08,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:15:08,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 230 [2018-11-12 17:15:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:08,931 INFO L225 Difference]: With dead ends: 16286 [2018-11-12 17:15:08,931 INFO L226 Difference]: Without dead ends: 8023 [2018-11-12 17:15:08,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 462 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:15:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8023 states. [2018-11-12 17:15:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8023 to 7862. [2018-11-12 17:15:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7862 states. [2018-11-12 17:15:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7862 states to 7862 states and 9310 transitions. [2018-11-12 17:15:09,122 INFO L78 Accepts]: Start accepts. Automaton has 7862 states and 9310 transitions. Word has length 230 [2018-11-12 17:15:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:09,123 INFO L480 AbstractCegarLoop]: Abstraction has 7862 states and 9310 transitions. [2018-11-12 17:15:09,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:15:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7862 states and 9310 transitions. [2018-11-12 17:15:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-12 17:15:09,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:09,140 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:09,140 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:09,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:09,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1392596775, now seen corresponding path program 1 times [2018-11-12 17:15:09,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:09,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:09,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:09,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-12 17:15:09,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:15:09,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:15:09,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:09,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:15:09,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:15:09,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:15:09,359 INFO L87 Difference]: Start difference. First operand 7862 states and 9310 transitions. Second operand 3 states. [2018-11-12 17:15:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:10,837 INFO L93 Difference]: Finished difference Result 15477 states and 18350 transitions. [2018-11-12 17:15:10,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:15:10,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2018-11-12 17:15:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:10,863 INFO L225 Difference]: With dead ends: 15477 [2018-11-12 17:15:10,864 INFO L226 Difference]: Without dead ends: 7626 [2018-11-12 17:15:10,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:15:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7626 states. [2018-11-12 17:15:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7626 to 7016. [2018-11-12 17:15:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2018-11-12 17:15:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 8067 transitions. [2018-11-12 17:15:11,016 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 8067 transitions. Word has length 243 [2018-11-12 17:15:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:11,016 INFO L480 AbstractCegarLoop]: Abstraction has 7016 states and 8067 transitions. [2018-11-12 17:15:11,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:15:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 8067 transitions. [2018-11-12 17:15:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-12 17:15:11,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:11,036 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-12 17:15:11,037 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:11,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2018278714, now seen corresponding path program 1 times [2018-11-12 17:15:11,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:11,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:11,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:11,288 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:15:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 147 proven. 124 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-12 17:15:11,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:11,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:11,642 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-11-12 17:15:11,642 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:11,645 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:11,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:12,192 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:12,193 INFO L272 AbstractInterpreter]: Visited 143 different actions 421 times. Merged at 8 different actions 18 times. Never widened. Performed 5727 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5727 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:15:12,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:12,199 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:12,805 INFO L227 lantSequenceWeakener]: Weakened 282 states. On average, predicates are now at 80.99% of their original sizes. [2018-11-12 17:15:12,805 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:13,088 INFO L415 sIntCurrentIteration]: We unified 286 AI predicates to 286 [2018-11-12 17:15:13,088 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:13,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:13,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2018-11-12 17:15:13,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:13,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:15:13,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:15:13,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:15:13,089 INFO L87 Difference]: Start difference. First operand 7016 states and 8067 transitions. Second operand 12 states. [2018-11-12 17:15:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:25,246 INFO L93 Difference]: Finished difference Result 16571 states and 19199 transitions. [2018-11-12 17:15:25,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 17:15:25,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 287 [2018-11-12 17:15:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:25,274 INFO L225 Difference]: With dead ends: 16571 [2018-11-12 17:15:25,274 INFO L226 Difference]: Without dead ends: 9709 [2018-11-12 17:15:25,286 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 309 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 17:15:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9709 states. [2018-11-12 17:15:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9709 to 9467. [2018-11-12 17:15:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9467 states. [2018-11-12 17:15:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9467 states to 9467 states and 10800 transitions. [2018-11-12 17:15:25,468 INFO L78 Accepts]: Start accepts. Automaton has 9467 states and 10800 transitions. Word has length 287 [2018-11-12 17:15:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:25,469 INFO L480 AbstractCegarLoop]: Abstraction has 9467 states and 10800 transitions. [2018-11-12 17:15:25,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:15:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 9467 states and 10800 transitions. [2018-11-12 17:15:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-12 17:15:25,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:25,495 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:25,495 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:25,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:25,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1721992457, now seen corresponding path program 1 times [2018-11-12 17:15:25,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:25,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:25,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:25,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:25,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 183 proven. 92 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-12 17:15:26,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:26,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:26,580 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-11-12 17:15:26,580 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [151], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:26,584 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:26,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:27,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:15:27,543 INFO L272 AbstractInterpreter]: Visited 145 different actions 435 times. Merged at 9 different actions 28 times. Never widened. Performed 6251 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6251 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:15:27,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:27,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:15:27,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:27,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:15:27,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:27,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:15:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:27,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:15:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 237 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-12 17:15:28,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:15:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 198 proven. 57 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-12 17:15:28,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:15:28,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:15:28,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:15:28,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:15:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:15:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:15:28,889 INFO L87 Difference]: Start difference. First operand 9467 states and 10800 transitions. Second operand 11 states. [2018-11-12 17:15:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:34,539 INFO L93 Difference]: Finished difference Result 23528 states and 27420 transitions. [2018-11-12 17:15:34,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:15:34,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 294 [2018-11-12 17:15:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:34,563 INFO L225 Difference]: With dead ends: 23528 [2018-11-12 17:15:34,563 INFO L226 Difference]: Without dead ends: 9644 [2018-11-12 17:15:34,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 598 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-11-12 17:15:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2018-11-12 17:15:34,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 7915. [2018-11-12 17:15:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7915 states. [2018-11-12 17:15:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7915 states to 7915 states and 8606 transitions. [2018-11-12 17:15:34,733 INFO L78 Accepts]: Start accepts. Automaton has 7915 states and 8606 transitions. Word has length 294 [2018-11-12 17:15:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:34,733 INFO L480 AbstractCegarLoop]: Abstraction has 7915 states and 8606 transitions. [2018-11-12 17:15:34,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:15:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 7915 states and 8606 transitions. [2018-11-12 17:15:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-11-12 17:15:34,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:34,752 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:34,752 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:34,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:34,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1647993141, now seen corresponding path program 1 times [2018-11-12 17:15:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:34,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:34,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:34,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 259 proven. 94 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-11-12 17:15:35,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:35,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:35,064 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 344 with the following transitions: [2018-11-12 17:15:35,065 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [163], [168], [170], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:35,070 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:35,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:35,865 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:35,865 INFO L272 AbstractInterpreter]: Visited 147 different actions 587 times. Merged at 10 different actions 40 times. Never widened. Performed 7953 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7953 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:15:35,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:35,873 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:36,347 INFO L227 lantSequenceWeakener]: Weakened 338 states. On average, predicates are now at 81% of their original sizes. [2018-11-12 17:15:36,347 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:36,492 INFO L415 sIntCurrentIteration]: We unified 342 AI predicates to 342 [2018-11-12 17:15:36,492 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:36,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:36,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-12 17:15:36,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:36,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 17:15:36,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 17:15:36,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-11-12 17:15:36,493 INFO L87 Difference]: Start difference. First operand 7915 states and 8606 transitions. Second operand 15 states. [2018-11-12 17:15:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:54,734 INFO L93 Difference]: Finished difference Result 12290 states and 13340 transitions. [2018-11-12 17:15:54,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 17:15:54,734 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 343 [2018-11-12 17:15:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:54,735 INFO L225 Difference]: With dead ends: 12290 [2018-11-12 17:15:54,735 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:15:54,752 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 378 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=443, Invalid=2107, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 17:15:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:15:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:15:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:15:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:15:54,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 343 [2018-11-12 17:15:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:54,753 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:15:54,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 17:15:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:15:54,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:15:54,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:15:55,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,625 WARN L179 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 222 [2018-11-12 17:15:55,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:55,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:56,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:56,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:56,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:56,197 WARN L179 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 254 [2018-11-12 17:15:56,872 WARN L179 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-11-12 17:15:57,774 WARN L179 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2018-11-12 17:16:04,348 WARN L179 SmtUtils]: Spent 6.55 s on a formula simplification. DAG size of input: 379 DAG size of output: 151 [2018-11-12 17:16:06,173 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 247 DAG size of output: 133 [2018-11-12 17:16:08,289 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 272 DAG size of output: 137 [2018-11-12 17:16:08,292 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:16:08,293 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a25~0)| ~a25~0)) [2018-11-12 17:16:08,293 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:16:08,293 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,293 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:16:08,294 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:16:08,295 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:16:08,295 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:16:08,295 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:16:08,295 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:16:08,295 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:16:08,295 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:16:08,295 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,295 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,295 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:16:08,296 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,297 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:16:08,298 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:16:08,298 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:16:08,298 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:16:08,298 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:16:08,298 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:16:08,298 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:16:08,298 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:16:08,298 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:16:08,298 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:16:08,299 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:16:08,299 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,299 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,299 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,299 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,299 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,299 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:16:08,299 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:16:08,299 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,300 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:16:08,301 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,302 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:16:08,303 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 556) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:16:08,304 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:16:08,305 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,306 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,307 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse32 (= 1 |old(~a25~0)|)) (.cse42 (= 1 |old(~a19~0)|))) (let ((.cse8 (not (= 8 |old(~a17~0)|))) (.cse35 (< |old(~a28~0)| 10)) (.cse1 (= ~a25~0 1)) (.cse3 (= |old(~a28~0)| ~a28~0)) (.cse18 (<= ~a17~0 |old(~a17~0)|)) (.cse12 (= |old(~a19~0)| ~a19~0)) (.cse2 (= ~a11~0 |old(~a11~0)|)) (.cse44 (<= 10 ~a28~0)) (.cse45 (<= ~a28~0 10)) (.cse11 (= |old(~a25~0)| ~a25~0)) (.cse37 (not .cse42)) (.cse34 (< 1 |old(~a25~0)|)) (.cse6 (not (= 0 |old(~a11~0)|))) (.cse29 (< |old(~a25~0)| 0)) (.cse30 (< |old(~a28~0)| 7)) (.cse15 (< 10 |old(~a28~0)|)) (.cse24 (not (= 1 ~a21~0))) (.cse33 (< |old(~a11~0)| 0)) (.cse43 (not .cse32)) (.cse25 (< 1 |old(~a11~0)|)) (.cse31 (< |old(~a19~0)| 0))) (let ((.cse7 (and (or .cse24 (< 9 |old(~a28~0)|) .cse37 .cse34 .cse6 .cse29 .cse30) (or .cse15 (< 1 |old(~a19~0)|) .cse24 (< |old(~a28~0)| 8) .cse33 .cse43 .cse25 .cse31))) (.cse20 (<= 0 ~a11~0)) (.cse21 (<= ~a11~0 1)) (.cse22 (not (= ~a19~0 ~a11~0))) (.cse36 (and .cse18 .cse12 .cse2 .cse44 .cse45 .cse11)) (.cse9 (< 0 |old(~a19~0)|)) (.cse38 (and .cse18 .cse3 .cse12 .cse2 .cse11)) (.cse16 (= 10 |old(~a28~0)|)) (.cse23 (= |old(~a11~0)| |old(~a19~0)|)) (.cse14 (< 7 |old(~a17~0)|)) (.cse13 (<= 7 ~a17~0)) (.cse26 (<= 0 ~a25~0)) (.cse27 (not .cse1)) (.cse28 (<= ~a25~0 1)) (.cse39 (not (= |old(~a19~0)| 1))) (.cse40 (< |old(~a17~0)| 8)) (.cse41 (and .cse18 .cse12 .cse2 .cse44 (<= 8 ~a17~0) .cse45 .cse11)) (.cse5 (or .cse15 .cse43 (= 7 |old(~a17~0)|) .cse35)) (.cse19 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse17 (and (or .cse24 .cse33 .cse43 .cse37 .cse25 (< 11 |old(~a28~0)|) .cse30 (< |old(~a17~0)| 7)) (or .cse24 (not (= 7 |old(~a28~0)|)) .cse37 .cse6 .cse8 (not (= 0 |old(~a25~0)|))))) (.cse10 (< |calculate_output_#in~input| 1))) (and (or .cse0 (and .cse1 (= ~a19~0 0) .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (and .cse2 .cse11 .cse12 .cse3 (<= ~a17~0 7) .cse13) .cse14 .cse15 .cse16 .cse17 .cse10) (or .cse0 .cse14 .cse16 .cse17 (and .cse13 .cse18 (and .cse19 .cse1) .cse20 .cse3 .cse21 .cse22) .cse23 .cse10) (or .cse0 .cse24 .cse25 (and .cse26 (<= ~a19~0 1) .cse2 .cse27 .cse28 .cse3 (<= 0 ~a19~0) .cse4 .cse22) .cse29 .cse30 .cse31 .cse32 .cse15 .cse33 .cse34 .cse16 .cse8 .cse23 .cse9 .cse10) (or .cse15 .cse35 .cse36 (< |old(~a19~0)| 1) .cse14 .cse32) (or .cse0 .cse37 .cse7 .cse8 .cse23 (and .cse11 .cse19 .cse20 .cse3 .cse21 .cse4 .cse22) .cse10) (or .cse38 .cse39 .cse14 .cse32) (or .cse15 .cse35 .cse23 .cse36 .cse14 .cse32) (or .cse15 .cse39 .cse40 .cse35 .cse23 .cse41) (or .cse0 .cse24 (and .cse12 .cse26 .cse2 .cse27 .cse28 .cse3 .cse4) .cse6 .cse29 .cse30 .cse31 .cse32 .cse15 .cse34 .cse16 .cse8 .cse9 .cse10) (or .cse38 .cse15 .cse42 .cse43 .cse16 .cse23 .cse14) (or .cse0 (and .cse2 .cse3 .cse1 .cse19 (<= ~a17~0 8) .cse13) .cse15 .cse35 .cse17 (< 8 |old(~a17~0)|) .cse10) (or .cse24 .cse43 .cse6 (and .cse11 .cse3 (= ~a11~0 0) .cse4 .cse19) .cse37 .cse35 .cse8) (or .cse24 .cse25 .cse30 .cse32 .cse33 .cse34 (and .cse26 .cse19 .cse2 .cse27 .cse28 .cse3 .cse4) .cse10 .cse0 .cse29 .cse15 .cse37 .cse8) (or .cse39 .cse40 .cse41 .cse5) (or (and (and .cse1 (and .cse19 (= ~a11~0 1)) .cse3) .cse4) (or .cse0 (or (not (= 9 |old(~a28~0)|)) (not (= 1 |old(~a11~0)|))) .cse17) .cse8 .cse10))))) [2018-11-12 17:16:08,307 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,307 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,307 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,307 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:16:08,307 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:16:08,307 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:16:08,307 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:16:08,307 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,308 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:16:08,309 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:16:08,310 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:16:08,311 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:16:08,312 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-11-12 17:16:08,312 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:16:08,312 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:16:08,312 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (and (= ~a25~0 0) (= ~a19~0 1) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (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-11-12 17:16:08,312 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:16:08,312 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse22 (= ~a11~0 0)) (.cse19 (= ~a17~0 8)) (.cse16 (<= ~a11~0 1)) (.cse7 (= ~a19~0 1)) (.cse6 (= ~a21~0 1)) (.cse21 (<= ~a17~0 8)) (.cse12 (<= 7 ~a28~0)) (.cse13 (<= 0 ~a11~0)) (.cse25 (= ~a25~0 1))) (let ((.cse0 (= |old(~a19~0)| ~a19~0)) (.cse9 (not (= ~a28~0 10))) (.cse1 (<= ~a17~0 7)) (.cse2 (not .cse25)) (.cse20 (or (and .cse22 (= ~a25~0 0) .cse19 .cse7 (= ~a28~0 7) .cse6) (and (<= ~a28~0 11) .cse16 .cse7 .cse6 .cse25 .cse21 .cse12 .cse13 (<= 7 ~a17~0)))) (.cse8 (= 1 ~a25~0)) (.cse3 (<= 10 ~a28~0)) (.cse4 (<= ~a28~0 10)) (.cse17 (<= 0 ~a19~0)) (.cse18 (<= ~a19~0 1)) (.cse10 (<= 1 main_~input~0)) (.cse15 (<= 0 ~a25~0)) (.cse23 (let ((.cse24 (<= 0 (+ main_~input~0 2147483648))) (.cse26 (<= main_~input~0 2147483647))) (or (and .cse24 .cse25 .cse26 (<= 8 ~a28~0)) (and .cse24 .cse22 .cse7 (<= ~a28~0 9) .cse26)))) (.cse11 (<= main_~input~0 6)) (.cse14 (<= ~a25~0 1)) (.cse5 (not (= ~a19~0 ~a11~0)))) (or (and .cse0 .cse1 .cse2) (and (<= ~a17~0 |old(~a17~0)|) .cse0 .cse3 .cse2 .cse4 .cse5) (and .cse1 .cse3 .cse2 .cse4 .cse5) (not .cse6) (not (= ~y~0 25)) (and (not .cse7) .cse1 .cse8 .cse4 .cse5 .cse9) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse10 .cse2 .cse11 .cse4 .cse12 .cse13 .cse14 .cse9 .cse15 .cse16 .cse17 .cse18 .cse19) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse20 .cse3 .cse5) (and .cse15 .cse3 .cse4 .cse19 .cse7 .cse14) (and .cse2 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse21) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse20 .cse1 .cse4) (and .cse1 .cse3 .cse2 .cse4 (<= 1 ~a19~0)) (and .cse10 .cse11 (and .cse20 (= ~a28~0 9))) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse8 (<= 11 ~a28~0) .cse22 .cse19 .cse7) (not (= ~a~0 1)) (and .cse10 .cse11 (and .cse3 .cse4) .cse22 .cse23 .cse17 .cse18 .cse19) (not (= |old(~a17~0)| 8)) (and .cse10 .cse12 .cse15 .cse23 .cse7 .cse11 .cse13 .cse14 .cse16 .cse19 .cse5) (not (= 6 ~f~0))))) [2018-11-12 17:16:08,312 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:16:08,312 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:16:08,313 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse17 (= ~a25~0 1)) (.cse18 (<= 7 ~a28~0)) (.cse20 (<= 0 ~a11~0)) (.cse24 (= ~a11~0 0)) (.cse16 (= ~a17~0 8)) (.cse7 (= ~a21~0 1))) (let ((.cse6 (not (= ~a19~0 ~a11~0))) (.cse21 (<= ~a25~0 1)) (.cse10 (not (= ~a28~0 10))) (.cse19 (<= 0 ~a25~0)) (.cse3 (<= ~a17~0 |old(~a17~0)|)) (.cse0 (= |old(~a19~0)| ~a19~0)) (.cse13 (<= ~a11~0 1)) (.cse14 (let ((.cse25 (<= 0 (+ main_~input~0 2147483648))) (.cse26 (<= main_~input~0 2147483647))) (or (and .cse25 .cse7 .cse17 .cse18 .cse20 .cse26) (and .cse25 .cse24 (= ~a25~0 0) .cse16 (= ~a28~0 7) .cse7 .cse26)))) (.cse15 (<= 7 ~a17~0)) (.cse1 (<= ~a17~0 7)) (.cse2 (not .cse17)) (.cse9 (= 1 ~a25~0)) (.cse8 (= ~a19~0 1)) (.cse11 (<= 1 main_~input~0)) (.cse12 (<= main_~input~0 6)) (.cse4 (<= 10 ~a28~0)) (.cse5 (<= ~a28~0 10)) (.cse22 (<= 0 ~a19~0)) (.cse23 (<= ~a19~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse2 .cse5 .cse6) (and .cse1 .cse4 .cse2 .cse5 .cse6) (not .cse7) (not (= ~y~0 25)) (and (not .cse8) .cse1 .cse9 .cse5 .cse6 .cse10) (and .cse11 .cse12 (<= ~a28~0 11) .cse13 .cse8 (<= ~a17~0 8) .cse6 .cse14 .cse15) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse11 .cse8 .cse12 .cse16 (and (= ~a28~0 9) .cse17 (= ~a11~0 1))) (not (= ~e~0 5)) (and .cse11 .cse5 .cse18 .cse19 .cse8 .cse2 .cse12 .cse20 .cse21 .cse13 .cse16) (not (= ~d~0 4)) (and .cse11 .cse2 .cse12 .cse5 .cse18 .cse20 .cse21 .cse10 .cse19 .cse13 .cse22 .cse23 .cse16) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse3 .cse0 (<= 8 ~a17~0) .cse4 .cse9 .cse5) (not (= ~z~0 26)) (and .cse11 .cse12 .cse5 .cse1 .cse13 .cse8 .cse14 .cse15) (not (= 0 |old(~a25~0)|)) (and .cse1 .cse4 .cse2 .cse5 (<= 1 ~a19~0)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse9 (<= 11 ~a28~0) .cse24 .cse16 .cse8) (not (= ~a~0 1)) (and .cse11 .cse12 (and .cse4 .cse5) .cse24 .cse17 .cse22 .cse23 .cse16) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-11-12 17:16:08,313 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:16:08,313 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:16:08,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:16:08 BoogieIcfgContainer [2018-11-12 17:16:08,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:16:08,333 INFO L168 Benchmark]: Toolchain (without parser) took 130299.32 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:16:08,334 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:16:08,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.21 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-11-12 17:16:08,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:08,336 INFO L168 Benchmark]: Boogie Preprocessor took 110.17 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:16:08,337 INFO L168 Benchmark]: RCFGBuilder took 3651.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.2 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:08,337 INFO L168 Benchmark]: TraceAbstraction took 125609.26 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -907.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:16:08,342 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.21 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 131.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.17 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3651.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.2 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 125609.26 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -907.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 556]: 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: (((((((((((((((((((((((((((((((\old(a19) == a19 && a17 <= 7) && !(a25 == 1)) || (((((a17 <= \old(a17) && \old(a19) == a19) && 10 <= a28) && !(a25 == 1)) && a28 <= 10) && !(a19 == a11))) || ((((a17 <= 7 && 10 <= a28) && !(a25 == 1)) && a28 <= 10) && !(a19 == a11))) || !(a21 == 1)) || !(y == 25)) || (((((!(a19 == 1) && a17 <= 7) && 1 == a25) && a28 <= 10) && !(a19 == a11)) && !(a28 == 10))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || ((((((((((((1 <= input && !(a25 == 1)) && input <= 6) && a28 <= 10) && 7 <= a28) && 0 <= a11) && a25 <= 1) && !(a28 == 10)) && 0 <= a25) && a11 <= 1) && 0 <= a19) && a19 <= 1) && a17 == 8)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || ((((((((a11 == 0 && a25 == 0) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1) || ((((((((a28 <= 11 && a11 <= 1) && a19 == 1) && a21 == 1) && a25 == 1) && a17 <= 8) && 7 <= a28) && 0 <= a11) && 7 <= a17)) && 10 <= a28) && !(a19 == a11))) || (((((0 <= a25 && 10 <= a28) && a28 <= 10) && a17 == 8) && a19 == 1) && a25 <= 1)) || ((((((((!(a25 == 1) && a28 <= 10) && 7 <= a28) && 0 <= a11) && a25 <= 1) && 0 <= a25) && a11 <= 1) && a19 == 1) && a17 <= 8)) || !(z == 26)) || !(0 == \old(a25))) || ((((((((a11 == 0 && a25 == 0) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1) || ((((((((a28 <= 11 && a11 <= 1) && a19 == 1) && a21 == 1) && a25 == 1) && a17 <= 8) && 7 <= a28) && 0 <= a11) && 7 <= a17)) && a17 <= 7) && a28 <= 10)) || ((((a17 <= 7 && 10 <= a28) && !(a25 == 1)) && a28 <= 10) && 1 <= a19)) || ((1 <= input && input <= 6) && ((((((a11 == 0 && a25 == 0) && a17 == 8) && a19 == 1) && a28 == 7) && a21 == 1) || ((((((((a28 <= 11 && a11 <= 1) && a19 == 1) && a21 == 1) && a25 == 1) && a17 <= 8) && 7 <= a28) && 0 <= a11) && 7 <= a17)) && a28 == 9)) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || ((((1 == a25 && 11 <= a28) && a11 == 0) && a17 == 8) && a19 == 1)) || !(a == 1)) || (((((((1 <= input && input <= 6) && 10 <= a28 && a28 <= 10) && a11 == 0) && ((((0 <= input + 2147483648 && a25 == 1) && input <= 2147483647) && 8 <= a28) || ((((0 <= input + 2147483648 && a11 == 0) && a19 == 1) && a28 <= 9) && input <= 2147483647))) && 0 <= a19) && a19 <= 1) && a17 == 8)) || !(\old(a17) == 8)) || ((((((((((1 <= input && 7 <= a28) && 0 <= a25) && ((((0 <= input + 2147483648 && a25 == 1) && input <= 2147483647) && 8 <= a28) || ((((0 <= input + 2147483648 && a11 == 0) && a19 == 1) && a28 <= 9) && input <= 2147483647))) && a19 == 1) && input <= 6) && 0 <= a11) && a25 <= 1) && a11 <= 1) && a17 == 8) && !(a19 == a11))) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 125.5s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 86.3s AutomataDifference, 0.0s DeadEndRemovalTime, 13.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2441 SDtfs, 15846 SDslu, 3244 SDs, 0 SdLazy, 24625 SolverSat, 3184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.0s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 3198 GetRequests, 2950 SyntacticMatches, 14 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9467occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.5s AbstIntTime, 9 AbstIntIterations, 5 AbstIntStrong, 0.9970677278339803 AbsIntWeakeningRatio, 0.19210526315789472 AbsIntAvgWeakeningVarsNumRemoved, 30.076315789473686 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 3344 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 389 PreInvPairs, 519 NumberOfFragments, 2307 HoareAnnotationTreeSize, 389 FomulaSimplifications, 22923 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 22615 FormulaSimplificationTreeSizeReductionInter, 12.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 3668 NumberOfCodeBlocks, 3668 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4565 ConstructedInterpolants, 0 QuantifiedInterpolants, 1953485 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2255 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 2871/3398 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...