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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:45:08,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:45:08,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:45:08,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:45:08,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:45:08,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:45:08,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:45:08,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:45:08,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:45:08,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:45:08,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:45:08,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:45:08,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:45:08,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:45:08,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:45:08,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:45:08,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:45:08,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:45:08,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:45:08,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:45:08,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:45:08,141 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:45:08,149 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:45:08,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:45:08,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:45:08,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:45:08,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:45:08,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:45:08,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:45:08,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:45:08,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:45:08,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:45:08,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:45:08,156 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:45:08,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:45:08,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:45:08,157 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.epf [2018-11-07 12:45:08,172 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:45:08,172 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:45:08,173 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:45:08,173 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:45:08,174 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:45:08,174 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:45:08,174 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:45:08,174 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:45:08,174 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:45:08,175 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:45:08,175 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:45:08,175 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:45:08,176 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:45:08,176 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:45:08,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:45:08,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:45:08,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:45:08,177 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:45:08,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:45:08,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:45:08,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:45:08,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:45:08,178 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:45:08,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:45:08,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:45:08,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:45:08,178 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:45:08,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:45:08,179 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:45:08,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:45:08,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:45:08,179 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:45:08,180 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:45:08,180 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:45:08,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:45:08,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:45:08,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:45:08,250 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:45:08,250 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:45:08,251 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-11-07 12:45:08,317 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7de12a33/a68e47ddb9824bf8906e04c0a8a9b1e0/FLAG6860c8f75 [2018-11-07 12:45:08,918 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:45:08,919 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-11-07 12:45:08,932 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7de12a33/a68e47ddb9824bf8906e04c0a8a9b1e0/FLAG6860c8f75 [2018-11-07 12:45:08,947 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7de12a33/a68e47ddb9824bf8906e04c0a8a9b1e0 [2018-11-07 12:45:08,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:45:08,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:45:08,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:45:08,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:45:08,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:45:08,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:45:08" (1/1) ... [2018-11-07 12:45:08,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429b8899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:08, skipping insertion in model container [2018-11-07 12:45:08,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:45:08" (1/1) ... [2018-11-07 12:45:08,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:45:09,059 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:45:09,505 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:45:09,512 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:45:09,634 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:45:09,654 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:45:09,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09 WrapperNode [2018-11-07 12:45:09,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:45:09,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:45:09,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:45:09,656 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:45:09,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... [2018-11-07 12:45:09,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... [2018-11-07 12:45:09,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:45:09,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:45:09,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:45:09,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:45:09,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... [2018-11-07 12:45:09,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... [2018-11-07 12:45:09,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... [2018-11-07 12:45:09,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... [2018-11-07 12:45:09,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... [2018-11-07 12:45:09,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... [2018-11-07 12:45:09,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... [2018-11-07 12:45:09,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:45:09,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:45:09,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:45:09,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:45:09,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:45:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:45:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:45:09,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:45:09,979 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:45:09,979 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:45:09,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:45:09,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:45:09,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:45:09,979 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:45:13,218 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:45:13,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:45:13 BoogieIcfgContainer [2018-11-07 12:45:13,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:45:13,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:45:13,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:45:13,225 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:45:13,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:45:08" (1/3) ... [2018-11-07 12:45:13,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3accdda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:45:13, skipping insertion in model container [2018-11-07 12:45:13,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:09" (2/3) ... [2018-11-07 12:45:13,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3accdda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:45:13, skipping insertion in model container [2018-11-07 12:45:13,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:45:13" (3/3) ... [2018-11-07 12:45:13,230 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label05_true-unreach-call_false-termination.c [2018-11-07 12:45:13,241 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:45:13,251 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:45:13,269 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:45:13,318 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:45:13,318 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:45:13,318 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:45:13,318 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:45:13,318 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:45:13,319 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:45:13,319 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:45:13,319 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:45:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:45:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 12:45:13,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:13,358 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] [2018-11-07 12:45:13,360 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:13,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash -200516955, now seen corresponding path program 1 times [2018-11-07 12:45:13,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:13,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:13,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:13,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:13,419 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:13,998 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:45:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:45:14,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:45:14,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:45:14,147 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:14,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:45:14,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:45:14,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:45:14,173 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 12:45:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:15,836 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 12:45:15,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:45:15,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-11-07 12:45:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:15,860 INFO L225 Difference]: With dead ends: 550 [2018-11-07 12:45:15,861 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 12:45:15,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:45:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 12:45:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 12:45:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:45:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 12:45:15,942 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 101 [2018-11-07 12:45:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:15,943 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 12:45:15,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:45:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 12:45:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 12:45:15,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:15,951 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:45:15,951 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:15,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1760831450, now seen corresponding path program 1 times [2018-11-07 12:45:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:15,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:15,954 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:45:16,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:45:16,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:45:16,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:16,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:45:16,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:45:16,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:45:16,112 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 12:45:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:17,817 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 12:45:17,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:45:17,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-07 12:45:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:17,824 INFO L225 Difference]: With dead ends: 888 [2018-11-07 12:45:17,824 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 12:45:17,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:45:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 12:45:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 12:45:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 12:45:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 12:45:17,889 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 112 [2018-11-07 12:45:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:17,889 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 12:45:17,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:45:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 12:45:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 12:45:17,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:17,896 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 12:45:17,896 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:17,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1036914094, now seen corresponding path program 1 times [2018-11-07 12:45:17,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:17,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:17,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:45:18,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:45:18,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:45:18,162 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:18,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:45:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:45:18,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:45:18,165 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-11-07 12:45:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:19,490 INFO L93 Difference]: Finished difference Result 1530 states and 2432 transitions. [2018-11-07 12:45:19,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:45:19,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-11-07 12:45:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:19,501 INFO L225 Difference]: With dead ends: 1530 [2018-11-07 12:45:19,501 INFO L226 Difference]: Without dead ends: 997 [2018-11-07 12:45:19,504 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-07 12:45:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-07 12:45:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-07 12:45:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-07 12:45:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1488 transitions. [2018-11-07 12:45:19,543 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1488 transitions. Word has length 113 [2018-11-07 12:45:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:19,544 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1488 transitions. [2018-11-07 12:45:19,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:45:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1488 transitions. [2018-11-07 12:45:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 12:45:19,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:19,577 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:45:19,577 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:19,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash 790407278, now seen corresponding path program 1 times [2018-11-07 12:45:19,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:19,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:19,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:45:19,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:45:19,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:45:19,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:19,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:45:19,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:45:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:45:19,766 INFO L87 Difference]: Start difference. First operand 997 states and 1488 transitions. Second operand 6 states. [2018-11-07 12:45:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:22,424 INFO L93 Difference]: Finished difference Result 2927 states and 4616 transitions. [2018-11-07 12:45:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:45:22,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-07 12:45:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:22,438 INFO L225 Difference]: With dead ends: 2927 [2018-11-07 12:45:22,438 INFO L226 Difference]: Without dead ends: 1936 [2018-11-07 12:45:22,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:45:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-11-07 12:45:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1881. [2018-11-07 12:45:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2018-11-07 12:45:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2656 transitions. [2018-11-07 12:45:22,526 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2656 transitions. Word has length 127 [2018-11-07 12:45:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:22,527 INFO L480 AbstractCegarLoop]: Abstraction has 1881 states and 2656 transitions. [2018-11-07 12:45:22,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:45:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2656 transitions. [2018-11-07 12:45:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 12:45:22,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:22,535 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:45:22,535 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:22,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:22,536 INFO L82 PathProgramCache]: Analyzing trace with hash 323635751, now seen corresponding path program 1 times [2018-11-07 12:45:22,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:22,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:22,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:22,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:22,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:45:23,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:45:23,029 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:45:23,030 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-11-07 12:45:23,039 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:45:23,102 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:45:23,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:45:27,308 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:45:27,309 INFO L272 AbstractInterpreter]: Visited 105 different actions 170 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:45:27,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:27,356 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:45:29,210 INFO L227 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 80.18% of their original sizes. [2018-11-07 12:45:29,210 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:45:29,756 INFO L415 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-11-07 12:45:29,756 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:45:29,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:45:29,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:45:29,757 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:29,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:45:29,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:45:29,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:45:29,759 INFO L87 Difference]: Start difference. First operand 1881 states and 2656 transitions. Second operand 11 states. [2018-11-07 12:45:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:45,955 INFO L93 Difference]: Finished difference Result 4979 states and 7062 transitions. [2018-11-07 12:45:45,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:45:45,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2018-11-07 12:45:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:45,973 INFO L225 Difference]: With dead ends: 4979 [2018-11-07 12:45:45,973 INFO L226 Difference]: Without dead ends: 3104 [2018-11-07 12:45:45,982 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 12:45:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2018-11-07 12:45:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3071. [2018-11-07 12:45:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2018-11-07 12:45:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3991 transitions. [2018-11-07 12:45:46,072 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3991 transitions. Word has length 145 [2018-11-07 12:45:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:46,073 INFO L480 AbstractCegarLoop]: Abstraction has 3071 states and 3991 transitions. [2018-11-07 12:45:46,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:45:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3991 transitions. [2018-11-07 12:45:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 12:45:46,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:46,083 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:45:46,083 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:46,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:46,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1433340204, now seen corresponding path program 1 times [2018-11-07 12:45:46,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:46,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:46,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:46,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:46,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:45:46,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:45:46,298 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:45:46,299 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-11-07 12:45:46,299 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:45:46,305 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:45:46,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:45:47,825 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:45:47,826 INFO L272 AbstractInterpreter]: Visited 106 different actions 173 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:45:47,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:47,831 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:45:49,192 INFO L227 lantSequenceWeakener]: Weakened 67 states. On average, predicates are now at 80.86% of their original sizes. [2018-11-07 12:45:49,192 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:45:49,830 INFO L415 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2018-11-07 12:45:49,830 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:45:49,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:45:49,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 12:45:49,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:49,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 12:45:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 12:45:49,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:45:49,832 INFO L87 Difference]: Start difference. First operand 3071 states and 3991 transitions. Second operand 19 states. [2018-11-07 12:46:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:13,174 INFO L93 Difference]: Finished difference Result 6421 states and 8375 transitions. [2018-11-07 12:46:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:46:13,174 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 158 [2018-11-07 12:46:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:13,191 INFO L225 Difference]: With dead ends: 6421 [2018-11-07 12:46:13,191 INFO L226 Difference]: Without dead ends: 3492 [2018-11-07 12:46:13,201 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 169 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:46:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2018-11-07 12:46:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3482. [2018-11-07 12:46:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2018-11-07 12:46:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 4444 transitions. [2018-11-07 12:46:13,299 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 4444 transitions. Word has length 158 [2018-11-07 12:46:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:13,300 INFO L480 AbstractCegarLoop]: Abstraction has 3482 states and 4444 transitions. [2018-11-07 12:46:13,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 12:46:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 4444 transitions. [2018-11-07 12:46:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 12:46:13,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:13,310 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-11-07 12:46:13,310 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:13,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1278873057, now seen corresponding path program 1 times [2018-11-07 12:46:13,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:13,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:13,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:13,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:13,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 12:46:13,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:46:13,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:46:13,426 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-11-07 12:46:13,426 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:46:13,431 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:46:13,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:46:15,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:46:15,868 INFO L272 AbstractInterpreter]: Visited 108 different actions 287 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:46:15,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:15,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:46:15,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:46:15,884 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:46:15,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:15,895 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:46:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:16,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:46:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 12:46:16,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:46:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 12:46:17,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:46:17,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 12:46:17,386 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:46:17,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 12:46:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 12:46:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:46:17,387 INFO L87 Difference]: Start difference. First operand 3482 states and 4444 transitions. Second operand 8 states. [2018-11-07 12:46:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:22,563 INFO L93 Difference]: Finished difference Result 12364 states and 17485 transitions. [2018-11-07 12:46:22,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:46:22,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2018-11-07 12:46:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:22,604 INFO L225 Difference]: With dead ends: 12364 [2018-11-07 12:46:22,604 INFO L226 Difference]: Without dead ends: 6710 [2018-11-07 12:46:22,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:46:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2018-11-07 12:46:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6549. [2018-11-07 12:46:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6549 states. [2018-11-07 12:46:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6549 states to 6549 states and 7913 transitions. [2018-11-07 12:46:22,852 INFO L78 Accepts]: Start accepts. Automaton has 6549 states and 7913 transitions. Word has length 170 [2018-11-07 12:46:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:22,852 INFO L480 AbstractCegarLoop]: Abstraction has 6549 states and 7913 transitions. [2018-11-07 12:46:22,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 12:46:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 6549 states and 7913 transitions. [2018-11-07 12:46:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 12:46:22,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:22,868 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:46:22,868 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:22,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:22,869 INFO L82 PathProgramCache]: Analyzing trace with hash 333501976, now seen corresponding path program 1 times [2018-11-07 12:46:22,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:22,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:22,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:22,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:22,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:23,419 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 12:46:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 12:46:23,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:46:23,571 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:46:23,571 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-11-07 12:46:23,572 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:46:23,583 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:46:23,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:46:27,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:46:27,762 INFO L272 AbstractInterpreter]: Visited 106 different actions 173 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:46:27,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:27,767 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:46:30,388 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 80.53% of their original sizes. [2018-11-07 12:46:30,388 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:46:32,386 INFO L415 sIntCurrentIteration]: We unified 190 AI predicates to 190 [2018-11-07 12:46:32,387 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:46:32,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:46:32,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 12:46:32,387 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:46:32,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 12:46:32,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 12:46:32,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-11-07 12:46:32,389 INFO L87 Difference]: Start difference. First operand 6549 states and 7913 transitions. Second operand 17 states. [2018-11-07 12:46:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:56,285 INFO L93 Difference]: Finished difference Result 12202 states and 14787 transitions. [2018-11-07 12:46:56,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 12:46:56,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 191 [2018-11-07 12:46:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:56,317 INFO L225 Difference]: With dead ends: 12202 [2018-11-07 12:46:56,317 INFO L226 Difference]: Without dead ends: 6970 [2018-11-07 12:46:56,332 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 123 SyntacticMatches, 52 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-11-07 12:46:56,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6970 states. [2018-11-07 12:46:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6970 to 6825. [2018-11-07 12:46:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6825 states. [2018-11-07 12:46:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6825 states to 6825 states and 8209 transitions. [2018-11-07 12:46:56,504 INFO L78 Accepts]: Start accepts. Automaton has 6825 states and 8209 transitions. Word has length 191 [2018-11-07 12:46:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:56,504 INFO L480 AbstractCegarLoop]: Abstraction has 6825 states and 8209 transitions. [2018-11-07 12:46:56,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 12:46:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6825 states and 8209 transitions. [2018-11-07 12:46:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 12:46:56,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:56,523 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:46:56,523 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:56,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2075133141, now seen corresponding path program 1 times [2018-11-07 12:46:56,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:56,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:56,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:56,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:56,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:46:57,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:46:57,420 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:46:57,421 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-11-07 12:46:57,421 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:46:57,425 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:46:57,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:47:02,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:47:02,110 INFO L272 AbstractInterpreter]: Visited 108 different actions 509 times. Merged at 9 different actions 50 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:47:02,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:02,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:47:02,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:02,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 12:47:02,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:02,338 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:47:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:02,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:47:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 12:47:02,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:47:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 12:47:03,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:47:03,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 12:47:03,034 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:47:03,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:47:03,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:47:03,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:47:03,035 INFO L87 Difference]: Start difference. First operand 6825 states and 8209 transitions. Second operand 11 states. [2018-11-07 12:47:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:05,207 INFO L93 Difference]: Finished difference Result 14853 states and 18001 transitions. [2018-11-07 12:47:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 12:47:05,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 200 [2018-11-07 12:47:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:05,244 INFO L225 Difference]: With dead ends: 14853 [2018-11-07 12:47:05,244 INFO L226 Difference]: Without dead ends: 8581 [2018-11-07 12:47:05,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:47:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8581 states. [2018-11-07 12:47:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8581 to 8409. [2018-11-07 12:47:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8409 states. [2018-11-07 12:47:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 9924 transitions. [2018-11-07 12:47:05,446 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 9924 transitions. Word has length 200 [2018-11-07 12:47:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:05,446 INFO L480 AbstractCegarLoop]: Abstraction has 8409 states and 9924 transitions. [2018-11-07 12:47:05,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:47:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 9924 transitions. [2018-11-07 12:47:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 12:47:05,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:05,465 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:47:05,465 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:05,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash 58709859, now seen corresponding path program 2 times [2018-11-07 12:47:05,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:05,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:05,467 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 12:47:05,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:05,765 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:47:05,765 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 12:47:05,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 12:47:05,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:05,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 12:47:05,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 12:47:05,776 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 12:47:05,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 12:47:05,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 12:47:05,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:47:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-07 12:47:06,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:47:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-07 12:47:06,169 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:47:06,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 12:47:06,170 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:06,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:47:06,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:47:06,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:47:06,171 INFO L87 Difference]: Start difference. First operand 8409 states and 9924 transitions. Second operand 3 states. [2018-11-07 12:47:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:07,253 INFO L93 Difference]: Finished difference Result 14470 states and 17142 transitions. [2018-11-07 12:47:07,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:47:07,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-11-07 12:47:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:07,291 INFO L225 Difference]: With dead ends: 14470 [2018-11-07 12:47:07,292 INFO L226 Difference]: Without dead ends: 8955 [2018-11-07 12:47:07,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:47:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8955 states. [2018-11-07 12:47:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8955 to 8683. [2018-11-07 12:47:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2018-11-07 12:47:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 10246 transitions. [2018-11-07 12:47:07,510 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 10246 transitions. Word has length 200 [2018-11-07 12:47:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:07,511 INFO L480 AbstractCegarLoop]: Abstraction has 8683 states and 10246 transitions. [2018-11-07 12:47:07,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:47:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 10246 transitions. [2018-11-07 12:47:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-07 12:47:07,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:07,533 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:47:07,534 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:07,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:07,534 INFO L82 PathProgramCache]: Analyzing trace with hash 410306036, now seen corresponding path program 1 times [2018-11-07 12:47:07,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:07,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 12:47:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:07,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 137 proven. 73 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-07 12:47:08,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:08,272 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:47:08,272 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-11-07 12:47:08,272 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:47:08,275 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:47:08,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:47:13,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:47:13,432 INFO L272 AbstractInterpreter]: Visited 109 different actions 518 times. Merged at 10 different actions 54 times. Widened at 1 different actions 1 times. Found 14 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:47:13,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:13,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:47:13,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:13,440 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 12:47:13,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:13,452 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:47:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:13,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:47:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 144 proven. 2 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-07 12:47:14,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:47:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 143 proven. 20 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-07 12:47:14,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:47:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 12:47:14,333 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:47:14,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 12:47:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 12:47:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:47:14,335 INFO L87 Difference]: Start difference. First operand 8683 states and 10246 transitions. Second operand 12 states. [2018-11-07 12:47:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:19,202 INFO L93 Difference]: Finished difference Result 27247 states and 34317 transitions. [2018-11-07 12:47:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 12:47:19,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 237 [2018-11-07 12:47:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:19,203 INFO L225 Difference]: With dead ends: 27247 [2018-11-07 12:47:19,203 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:47:19,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 503 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=444, Invalid=1718, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 12:47:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:47:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:47:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:47:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:47:19,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 237 [2018-11-07 12:47:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:19,252 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:47:19,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 12:47:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:47:19,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:47:19,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:47:20,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:20,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,244 WARN L179 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 488 DAG size of output: 371 [2018-11-07 12:47:21,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:21,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:47:22,566 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 467 DAG size of output: 356 [2018-11-07 12:47:23,643 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-11-07 12:47:25,373 WARN L179 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 144 DAG size of output: 86 [2018-11-07 12:47:29,951 WARN L179 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 532 DAG size of output: 114 [2018-11-07 12:47:32,699 WARN L179 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 390 DAG size of output: 117 [2018-11-07 12:47:35,176 WARN L179 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 379 DAG size of output: 120 [2018-11-07 12:47:35,179 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:47:35,180 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a16~0)| ~a16~0)) [2018-11-07 12:47:35,180 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:47:35,180 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:47:35,180 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:47:35,180 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,180 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,180 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,180 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:47:35,181 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:47:35,182 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:47:35,183 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:47:35,183 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:47:35,183 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:47:35,183 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:47:35,183 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:47:35,183 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:47:35,183 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:47:35,183 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:47:35,183 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:47:35,184 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:47:35,184 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:47:35,184 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:47:35,184 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,184 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,184 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,184 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,184 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,184 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:47:35,185 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:47:35,185 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:47:35,185 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:47:35,185 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:47:35,185 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:47:35,185 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:47:35,185 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:47:35,185 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2018-11-07 12:47:35,186 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:47:35,186 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,186 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,186 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,186 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,186 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,186 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:47:35,186 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:47:35,186 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:47:35,187 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:47:35,187 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:47:35,187 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:47:35,187 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:47:35,187 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:47:35,187 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:47:35,187 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:47:35,187 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:47:35,187 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:47:35,188 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:47:35,188 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,188 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,188 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,188 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,188 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,188 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:47:35,188 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,189 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:47:35,190 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,191 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,192 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,192 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,192 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,192 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:47:35,192 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:47:35,192 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:47:35,192 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:47:35,192 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:47:35,193 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:47:35,193 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:47:35,193 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:47:35,193 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,193 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,193 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,193 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,193 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,193 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:47:35,194 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:47:35,194 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:47:35,194 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:47:35,194 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:47:35,194 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:47:35,194 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:47:35,194 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:47:35,194 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:47:35,194 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:47:35,195 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1))) (let ((.cse24 (= 1 ~a7~0)) (.cse13 (= |old(~a20~0)| ~a20~0)) (.cse16 (= |old(~a16~0)| ~a16~0)) (.cse27 (not .cse1)) (.cse18 (= ~a7~0 |old(~a7~0)|)) (.cse17 (= |old(~a8~0)| ~a8~0)) (.cse14 (= ~a17~0 |old(~a17~0)|)) (.cse15 (= 1 |old(~a17~0)|)) (.cse21 (= 1 |old(~a21~0)|))) (let ((.cse2 (not (= 0 |old(~a7~0)|))) (.cse6 (not (= 15 |old(~a8~0)|))) (.cse3 (not .cse21)) (.cse4 (not (= 8 ~a12~0))) (.cse8 (not .cse15)) (.cse19 (= |old(~a7~0)| 1)) (.cse23 (and .cse13 .cse16 .cse27 .cse18 .cse17 .cse14)) (.cse9 (< 13 |old(~a8~0)|)) (.cse25 (and .cse24 .cse17 .cse16)) (.cse10 (= 4 |old(~a16~0)|)) (.cse12 (= 6 |old(~a16~0)|)) (.cse0 (< 0 |old(~a17~0)|)) (.cse11 (and .cse18 .cse17 .cse13 .cse14 .cse16)) (.cse28 (= 13 |old(~a8~0)|)) (.cse7 (< 0 |old(~a20~0)|)) (.cse5 (not (= 1 |old(~a20~0)|))) (.cse22 (not (= 1 |old(~a7~0)|))) (.cse20 (= 1 ~a20~0)) (.cse26 (< |old(~a8~0)| 15))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse5 .cse6 (< |old(~a17~0)| 0))) (or .cse1 (or .cse2 .cse3 .cse4 (< |old(~a20~0)| 0) .cse6 (not (= 5 |old(~a16~0)|)) .cse7) .cse8) (or .cse9 .cse10 .cse5 .cse11 .cse8) (or .cse12 (and .cse13 .cse14) .cse15 .cse7) (or (< 6 |calculate_output_#in~input|) .cse3 (< 15 |old(~a8~0)|) .cse4 .cse8 (and .cse16 .cse1 .cse17 .cse18 .cse14 (= ~a20~0 1)) .cse5 (< 5 |old(~a16~0)|) (< |old(~a16~0)| 4) (< 1 |old(~a7~0)|) (< |old(~a8~0)| 13) (< |old(~a7~0)| 0) (< |calculate_output_#in~input| 1)) (or .cse12 .cse19 .cse20 .cse9 .cse5) (or .cse12 .cse19 .cse9 (and .cse18 .cse17 .cse16)) (or .cse9 .cse5 .cse21 .cse22 .cse0 .cse23) (or .cse12 .cse21 (and .cse24 .cse17 .cse13 .cse14 .cse16) .cse22 .cse7) (or .cse25 .cse22 .cse26) (or .cse12 .cse9 .cse21 .cse22 .cse27 .cse7) (or .cse23 (or .cse12 .cse9 .cse5 .cse21 .cse22)) (or .cse12 .cse25 .cse15 .cse22 .cse7) (or .cse10 .cse5 .cse28 .cse11 .cse15) (or .cse12 .cse11 (not (= |old(~a20~0)| 1)) .cse0) (or .cse11 .cse28 .cse7) (or .cse5 .cse22 .cse20 .cse26))))) [2018-11-07 12:47:35,195 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:47:35,195 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,195 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,195 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,195 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,195 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:47:35,196 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,197 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:47:35,198 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:47:35,199 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:47:35,199 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:47:35,199 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:47:35,199 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:47:35,199 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,199 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,199 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,199 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,199 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:47:35,200 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:47:35,201 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:47:35,201 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:47:35,201 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 12:47:35,201 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:47:35,201 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:47:35,201 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= ~a16~0 5) (= ~a8~0 15) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:47:35,201 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:47:35,202 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a21~0 1))) (let ((.cse1 (<= ~a20~0 0)) (.cse10 (<= ~a17~0 0)) (.cse6 (not .cse3)) (.cse4 (<= ~a8~0 13)) (.cse7 (= 1 ~a7~0)) (.cse5 (not (= ~a16~0 6))) (.cse8 (= 1 ~a20~0)) (.cse11 (not .cse2)) (.cse0 (not (= ~a8~0 13))) (.cse9 (not (= ~a16~0 4)))) (or (and .cse0 .cse1) (and (<= ~a7~0 1) (<= 1 main_~input~0) (<= main_~input~0 6) (<= ~a16~0 5) .cse2 .cse3 (<= ~a8~0 15) (<= 0 ~a7~0) (<= 13 ~a8~0) (<= 4 ~a16~0) (= ~a20~0 1)) (and .cse4 (= ~a7~0 |old(~a7~0)|) .cse5) (and .cse6 .cse7 .cse5 .cse1) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (and .cse4 .cse8 (= ~a17~0 |old(~a17~0)|) .cse9) (not (= 2 ~b~0)) (and (<= ~a8~0 |old(~a8~0)|) .cse7 (<= 15 ~a8~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (and .cse6 .cse7 .cse8 .cse10) (and .cse5 .cse11 .cse1) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (and .cse8 .cse5 .cse10) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse6 .cse4 .cse7 .cse8 .cse5) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)) (and .cse8 .cse11 .cse0 .cse9)))) [2018-11-07 12:47:35,202 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:47:35,202 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:47:35,202 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:47:35,203 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a21~0 1)) (.cse6 (= ~a17~0 1))) (let ((.cse8 (not .cse6)) (.cse3 (not (= ~a8~0 13))) (.cse5 (not (= ~a16~0 4))) (.cse2 (<= ~a20~0 0)) (.cse11 (<= ~a17~0 0)) (.cse9 (not .cse7)) (.cse0 (<= ~a8~0 13)) (.cse10 (= 1 ~a7~0)) (.cse4 (= 1 ~a20~0)) (.cse1 (not (= ~a16~0 6)))) (or (and .cse0 (= ~a7~0 |old(~a7~0)|) .cse1) (and .cse2 .cse3) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (and .cse0 .cse4 (= ~a17~0 |old(~a17~0)|) .cse5) (and (<= ~a7~0 1) (<= ~a16~0 5) .cse6 .cse7 (<= ~a8~0 15) (<= 0 ~a7~0) (<= 13 ~a8~0) (<= 4 ~a16~0) (= ~a20~0 1)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= 22 ~v~0)) (and .cse1 .cse8 .cse2) (and .cse4 .cse8 .cse3 .cse5) (not (= ~c~0 3)) (not (= 1 ~a~0)) (not (= 5 |old(~a16~0)|)) (not (= ~u~0 21)) (not (= |old(~a7~0)| 0)) (not (= 26 ~z~0)) (and .cse9 .cse10 .cse1 .cse2) (not (= 8 ~a12~0)) (not (= 2 ~b~0)) (not (= 25 ~y~0)) (and (<= ~a8~0 |old(~a8~0)|) .cse10 (<= 15 ~a8~0)) (and .cse9 .cse10 .cse4 .cse11) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (and .cse4 .cse1 .cse11) (not (= 15 |old(~a8~0)|)) (and .cse9 .cse0 .cse10 .cse4 .cse1) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-11-07 12:47:35,203 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:47:35,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:47:35 BoogieIcfgContainer [2018-11-07 12:47:35,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:47:35,218 INFO L168 Benchmark]: Toolchain (without parser) took 146257.95 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.6 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-11-07 12:47:35,219 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:47:35,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.37 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-07 12:47:35,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 12:47:35,222 INFO L168 Benchmark]: Boogie Preprocessor took 106.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2018-11-07 12:47:35,222 INFO L168 Benchmark]: RCFGBuilder took 3312.20 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: 102.1 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2018-11-07 12:47:35,223 INFO L168 Benchmark]: TraceAbstraction took 141997.00 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.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 12:47:35,228 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.16 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 692.37 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 144.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3312.20 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: 102.1 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141997.00 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.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6)) || (a20 <= 0 && !(a8 == 13))) || !(1 == \old(a21))) || !(4 == d)) || (((a8 <= 13 && 1 == a20) && a17 == \old(a17)) && !(a16 == 4))) || ((((((((a7 <= 1 && a16 <= 5) && a17 == 1) && a21 == 1) && a8 <= 15) && 0 <= a7) && 13 <= a8) && 4 <= a16) && a20 == 1)) || !(x == 24)) || !(e == 5)) || !(22 == v)) || ((!(a16 == 6) && !(a17 == 1)) && a20 <= 0)) || (((1 == a20 && !(a17 == 1)) && !(a8 == 13)) && !(a16 == 4))) || !(c == 3)) || !(1 == a)) || !(5 == \old(a16))) || !(u == 21)) || !(\old(a7) == 0)) || !(26 == z)) || (((!(a21 == 1) && 1 == a7) && !(a16 == 6)) && a20 <= 0)) || !(8 == a12)) || !(2 == b)) || !(25 == y)) || ((a8 <= \old(a8) && 1 == a7) && 15 <= a8)) || (((!(a21 == 1) && 1 == a7) && 1 == a20) && a17 <= 0)) || !(\old(a20) == 1)) || !(23 == w)) || ((1 == a20 && !(a16 == 6)) && a17 <= 0)) || !(15 == \old(a8))) || ((((!(a21 == 1) && a8 <= 13) && 1 == a7) && 1 == a20) && !(a16 == 6))) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 141.9s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 84.5s AutomataDifference, 0.0s DeadEndRemovalTime, 15.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1552 SDtfs, 12160 SDslu, 1961 SDs, 0 SdLazy, 17033 SolverSat, 2736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.7s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2313 GetRequests, 2067 SyntacticMatches, 59 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8683occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 22.3s AbstIntTime, 6 AbstIntIterations, 3 AbstIntStrong, 0.9969372573208243 AbsIntWeakeningRatio, 0.23828920570264767 AbsIntAvgWeakeningVarsNumRemoved, 22.380855397148675 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 863 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 482 PreInvPairs, 940 NumberOfFragments, 1157 HoareAnnotationTreeSize, 482 FomulaSimplifications, 23487 FormulaSimplificationTreeSizeReduction, 3.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 30053 FormulaSimplificationTreeSizeReductionInter, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2561 NumberOfCodeBlocks, 2494 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3349 ConstructedInterpolants, 0 QuantifiedInterpolants, 1172995 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2190 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 2231/2540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...