java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:09:47,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:09:47,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:09:47,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:09:47,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:09:47,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:09:47,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:09:47,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:09:47,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:09:47,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:09:47,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:09:47,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:09:47,335 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:09:47,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:09:47,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:09:47,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:09:47,341 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:09:47,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:09:47,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:09:47,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:09:47,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:09:47,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:09:47,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:09:47,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:09:47,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:09:47,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:09:47,359 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:09:47,360 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:09:47,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:09:47,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:09:47,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:09:47,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:09:47,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:09:47,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:09:47,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:09:47,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:09:47,365 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:09:47,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:09:47,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:09:47,393 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:09:47,394 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:09:47,394 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:09:47,394 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:09:47,394 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:09:47,395 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:09:47,395 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:09:47,395 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:09:47,395 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:09:47,395 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:09:47,395 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:09:47,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:09:47,396 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:09:47,397 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:09:47,397 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:09:47,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:09:47,397 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:09:47,397 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:09:47,398 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:09:47,398 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:09:47,398 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:09:47,398 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:09:47,398 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:09:47,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:09:47,399 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:09:47,399 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:09:47,399 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:09:47,399 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:09:47,399 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:09:47,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:09:47,400 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:09:47,400 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:09:47,400 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:09:47,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:09:47,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:09:47,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:09:47,482 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:09:47,482 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:09:47,483 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-11-12 17:09:47,552 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd82e149/1917811011174e76bb7aab7b6d54f102/FLAG18fd6bc12 [2018-11-12 17:09:48,091 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:09:48,092 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-11-12 17:09:48,109 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd82e149/1917811011174e76bb7aab7b6d54f102/FLAG18fd6bc12 [2018-11-12 17:09:48,123 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd82e149/1917811011174e76bb7aab7b6d54f102 [2018-11-12 17:09:48,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:09:48,135 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:09:48,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:09:48,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:09:48,140 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:09:48,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:48,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65124975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48, skipping insertion in model container [2018-11-12 17:09:48,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:48,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:09:48,211 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:09:48,760 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:09:48,765 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:09:48,858 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:09:48,875 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:09:48,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48 WrapperNode [2018-11-12 17:09:48,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:09:48,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:09:48,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:09:48,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:09:48,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:49,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:49,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:09:49,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:09:49,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:09:49,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:09:49,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:49,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:49,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:49,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:49,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:49,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:49,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... [2018-11-12 17:09:49,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:09:49,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:09:49,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:09:49,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:09:49,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:09:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:09:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:09:49,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:09:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:09:49,184 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:09:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:09:49,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:09:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:09:49,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:09:52,243 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:09:52,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:52 BoogieIcfgContainer [2018-11-12 17:09:52,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:09:52,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:09:52,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:09:52,249 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:09:52,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:09:48" (1/3) ... [2018-11-12 17:09:52,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae7c10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:52, skipping insertion in model container [2018-11-12 17:09:52,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:48" (2/3) ... [2018-11-12 17:09:52,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae7c10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:52, skipping insertion in model container [2018-11-12 17:09:52,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:52" (3/3) ... [2018-11-12 17:09:52,253 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label42_true-unreach-call_false-termination.c [2018-11-12 17:09:52,264 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:09:52,274 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:09:52,290 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:09:52,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:09:52,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:09:52,329 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:09:52,330 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:09:52,330 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:09:52,332 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:09:52,332 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:09:52,332 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:09:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-12 17:09:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-12 17:09:52,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:52,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:52,378 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:52,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1053299728, now seen corresponding path program 1 times [2018-11-12 17:09:52,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:52,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:52,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:52,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:52,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:53,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:53,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:09:53,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:53,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:09:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:09:53,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:53,221 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-12 17:09:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:54,946 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-12 17:09:54,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:54,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-11-12 17:09:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:54,968 INFO L225 Difference]: With dead ends: 550 [2018-11-12 17:09:54,968 INFO L226 Difference]: Without dead ends: 340 [2018-11-12 17:09:54,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12 17:09:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-12 17:09:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-12 17:09:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-12 17:09:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-11-12 17:09:55,065 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 122 [2018-11-12 17:09:55,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:55,066 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-11-12 17:09:55,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-11-12 17:09:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-12 17:09:55,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:55,076 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:55,076 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:55,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash -693386961, now seen corresponding path program 1 times [2018-11-12 17:09:55,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:55,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:55,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:55,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:55,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:55,320 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-12 17:09:55,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:55,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:09:55,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:55,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:09:55,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:09:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:09:55,324 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-11-12 17:09:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:57,439 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-11-12 17:09:57,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:09:57,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-11-12 17:09:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:57,453 INFO L225 Difference]: With dead ends: 1075 [2018-11-12 17:09:57,453 INFO L226 Difference]: Without dead ends: 741 [2018-11-12 17:09:57,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:09:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-12 17:09:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-11-12 17:09:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-12 17:09:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-11-12 17:09:57,520 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 133 [2018-11-12 17:09:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:57,521 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-11-12 17:09:57,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:09:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-11-12 17:09:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-12 17:09:57,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:57,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:57,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:57,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash -214566269, now seen corresponding path program 1 times [2018-11-12 17:09:57,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:57,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:57,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:57,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:57,964 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-12 17:09:57,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:57,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:09:57,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:57,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:09:57,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:09:57,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:09:57,966 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 5 states. [2018-11-12 17:10:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:00,208 INFO L93 Difference]: Finished difference Result 1578 states and 2533 transitions. [2018-11-12 17:10:00,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:10:00,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-11-12 17:10:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:00,216 INFO L225 Difference]: With dead ends: 1578 [2018-11-12 17:10:00,216 INFO L226 Difference]: Without dead ends: 721 [2018-11-12 17:10:00,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:10:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-12 17:10:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-12 17:10:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-12 17:10:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1069 transitions. [2018-11-12 17:10:00,257 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1069 transitions. Word has length 134 [2018-11-12 17:10:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:00,257 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 1069 transitions. [2018-11-12 17:10:00,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:10:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1069 transitions. [2018-11-12 17:10:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-12 17:10:00,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:00,264 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:00,265 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:00,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash -441297109, now seen corresponding path program 1 times [2018-11-12 17:10:00,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:00,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:00,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:01,161 WARN L179 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-12 17:10:01,479 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-12 17:10:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:10:01,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:10:01,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:10:01,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:01,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:10:01,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:10:01,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:10:01,573 INFO L87 Difference]: Start difference. First operand 721 states and 1069 transitions. Second operand 5 states. [2018-11-12 17:10:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:02,680 INFO L93 Difference]: Finished difference Result 1572 states and 2365 transitions. [2018-11-12 17:10:02,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:10:02,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-11-12 17:10:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:02,686 INFO L225 Difference]: With dead ends: 1572 [2018-11-12 17:10:02,687 INFO L226 Difference]: Without dead ends: 720 [2018-11-12 17:10:02,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:10:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-11-12 17:10:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-11-12 17:10:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-11-12 17:10:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2018-11-12 17:10:02,718 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 135 [2018-11-12 17:10:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:02,718 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2018-11-12 17:10:02,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:10:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2018-11-12 17:10:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-12 17:10:02,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:02,722 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:02,722 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:02,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash -689394821, now seen corresponding path program 1 times [2018-11-12 17:10:02,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:02,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:02,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:02,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:02,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:10:02,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:10:02,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:10:02,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:02,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:10:02,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:10:02,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:10:02,906 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 3 states. [2018-11-12 17:10:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:03,487 INFO L93 Difference]: Finished difference Result 1882 states and 2820 transitions. [2018-11-12 17:10:03,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:10:03,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-12 17:10:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:03,505 INFO L225 Difference]: With dead ends: 1882 [2018-11-12 17:10:03,505 INFO L226 Difference]: Without dead ends: 1168 [2018-11-12 17:10:03,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:10:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-11-12 17:10:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1164. [2018-11-12 17:10:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-11-12 17:10:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1592 transitions. [2018-11-12 17:10:03,550 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1592 transitions. Word has length 138 [2018-11-12 17:10:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:03,550 INFO L480 AbstractCegarLoop]: Abstraction has 1164 states and 1592 transitions. [2018-11-12 17:10:03,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:10:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1592 transitions. [2018-11-12 17:10:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-12 17:10:03,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:03,557 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:03,557 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:03,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash -155247930, now seen corresponding path program 1 times [2018-11-12 17:10:03,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:03,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:03,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:10:03,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:03,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:03,787 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-11-12 17:10:03,790 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], [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], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:03,842 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:03,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:04,486 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:04,487 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Performed 880 root evaluator evaluations with a maximum evaluation depth of 6. Performed 880 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 42 variables. [2018-11-12 17:10:04,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:04,531 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:05,148 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 79.64% of their original sizes. [2018-11-12 17:10:05,149 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:06,438 INFO L415 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2018-11-12 17:10:06,439 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:06,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:06,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-12 17:10:06,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:06,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:10:06,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:10:06,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:10:06,442 INFO L87 Difference]: Start difference. First operand 1164 states and 1592 transitions. Second operand 12 states. [2018-11-12 17:10:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:17,216 INFO L93 Difference]: Finished difference Result 2383 states and 3259 transitions. [2018-11-12 17:10:17,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 17:10:17,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2018-11-12 17:10:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:17,223 INFO L225 Difference]: With dead ends: 2383 [2018-11-12 17:10:17,223 INFO L226 Difference]: Without dead ends: 1225 [2018-11-12 17:10:17,227 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:10:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-11-12 17:10:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2018-11-12 17:10:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-12 17:10:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1658 transitions. [2018-11-12 17:10:17,262 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1658 transitions. Word has length 170 [2018-11-12 17:10:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:17,263 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1658 transitions. [2018-11-12 17:10:17,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:10:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1658 transitions. [2018-11-12 17:10:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-12 17:10:17,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:17,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:17,270 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:17,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1006399511, now seen corresponding path program 1 times [2018-11-12 17:10:17,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:17,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:17,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:17,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:17,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:17,772 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:10:17,799 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-12 17:10:17,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:17,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:17,800 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-11-12 17:10:17,800 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], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:17,806 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:17,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:18,679 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:18,680 INFO L272 AbstractInterpreter]: Visited 127 different actions 196 times. Merged at 5 different actions 7 times. Never widened. Performed 3552 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3552 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:10:18,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:18,705 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:19,616 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 81.25% of their original sizes. [2018-11-12 17:10:19,616 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:21,887 INFO L415 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2018-11-12 17:10:21,887 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:21,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:21,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-12 17:10:21,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:21,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 17:10:21,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 17:10:21,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:10:21,889 INFO L87 Difference]: Start difference. First operand 1225 states and 1658 transitions. Second operand 19 states. [2018-11-12 17:10:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:33,197 INFO L93 Difference]: Finished difference Result 2668 states and 3649 transitions. [2018-11-12 17:10:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 17:10:33,198 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 179 [2018-11-12 17:10:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:33,207 INFO L225 Difference]: With dead ends: 2668 [2018-11-12 17:10:33,207 INFO L226 Difference]: Without dead ends: 1510 [2018-11-12 17:10:33,212 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-12 17:10:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-11-12 17:10:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1499. [2018-11-12 17:10:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-11-12 17:10:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1952 transitions. [2018-11-12 17:10:33,266 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1952 transitions. Word has length 179 [2018-11-12 17:10:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:33,267 INFO L480 AbstractCegarLoop]: Abstraction has 1499 states and 1952 transitions. [2018-11-12 17:10:33,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 17:10:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1952 transitions. [2018-11-12 17:10:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-12 17:10:33,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:33,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:33,275 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:33,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:33,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1171173763, now seen corresponding path program 1 times [2018-11-12 17:10:33,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:33,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:33,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:33,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:33,544 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-12 17:10:33,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:33,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:33,545 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-12 17:10:33,545 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], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:33,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:33,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:33,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:33,930 INFO L272 AbstractInterpreter]: Visited 127 different actions 194 times. Merged at 5 different actions 5 times. Never widened. Performed 3102 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3102 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:10:33,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:33,936 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:34,691 INFO L227 lantSequenceWeakener]: Weakened 106 states. On average, predicates are now at 81.04% of their original sizes. [2018-11-12 17:10:34,691 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:36,307 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-11-12 17:10:36,308 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:36,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:36,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-12 17:10:36,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:36,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 17:10:36,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 17:10:36,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-11-12 17:10:36,310 INFO L87 Difference]: Start difference. First operand 1499 states and 1952 transitions. Second operand 25 states. [2018-11-12 17:11:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:00,003 INFO L93 Difference]: Finished difference Result 3077 states and 4069 transitions. [2018-11-12 17:11:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 17:11:00,003 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 212 [2018-11-12 17:11:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:00,012 INFO L225 Difference]: With dead ends: 3077 [2018-11-12 17:11:00,012 INFO L226 Difference]: Without dead ends: 1919 [2018-11-12 17:11:00,017 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 230 GetRequests, 182 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 17:11:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2018-11-12 17:11:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1637. [2018-11-12 17:11:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2018-11-12 17:11:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2094 transitions. [2018-11-12 17:11:00,062 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2094 transitions. Word has length 212 [2018-11-12 17:11:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:00,063 INFO L480 AbstractCegarLoop]: Abstraction has 1637 states and 2094 transitions. [2018-11-12 17:11:00,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 17:11:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2094 transitions. [2018-11-12 17:11:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-12 17:11:00,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:00,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:00,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:00,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:00,072 INFO L82 PathProgramCache]: Analyzing trace with hash -234510368, now seen corresponding path program 1 times [2018-11-12 17:11:00,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:00,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:00,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:00,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:00,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:00,249 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-12 17:11:00,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:00,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:00,250 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-12 17:11:00,250 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], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:00,254 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:00,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:02,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:11:02,023 INFO L272 AbstractInterpreter]: Visited 129 different actions 593 times. Merged at 9 different actions 49 times. Widened at 1 different actions 1 times. Performed 9340 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9340 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:11:02,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:02,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:11:02,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:02,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:11:02,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:02,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:11:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:02,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:11:02,410 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-12 17:11:02,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:11:02,790 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-12 17:11:02,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:11:02,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:11:02,812 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:11:02,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:11:02,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:11:02,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:11:02,814 INFO L87 Difference]: Start difference. First operand 1637 states and 2094 transitions. Second operand 11 states. [2018-11-12 17:11:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:04,865 INFO L93 Difference]: Finished difference Result 3645 states and 4767 transitions. [2018-11-12 17:11:04,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 17:11:04,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 221 [2018-11-12 17:11:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:04,879 INFO L225 Difference]: With dead ends: 3645 [2018-11-12 17:11:04,880 INFO L226 Difference]: Without dead ends: 2213 [2018-11-12 17:11:04,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:11:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2018-11-12 17:11:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2071. [2018-11-12 17:11:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2018-11-12 17:11:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2630 transitions. [2018-11-12 17:11:04,943 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2630 transitions. Word has length 221 [2018-11-12 17:11:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:04,944 INFO L480 AbstractCegarLoop]: Abstraction has 2071 states and 2630 transitions. [2018-11-12 17:11:04,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:11:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2630 transitions. [2018-11-12 17:11:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-12 17:11:04,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:04,954 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, 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] [2018-11-12 17:11:04,955 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:04,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:04,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1971973010, now seen corresponding path program 1 times [2018-11-12 17:11:04,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:04,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:04,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:04,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:04,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:11:05,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:05,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:05,287 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-11-12 17:11:05,287 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], [173], [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], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:05,289 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:05,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:05,798 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:11:05,798 INFO L272 AbstractInterpreter]: Visited 128 different actions 324 times. Merged at 7 different actions 16 times. Never widened. Performed 5144 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5144 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:11:05,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:05,800 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:11:06,236 INFO L227 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 80.39% of their original sizes. [2018-11-12 17:11:06,236 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:11:06,388 INFO L415 sIntCurrentIteration]: We unified 229 AI predicates to 229 [2018-11-12 17:11:06,389 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:11:06,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:11:06,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:11:06,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:06,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:11:06,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:11:06,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:11:06,391 INFO L87 Difference]: Start difference. First operand 2071 states and 2630 transitions. Second operand 11 states. [2018-11-12 17:11:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:12,127 INFO L93 Difference]: Finished difference Result 3941 states and 5087 transitions. [2018-11-12 17:11:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:11:12,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 230 [2018-11-12 17:11:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:12,136 INFO L225 Difference]: With dead ends: 3941 [2018-11-12 17:11:12,136 INFO L226 Difference]: Without dead ends: 2213 [2018-11-12 17:11:12,141 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:11:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2018-11-12 17:11:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2209. [2018-11-12 17:11:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2018-11-12 17:11:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2779 transitions. [2018-11-12 17:11:12,198 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2779 transitions. Word has length 230 [2018-11-12 17:11:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:12,199 INFO L480 AbstractCegarLoop]: Abstraction has 2209 states and 2779 transitions. [2018-11-12 17:11:12,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:11:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2779 transitions. [2018-11-12 17:11:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-12 17:11:12,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:12,209 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, 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] [2018-11-12 17:11:12,209 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:12,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1764877359, now seen corresponding path program 1 times [2018-11-12 17:11:12,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:12,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:12,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 122 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:11:12,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:12,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:12,437 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-11-12 17:11:12,438 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], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [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], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:12,440 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:12,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:12,850 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:11:12,850 INFO L272 AbstractInterpreter]: Visited 127 different actions 194 times. Merged at 5 different actions 5 times. Never widened. Performed 2702 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2702 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:11:12,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:12,860 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:11:13,300 INFO L227 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 80.23% of their original sizes. [2018-11-12 17:11:13,300 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:11:13,578 INFO L415 sIntCurrentIteration]: We unified 233 AI predicates to 233 [2018-11-12 17:11:13,578 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:11:13,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:11:13,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:11:13,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:13,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:11:13,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:11:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:11:13,580 INFO L87 Difference]: Start difference. First operand 2209 states and 2779 transitions. Second operand 18 states. [2018-11-12 17:11:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:24,968 INFO L93 Difference]: Finished difference Result 4076 states and 5225 transitions. [2018-11-12 17:11:24,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:11:24,969 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 234 [2018-11-12 17:11:24,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:24,979 INFO L225 Difference]: With dead ends: 4076 [2018-11-12 17:11:24,979 INFO L226 Difference]: Without dead ends: 2348 [2018-11-12 17:11:24,987 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:11:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2018-11-12 17:11:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2347. [2018-11-12 17:11:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2018-11-12 17:11:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 2924 transitions. [2018-11-12 17:11:25,056 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 2924 transitions. Word has length 234 [2018-11-12 17:11:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:25,057 INFO L480 AbstractCegarLoop]: Abstraction has 2347 states and 2924 transitions. [2018-11-12 17:11:25,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:11:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 2924 transitions. [2018-11-12 17:11:25,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-12 17:11:25,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:25,067 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:25,067 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:25,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:25,067 INFO L82 PathProgramCache]: Analyzing trace with hash -899217277, now seen corresponding path program 1 times [2018-11-12 17:11:25,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:25,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:25,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:25,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:25,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-12 17:11:25,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:25,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:11:25,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:25,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:11:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:11:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:11:25,307 INFO L87 Difference]: Start difference. First operand 2347 states and 2924 transitions. Second operand 3 states. [2018-11-12 17:11:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:26,379 INFO L93 Difference]: Finished difference Result 5690 states and 7373 transitions. [2018-11-12 17:11:26,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:11:26,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-11-12 17:11:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:26,393 INFO L225 Difference]: With dead ends: 5690 [2018-11-12 17:11:26,393 INFO L226 Difference]: Without dead ends: 3686 [2018-11-12 17:11:26,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:11:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2018-11-12 17:11:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3658. [2018-11-12 17:11:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3658 states. [2018-11-12 17:11:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4522 transitions. [2018-11-12 17:11:26,485 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4522 transitions. Word has length 241 [2018-11-12 17:11:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:26,485 INFO L480 AbstractCegarLoop]: Abstraction has 3658 states and 4522 transitions. [2018-11-12 17:11:26,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:11:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4522 transitions. [2018-11-12 17:11:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-12 17:11:26,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:26,499 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:26,499 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:26,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:26,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1082069636, now seen corresponding path program 1 times [2018-11-12 17:11:26,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:26,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:26,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:26,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:26,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 175 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:11:26,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:26,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:26,761 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-11-12 17:11:26,761 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], [105], [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], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:26,764 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:26,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:27,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:11:27,992 INFO L272 AbstractInterpreter]: Visited 129 different actions 591 times. Merged at 9 different actions 47 times. Widened at 1 different actions 1 times. Performed 9180 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9180 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:11:27,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:27,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:11:27,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:27,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:11:28,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:28,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:11:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:28,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:11:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 166 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:11:28,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:11:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:11:28,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:11:28,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-11-12 17:11:28,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:11:28,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:11:28,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:11:28,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:11:28,760 INFO L87 Difference]: Start difference. First operand 3658 states and 4522 transitions. Second operand 11 states. [2018-11-12 17:11:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:32,812 INFO L93 Difference]: Finished difference Result 9040 states and 13296 transitions. [2018-11-12 17:11:32,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 17:11:32,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 246 [2018-11-12 17:11:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:32,824 INFO L225 Difference]: With dead ends: 9040 [2018-11-12 17:11:32,824 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:11:32,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 510 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 17:11:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:11:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:11:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:11:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:11:32,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-11-12 17:11:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:32,892 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:11:32,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:11:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:11:32,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:11:32,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:11:33,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,363 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 145 [2018-11-12 17:11:33,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,556 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 168 [2018-11-12 17:11:34,255 WARN L179 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-11-12 17:11:34,621 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 86 [2018-11-12 17:11:40,980 WARN L179 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 299 DAG size of output: 173 [2018-11-12 17:11:41,498 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 105 [2018-11-12 17:11:42,058 WARN L179 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 105 [2018-11-12 17:11:42,062 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:11:42,062 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a20~0)| ~a20~0) (<= ~a21~0 |old(~a21~0)|) (= |old(~a16~0)| ~a16~0)) [2018-11-12 17:11:42,062 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:11:42,062 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-12 17:11:42,062 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-12 17:11:42,063 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,063 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,063 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,063 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,063 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,063 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,063 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-12 17:11:42,063 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,064 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-12 17:11:42,065 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,066 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,067 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-12 17:11:42,068 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-12 17:11:42,069 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-12 17:11:42,069 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-12 17:11:42,069 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-12 17:11:42,069 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-12 17:11:42,069 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-12 17:11:42,069 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,069 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,069 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,069 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,070 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-12 17:11:42,071 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-12 17:11:42,072 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-12 17:11:42,072 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2018-11-12 17:11:42,072 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-12 17:11:42,072 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-12 17:11:42,072 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-12 17:11:42,072 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-12 17:11:42,072 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-12 17:11:42,072 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,072 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,073 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-12 17:11:42,074 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-12 17:11:42,075 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse4 (= 1 ~a17~0)) (.cse10 (= 1 |old(~a17~0)|))) (let ((.cse1 (not (= 1 |old(~a20~0)|))) (.cse6 (not .cse10)) (.cse20 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse3 (not (= 8 ~a12~0))) (.cse26 (< 1 |old(~a17~0)|)) (.cse9 (= 13 |old(~a8~0)|)) (.cse15 (not (= ~a8~0 13))) (.cse16 (= ~a7~0 |old(~a7~0)|)) (.cse17 (= |old(~a20~0)| ~a20~0)) (.cse8 (not .cse4)) (.cse18 (<= ~a21~0 |old(~a21~0)|)) (.cse19 (= |old(~a16~0)| ~a16~0))) (let ((.cse24 (= ~a17~0 0)) (.cse27 (< |old(~a17~0)| 0)) (.cse14 (< 0 |old(~a21~0)|)) (.cse32 (and .cse16 .cse17 .cse8 .cse18 .cse19)) (.cse12 (= 6 |old(~a16~0)|)) (.cse31 (and .cse16 .cse17 .cse8 .cse18 .cse19 .cse15)) (.cse23 (= ~a21~0 1)) (.cse22 (= ~a8~0 15)) (.cse2 (not (= 4 |old(~a16~0)|))) (.cse5 (not .cse9)) (.cse7 (= 1 |old(~a7~0)|)) (.cse13 (and .cse16 .cse17 .cse18 .cse19)) (.cse25 (< 6 |calculate_output_#in~input|)) (.cse11 (< 0 |old(~a20~0)|)) (.cse29 (and (or .cse20 .cse0 .cse1 .cse3 .cse6) (or .cse20 .cse0 (not (= 0 |old(~a20~0)|)) .cse3 .cse26))) (.cse21 (not (= 15 |old(~a8~0)|))) (.cse30 (not (= 5 |old(~a16~0)|))) (.cse33 (= ~a17~0 1)) (.cse28 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= 13 ~a8~0) (= 1 ~a21~0) .cse4) .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse3 .cse10 .cse11) (or .cse8 .cse7 .cse1 .cse3 .cse10) (or .cse12 .cse13 .cse3 .cse14 .cse11) (or .cse12 .cse1 .cse13 .cse3 .cse14) (or .cse7 .cse1 .cse15 .cse9 .cse3) (or .cse7 .cse9 .cse3 .cse11 (and .cse16 .cse17 .cse18 .cse19 .cse15)) (or (or .cse20 .cse0 (< 6 |old(~a16~0)|) (< |old(~a16~0)| 5) .cse1 .cse21 (not (= 0 |old(~a17~0)|)) .cse3) (and .cse22 .cse23 .cse24)) (or .cse25 (or .cse20 .cse0) .cse2 .cse3 (and .cse22 .cse24 .cse23) .cse26 .cse1 .cse21 .cse27 .cse10 .cse28) (or .cse25 (and (<= 0 ~a17~0) (and .cse22 .cse23) (<= ~a17~0 1)) .cse29 .cse21 .cse30 .cse27 .cse11 .cse28) (or .cse12 .cse31 .cse9 .cse3 .cse10 .cse11) (or .cse32 .cse1 .cse3 .cse10 .cse14) (or .cse7 .cse2 .cse3 .cse10 .cse32 .cse11) (or .cse12 .cse31 .cse1 .cse9 .cse3 .cse10) (or (and .cse23 .cse22 .cse33) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse28 .cse20 .cse25 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or .cse0 .cse1 .cse2 (and (= 1 ~a7~0) (= 1 ~a20~0) .cse19) .cse3 (not .cse7) .cse5 .cse6) (or .cse7 .cse1 .cse13 .cse3) (or .cse25 (or .cse11 .cse6) .cse29 .cse21 .cse30 .cse33 .cse28))))) [2018-11-12 17:11:42,075 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-12 17:11:42,075 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,075 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-12 17:11:42,076 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,077 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-12 17:11:42,078 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-12 17:11:42,079 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-12 17:11:42,079 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-12 17:11:42,079 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-12 17:11:42,079 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-12 17:11:42,079 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-12 17:11:42,079 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-12 17:11:42,079 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-12 17:11:42,079 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,079 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-12 17:11:42,080 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-12 17:11:42,081 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-12 17:11:42,081 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-12 17:11:42,081 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-12 17:11:42,081 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-12 17:11:42,081 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:11:42,081 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-12 17:11:42,081 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:11:42,081 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:11:42,082 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a8~0 15) (= ~a21~0 1) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (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-12 17:11:42,082 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:11:42,082 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse6 (= 1 ~a17~0))) (let ((.cse5 (= 1 ~a20~0)) (.cse0 (<= ~a21~0 0)) (.cse4 (not .cse6)) (.cse1 (not (= ~a16~0 6))) (.cse8 (= |old(~a20~0)| ~a20~0)) (.cse3 (not (= ~a7~0 1))) (.cse2 (<= ~a20~0 0)) (.cse7 (not (= ~a8~0 13)))) (or (and .cse0 .cse1 .cse2) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (and .cse3 .cse4 (= ~a16~0 4) .cse2) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse6) (and .cse0 .cse5 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse5 .cse4 .cse1 .cse7) (and .cse0 .cse8 .cse4) (and .cse4 .cse1 .cse7 .cse2) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse3 .cse8) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (and .cse3 .cse2 .cse7) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))))) [2018-11-12 17:11:42,082 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-12 17:11:42,082 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-12 17:11:42,082 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-12 17:11:42,083 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse6 (= 1 ~a17~0))) (let ((.cse5 (= 1 ~a20~0)) (.cse0 (<= ~a21~0 0)) (.cse4 (not .cse6)) (.cse1 (not (= ~a16~0 6))) (.cse8 (= |old(~a20~0)| ~a20~0)) (.cse3 (not (= ~a7~0 1))) (.cse2 (<= ~a20~0 0)) (.cse7 (not (= ~a8~0 13)))) (or (and .cse0 .cse1 .cse2) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (and .cse3 .cse4 (= ~a16~0 4) .cse2) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse6) (and .cse0 .cse5 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse5 .cse4 .cse1 .cse7) (and .cse0 .cse8 .cse4) (and .cse4 .cse1 .cse7 .cse2) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse3 .cse8) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (and .cse3 .cse2 .cse7) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))))) [2018-11-12 17:11:42,083 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:11:42,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:11:42 BoogieIcfgContainer [2018-11-12 17:11:42,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:11:42,099 INFO L168 Benchmark]: Toolchain (without parser) took 113965.66 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -371.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-12 17:11:42,101 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:11:42,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.58 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:42,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:42,103 INFO L168 Benchmark]: Boogie Preprocessor took 89.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:11:42,103 INFO L168 Benchmark]: RCFGBuilder took 3142.15 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: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:42,104 INFO L168 Benchmark]: TraceAbstraction took 109853.40 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 297.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-12 17:11:42,109 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 740.58 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 135.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 89.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3142.15 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: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109853.40 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 297.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: 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: ((((((((((((((((((((((((((((a21 <= 0 && !(a16 == 6)) && a20 <= 0) || !(\old(a21) == 1)) || !(b == 2)) || (((!(a7 == 1) && !(1 == a17)) && a16 == 4) && a20 <= 0)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || !(21 == u)) || !(22 == v)) || (((1 == a20 && !(1 == a17)) && !(a16 == 6)) && !(a8 == 13))) || ((a21 <= 0 && \old(a20) == a20) && !(1 == a17))) || (((!(1 == a17) && !(a16 == 6)) && !(a8 == 13)) && a20 <= 0)) || !(z == 26)) || !(\old(a16) == 5)) || (!(a7 == 1) && \old(a20) == a20)) || !(0 == \old(a7))) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || ((!(a7 == 1) && a20 <= 0) && !(a8 == 13))) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 109.7s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 78.1s AutomataDifference, 0.0s DeadEndRemovalTime, 9.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1999 SDtfs, 9758 SDslu, 2242 SDs, 0 SdLazy, 14619 SolverSat, 2056 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.2s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2129 GetRequests, 1907 SyntacticMatches, 20 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3658occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.9s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9973965991386534 AbsIntWeakeningRatio, 0.20098039215686275 AbsIntAvgWeakeningVarsNumRemoved, 22.83921568627451 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 489 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 255 PreInvPairs, 555 NumberOfFragments, 1299 HoareAnnotationTreeSize, 255 FomulaSimplifications, 16993 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4319 FormulaSimplificationTreeSizeReductionInter, 8.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2862 NumberOfCodeBlocks, 2862 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3312 ConstructedInterpolants, 0 QuantifiedInterpolants, 2021260 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1235 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 1937/2166 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...