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_label25_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:08:57,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:08:57,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:08:57,339 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:08:57,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:08:57,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:08:57,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:08:57,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:08:57,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:08:57,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:08:57,348 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:08:57,348 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:08:57,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:08:57,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:08:57,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:08:57,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:08:57,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:08:57,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:08:57,359 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:08:57,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:08:57,362 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:08:57,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:08:57,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:08:57,368 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:08:57,368 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:08:57,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:08:57,370 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:08:57,371 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:08:57,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:08:57,374 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:08:57,374 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:08:57,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:08:57,375 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:08:57,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:08:57,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:08:57,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:08:57,378 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:08:57,395 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:08:57,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:08:57,396 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:08:57,397 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:08:57,397 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:08:57,397 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:08:57,398 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:08:57,398 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:08:57,398 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:08:57,398 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:08:57,399 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:08:57,399 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:08:57,399 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:08:57,400 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:08:57,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:08:57,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:08:57,400 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:08:57,401 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:08:57,401 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:08:57,401 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:08:57,401 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:08:57,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:08:57,402 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:08:57,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:08:57,402 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:08:57,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:08:57,403 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:08:57,403 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:08:57,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:08:57,403 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:08:57,403 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:08:57,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:08:57,404 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:08:57,404 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:08:57,404 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:08:57,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:08:57,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:08:57,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:08:57,489 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:08:57,490 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:08:57,490 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2018-11-12 17:08:57,557 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6780c4cd7/4e1b9f8cc730476a81613f85a7cfc048/FLAGe16bb8692 [2018-11-12 17:08:58,145 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:08:58,147 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2018-11-12 17:08:58,161 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6780c4cd7/4e1b9f8cc730476a81613f85a7cfc048/FLAGe16bb8692 [2018-11-12 17:08:58,177 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6780c4cd7/4e1b9f8cc730476a81613f85a7cfc048 [2018-11-12 17:08:58,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:08:58,192 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:08:58,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:08:58,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:08:58,203 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:08:58,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:08:58" (1/1) ... [2018-11-12 17:08:58,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197196bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58, skipping insertion in model container [2018-11-12 17:08:58,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:08:58" (1/1) ... [2018-11-12 17:08:58,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:08:58,289 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:08:58,770 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:08:58,777 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:08:58,903 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:08:58,929 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:08:58,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58 WrapperNode [2018-11-12 17:08:58,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:08:58,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:08:58,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:08:58,931 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:08:58,943 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:08:58" (1/1) ... [2018-11-12 17:08:58,976 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:08:58" (1/1) ... [2018-11-12 17:08:59,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:08:59,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:08:59,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:08:59,087 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:08:59,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58" (1/1) ... [2018-11-12 17:08:59,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58" (1/1) ... [2018-11-12 17:08:59,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58" (1/1) ... [2018-11-12 17:08:59,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58" (1/1) ... [2018-11-12 17:08:59,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58" (1/1) ... [2018-11-12 17:08:59,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58" (1/1) ... [2018-11-12 17:08:59,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58" (1/1) ... [2018-11-12 17:08:59,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:08:59,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:08:59,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:08:59,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:08:59,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:08:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:08:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:08:59,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:08:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:08:59,284 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:08:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:08:59,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:08:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:08:59,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:09:02,502 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:09:02,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:02 BoogieIcfgContainer [2018-11-12 17:09:02,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:09:02,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:09:02,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:09:02,509 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:09:02,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:08:58" (1/3) ... [2018-11-12 17:09:02,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482998f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:02, skipping insertion in model container [2018-11-12 17:09:02,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:58" (2/3) ... [2018-11-12 17:09:02,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482998f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:02, skipping insertion in model container [2018-11-12 17:09:02,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:02" (3/3) ... [2018-11-12 17:09:02,513 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label25_true-unreach-call_false-termination.c [2018-11-12 17:09:02,525 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:09:02,539 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:09:02,559 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:09:02,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:09:02,614 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:09:02,614 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:09:02,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:09:02,615 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:09:02,615 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:09:02,615 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:09:02,616 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:09:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-12 17:09:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-12 17:09:02,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:02,674 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:02,677 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:02,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:02,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1106686112, now seen corresponding path program 1 times [2018-11-12 17:09:02,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:02,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:02,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:02,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:02,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:03,422 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:09:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:03,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:03,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:09:03,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:03,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:09:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:09:03,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:03,612 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-12 17:09:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:05,201 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-12 17:09:05,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:05,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-12 17:09:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:05,224 INFO L225 Difference]: With dead ends: 550 [2018-11-12 17:09:05,224 INFO L226 Difference]: Without dead ends: 340 [2018-11-12 17:09:05,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-12 17:09:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-12 17:09:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-12 17:09:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-11-12 17:09:05,314 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 126 [2018-11-12 17:09:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:05,315 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-11-12 17:09:05,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-11-12 17:09:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-12 17:09:05,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:05,325 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:05,325 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:05,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1635455447, now seen corresponding path program 1 times [2018-11-12 17:09:05,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:05,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:05,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:05,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:05,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:05,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:05,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:09:05,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:05,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:09:05,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:09:05,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:09:05,507 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-11-12 17:09:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:07,257 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-11-12 17:09:07,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:09:07,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2018-11-12 17:09:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:07,274 INFO L225 Difference]: With dead ends: 1079 [2018-11-12 17:09:07,279 INFO L226 Difference]: Without dead ends: 745 [2018-11-12 17:09:07,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 17:09:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-12 17:09:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-11-12 17:09:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-12 17:09:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-11-12 17:09:07,343 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 136 [2018-11-12 17:09:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:07,344 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-11-12 17:09:07,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:09:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-11-12 17:09:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-12 17:09:07,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:07,354 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:07,354 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:07,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:07,354 INFO L82 PathProgramCache]: Analyzing trace with hash 852389443, now seen corresponding path program 1 times [2018-11-12 17:09:07,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:07,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:07,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:07,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:07,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:07,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:07,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:07,737 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-11-12 17:09:07,740 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:07,795 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:07,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:08,508 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:08,511 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Performed 890 root evaluator evaluations with a maximum evaluation depth of 6. Performed 890 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:09:08,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:08,542 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:08,976 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 79.49% of their original sizes. [2018-11-12 17:09:08,977 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:09,678 INFO L415 sIntCurrentIteration]: We unified 145 AI predicates to 145 [2018-11-12 17:09:09,679 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:09,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:09,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-12 17:09:09,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:09,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:09:09,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:09:09,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:09:09,685 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 12 states. [2018-11-12 17:09:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:19,966 INFO L93 Difference]: Finished difference Result 1521 states and 2423 transitions. [2018-11-12 17:09:19,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 17:09:19,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2018-11-12 17:09:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:19,972 INFO L225 Difference]: With dead ends: 1521 [2018-11-12 17:09:19,973 INFO L226 Difference]: Without dead ends: 794 [2018-11-12 17:09:19,975 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:09:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-12 17:09:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2018-11-12 17:09:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-11-12 17:09:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1232 transitions. [2018-11-12 17:09:20,022 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1232 transitions. Word has length 146 [2018-11-12 17:09:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:20,023 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 1232 transitions. [2018-11-12 17:09:20,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:09:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1232 transitions. [2018-11-12 17:09:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-12 17:09:20,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:20,027 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:20,027 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:20,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:20,028 INFO L82 PathProgramCache]: Analyzing trace with hash -768658678, now seen corresponding path program 1 times [2018-11-12 17:09:20,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:20,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:20,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:20,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:20,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:20,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:20,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:20,298 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-11-12 17:09:20,299 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [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], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:20,305 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:20,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:21,260 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:21,261 INFO L272 AbstractInterpreter]: Visited 130 different actions 195 times. Merged at 4 different actions 4 times. Never widened. Performed 2632 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2632 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:09:21,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:21,297 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:21,744 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 80.6% of their original sizes. [2018-11-12 17:09:21,744 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:22,694 INFO L415 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-11-12 17:09:22,694 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:22,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:22,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:09:22,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:22,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:09:22,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:09:22,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:09:22,696 INFO L87 Difference]: Start difference. First operand 794 states and 1232 transitions. Second operand 11 states. [2018-11-12 17:09:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:33,969 INFO L93 Difference]: Finished difference Result 2256 states and 3581 transitions. [2018-11-12 17:09:33,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:09:33,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 148 [2018-11-12 17:09:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:33,977 INFO L225 Difference]: With dead ends: 2256 [2018-11-12 17:09:33,977 INFO L226 Difference]: Without dead ends: 1529 [2018-11-12 17:09:33,981 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:09:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-11-12 17:09:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1504. [2018-11-12 17:09:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2018-11-12 17:09:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2018 transitions. [2018-11-12 17:09:34,024 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2018 transitions. Word has length 148 [2018-11-12 17:09:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:34,025 INFO L480 AbstractCegarLoop]: Abstraction has 1504 states and 2018 transitions. [2018-11-12 17:09:34,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:09:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2018 transitions. [2018-11-12 17:09:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-12 17:09:34,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:34,031 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:34,031 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:34,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1323457638, now seen corresponding path program 1 times [2018-11-12 17:09:34,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:34,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:34,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:34,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:34,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:34,564 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 17:09:34,871 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 17:09:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:34,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:34,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:34,905 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-12 17:09:34,906 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:34,910 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:34,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:35,429 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:35,429 INFO L272 AbstractInterpreter]: Visited 130 different actions 198 times. Merged at 5 different actions 7 times. Never widened. Performed 3883 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3883 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:09:35,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:35,433 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:35,951 INFO L227 lantSequenceWeakener]: Weakened 73 states. On average, predicates are now at 81.64% of their original sizes. [2018-11-12 17:09:35,952 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:36,775 INFO L415 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2018-11-12 17:09:36,776 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:36,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:36,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [7] total 23 [2018-11-12 17:09:36,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:36,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:09:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:09:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:09:36,777 INFO L87 Difference]: Start difference. First operand 1504 states and 2018 transitions. Second operand 18 states. [2018-11-12 17:09:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:50,422 INFO L93 Difference]: Finished difference Result 3226 states and 4399 transitions. [2018-11-12 17:09:50,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 17:09:50,423 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 155 [2018-11-12 17:09:50,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:50,433 INFO L225 Difference]: With dead ends: 3226 [2018-11-12 17:09:50,433 INFO L226 Difference]: Without dead ends: 1789 [2018-11-12 17:09:50,439 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-11-12 17:09:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-11-12 17:09:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1778. [2018-11-12 17:09:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-11-12 17:09:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2323 transitions. [2018-11-12 17:09:50,490 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2323 transitions. Word has length 155 [2018-11-12 17:09:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:50,491 INFO L480 AbstractCegarLoop]: Abstraction has 1778 states and 2323 transitions. [2018-11-12 17:09:50,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:09:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2323 transitions. [2018-11-12 17:09:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-12 17:09:50,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:50,497 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:50,497 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:50,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1685172141, now seen corresponding path program 1 times [2018-11-12 17:09:50,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:50,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:50,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 17:09:50,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:50,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:50,771 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-11-12 17:09:50,771 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:50,775 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:50,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:52,158 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:09:52,159 INFO L272 AbstractInterpreter]: Visited 132 different actions 467 times. Merged at 8 different actions 33 times. Never widened. Performed 7475 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7475 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:09:52,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:52,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:09:52,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:52,169 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:09:52,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:52,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:09:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:52,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:09:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 17:09:52,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:09:53,153 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 17:09:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 17:09:53,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:09:53,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-12 17:09:53,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:09:53,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 17:09:53,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 17:09:53,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:09:53,562 INFO L87 Difference]: Start difference. First operand 1778 states and 2323 transitions. Second operand 8 states. [2018-11-12 17:09:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:57,796 INFO L93 Difference]: Finished difference Result 5547 states and 8025 transitions. [2018-11-12 17:09:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 17:09:57,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2018-11-12 17:09:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:57,813 INFO L225 Difference]: With dead ends: 5547 [2018-11-12 17:09:57,814 INFO L226 Difference]: Without dead ends: 2837 [2018-11-12 17:09:57,831 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-12 17:09:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2018-11-12 17:09:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2731. [2018-11-12 17:09:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2018-11-12 17:09:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3339 transitions. [2018-11-12 17:09:57,927 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 3339 transitions. Word has length 167 [2018-11-12 17:09:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:57,927 INFO L480 AbstractCegarLoop]: Abstraction has 2731 states and 3339 transitions. [2018-11-12 17:09:57,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 17:09:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3339 transitions. [2018-11-12 17:09:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-12 17:09:57,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:57,937 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,937 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:57,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1098274169, now seen corresponding path program 1 times [2018-11-12 17:09:57,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:57,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:57,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:57,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 17:09:58,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:58,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:58,196 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-11-12 17:09:58,197 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [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], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:58,200 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:58,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:58,594 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:58,594 INFO L272 AbstractInterpreter]: Visited 131 different actions 198 times. Merged at 5 different actions 5 times. Never widened. Performed 3170 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3170 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:09:58,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:58,633 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:59,530 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 81.36% of their original sizes. [2018-11-12 17:09:59,531 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:00,989 INFO L415 sIntCurrentIteration]: We unified 193 AI predicates to 193 [2018-11-12 17:10:00,990 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:00,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:00,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-12 17:10:00,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:00,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 17:10:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 17:10:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:10:00,992 INFO L87 Difference]: Start difference. First operand 2731 states and 3339 transitions. Second operand 23 states. [2018-11-12 17:10:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:22,499 INFO L93 Difference]: Finished difference Result 5541 states and 6839 transitions. [2018-11-12 17:10:22,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 17:10:22,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 194 [2018-11-12 17:10:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:22,516 INFO L225 Difference]: With dead ends: 5541 [2018-11-12 17:10:22,516 INFO L226 Difference]: Without dead ends: 3151 [2018-11-12 17:10:22,525 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 17:10:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-11-12 17:10:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2869. [2018-11-12 17:10:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2869 states. [2018-11-12 17:10:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 3481 transitions. [2018-11-12 17:10:22,596 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 3481 transitions. Word has length 194 [2018-11-12 17:10:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:22,596 INFO L480 AbstractCegarLoop]: Abstraction has 2869 states and 3481 transitions. [2018-11-12 17:10:22,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 17:10:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3481 transitions. [2018-11-12 17:10:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-12 17:10:22,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:22,606 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 17:10:22,606 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:22,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1467592292, now seen corresponding path program 1 times [2018-11-12 17:10:22,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:22,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:22,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:22,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:22,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-12 17:10:22,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:22,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:22,825 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-11-12 17:10:22,826 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [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], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:22,828 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:22,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:24,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:10:24,082 INFO L272 AbstractInterpreter]: Visited 133 different actions 473 times. Merged at 9 different actions 35 times. Never widened. Performed 7415 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7415 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:10:24,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:24,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:10:24,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:24,091 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:10:24,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:24,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:10:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:24,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:10:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-12 17:10:24,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:10:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 82 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 17:10:24,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:10:24,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:10:24,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:10:24,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:10:24,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:10:24,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:10:24,539 INFO L87 Difference]: Start difference. First operand 2869 states and 3481 transitions. Second operand 11 states. [2018-11-12 17:10:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:27,343 INFO L93 Difference]: Finished difference Result 10665 states and 13608 transitions. [2018-11-12 17:10:27,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 17:10:27,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 203 [2018-11-12 17:10:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:27,377 INFO L225 Difference]: With dead ends: 10665 [2018-11-12 17:10:27,378 INFO L226 Difference]: Without dead ends: 7815 [2018-11-12 17:10:27,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:10:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7815 states. [2018-11-12 17:10:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7815 to 7642. [2018-11-12 17:10:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7642 states. [2018-11-12 17:10:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7642 states to 7642 states and 9321 transitions. [2018-11-12 17:10:27,608 INFO L78 Accepts]: Start accepts. Automaton has 7642 states and 9321 transitions. Word has length 203 [2018-11-12 17:10:27,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:27,608 INFO L480 AbstractCegarLoop]: Abstraction has 7642 states and 9321 transitions. [2018-11-12 17:10:27,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:10:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7642 states and 9321 transitions. [2018-11-12 17:10:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-12 17:10:27,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:27,633 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:27,633 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:27,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash -266192138, now seen corresponding path program 1 times [2018-11-12 17:10:27,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:27,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:27,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 127 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 17:10:27,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:27,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:27,820 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-11-12 17:10:27,820 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:27,823 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:27,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:28,899 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:28,900 INFO L272 AbstractInterpreter]: Visited 132 different actions 596 times. Merged at 9 different actions 38 times. Never widened. Performed 8564 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8564 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:10:28,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:28,908 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:29,506 INFO L227 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 80.45% of their original sizes. [2018-11-12 17:10:29,506 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:29,603 INFO L415 sIntCurrentIteration]: We unified 223 AI predicates to 223 [2018-11-12 17:10:29,604 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:29,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:29,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-12 17:10:29,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:29,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:10:29,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:10:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:10:29,605 INFO L87 Difference]: Start difference. First operand 7642 states and 9321 transitions. Second operand 11 states. [2018-11-12 17:10:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:35,428 INFO L93 Difference]: Finished difference Result 15558 states and 19254 transitions. [2018-11-12 17:10:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 17:10:35,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2018-11-12 17:10:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:35,429 INFO L225 Difference]: With dead ends: 15558 [2018-11-12 17:10:35,429 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:10:35,466 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 235 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:10:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:10:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:10:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:10:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:10:35,468 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2018-11-12 17:10:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:35,468 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:10:35,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:10:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:10:35,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:10:35,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:10:35,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,640 WARN L179 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 216 [2018-11-12 17:10:36,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:36,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:37,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:37,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:37,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:37,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:37,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:37,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:37,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:37,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:37,099 WARN L179 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 191 [2018-11-12 17:10:37,647 WARN L179 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-11-12 17:10:38,116 WARN L179 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2018-11-12 17:10:46,581 WARN L179 SmtUtils]: Spent 8.44 s on a formula simplification. DAG size of input: 365 DAG size of output: 145 [2018-11-12 17:10:48,190 WARN L179 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 243 DAG size of output: 126 [2018-11-12 17:10:49,447 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 220 DAG size of output: 113 [2018-11-12 17:10:49,450 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:10:49,451 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0)) [2018-11-12 17:10:49,451 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:10:49,451 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-12 17:10:49,451 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-12 17:10:49,451 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,451 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,451 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,452 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,452 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,452 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,452 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-12 17:10:49,452 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-12 17:10:49,452 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-12 17:10:49,452 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-12 17:10:49,452 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-12 17:10:49,452 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-12 17:10:49,453 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-12 17:10:49,453 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-12 17:10:49,453 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-12 17:10:49,453 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-12 17:10:49,453 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,453 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,453 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,453 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,453 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,454 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,454 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-12 17:10:49,454 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-12 17:10:49,454 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-12 17:10:49,454 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-12 17:10:49,454 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-12 17:10:49,454 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-12 17:10:49,454 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,455 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,456 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,456 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,456 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,456 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-12 17:10:49,456 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-12 17:10:49,456 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-12 17:10:49,456 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-12 17:10:49,456 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,457 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-12 17:10:49,458 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-12 17:10:49,458 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-12 17:10:49,458 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-12 17:10:49,458 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-12 17:10:49,458 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-12 17:10:49,458 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-12 17:10:49,458 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-12 17:10:49,458 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-12 17:10:49,458 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-12 17:10:49,459 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-12 17:10:49,461 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-12 17:10:49,461 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-12 17:10:49,461 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,461 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,461 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-12 17:10:49,462 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-12 17:10:49,463 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2018-11-12 17:10:49,464 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-12 17:10:49,465 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-12 17:10:49,466 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-12 17:10:49,467 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-12 17:10:49,467 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-12 17:10:49,467 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse41 (= 1 |old(~a20~0)|))) (let ((.cse10 (= ~a17~0 1)) (.cse22 (= ~a21~0 1)) (.cse34 (<= 4 ~a16~0)) (.cse43 (< |old(~a16~0)| 5)) (.cse15 (not (= 15 |old(~a8~0)|))) (.cse11 (not (= 0 |old(~a7~0)|))) (.cse12 (not (= 1 |old(~a21~0)|))) (.cse37 (not .cse41)) (.cse44 (not (= 0 |old(~a17~0)|))) (.cse42 (not (= 4 |old(~a16~0)|))) (.cse0 (= 1 ~a7~0)) (.cse1 (= |old(~a8~0)| ~a8~0)) (.cse2 (= |old(~a20~0)| ~a20~0))) (let ((.cse32 (<= 0 ~a20~0)) (.cse35 (<= ~a20~0 0)) (.cse17 (< |old(~a20~0)| 0)) (.cse36 (< 0 |old(~a20~0)|)) (.cse6 (and .cse0 .cse1 .cse2)) (.cse19 (and (or .cse11 .cse12 .cse43 .cse15) (or .cse11 .cse12 .cse37 .cse44 .cse42 (not (= 14 |old(~a8~0)|))))) (.cse8 (< |old(~a20~0)| 1)) (.cse16 (< 1 |old(~a20~0)|)) (.cse27 (< |old(~a8~0)| 14)) (.cse23 (< 1 |old(~a17~0)|)) (.cse29 (<= 0 ~a17~0)) (.cse30 (<= ~a17~0 1)) (.cse33 (<= ~a16~0 6)) (.cse25 (< |old(~a17~0)| 0)) (.cse5 (not (= 1 |old(~a7~0)|))) (.cse21 (= ~a16~0 4)) (.cse26 (< 15 |old(~a8~0)|)) (.cse24 (< 6 |old(~a16~0)|)) (.cse20 (= ~a17~0 0)) (.cse9 (< 6 |calculate_output_#in~input|)) (.cse13 (not (= 8 ~a12~0))) (.cse14 (not (= 1 |old(~a17~0)|))) (.cse39 (and (<= ~a16~0 5) .cse10 .cse22 .cse34)) (.cse38 (< 5 |old(~a16~0)|)) (.cse28 (< |old(~a16~0)| 4)) (.cse40 (< |old(~a8~0)| 13)) (.cse18 (< |calculate_output_#in~input| 1)) (.cse4 (= 6 |old(~a16~0)|)) (.cse7 (< 13 |old(~a8~0)|)) (.cse31 (= ~a7~0 |old(~a7~0)|)) (.cse3 (not (= ~a16~0 6)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse5) (or .cse4 .cse7 .cse2) (or .cse9 .cse10 (or .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 5 |old(~a16~0)|))) .cse16 .cse17 .cse18) (or .cse9 .cse19 (or (and .cse20 .cse21 (= ~a8~0 14) (= ~a20~0 1)) (and (= ~a8~0 15) (<= 5 ~a16~0) .cse22)) .cse13 .cse23 .cse16 .cse17 .cse24 .cse25 .cse18) (or .cse4 .cse9 .cse11 .cse12 .cse26 .cse27 .cse13 .cse23 .cse17 .cse24 .cse28 (and .cse29 .cse22 .cse30 .cse31 .cse1 .cse32 .cse33 .cse3 .cse34 .cse35) .cse25 .cse36 .cse18) (or .cse9 .cse12 .cse26 .cse13 .cse14 .cse37 .cse38 .cse28 .cse39 .cse5 .cse40 .cse18) (or .cse9 .cse19 .cse13 .cse23 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse35) .cse17 .cse24 .cse25 .cse36 .cse18) (or .cse6 .cse5 .cse41 (< |old(~a8~0)| 15)) (or .cse9 .cse19 .cse8 .cse13 .cse23 .cse16 .cse24 .cse25 (and .cse29 .cse30 .cse31 .cse1 .cse33 (<= ~a20~0 1) (<= 1 ~a20~0)) .cse18) (or .cse4 .cse9 .cse11 .cse12 .cse26 .cse27 .cse13 .cse23 .cse24 .cse37 (and .cse29 .cse2 .cse22 .cse30 .cse31 .cse1 .cse33 .cse3 .cse34) .cse28 .cse25 .cse18) (or .cse9 (or .cse12 .cse42 (not (= 13 |old(~a8~0)|))) .cse13 .cse14 .cse37 .cse5 .cse18 .cse21) (or .cse12 .cse26 .cse13 .cse37 .cse28 .cse18 .cse9 .cse11 .cse10 .cse14 .cse38 .cse40) (or .cse7 .cse37 (and .cse31 .cse1 .cse2)) (or .cse9 (or .cse11 .cse12 .cse43 .cse15 .cse44 .cse13) .cse24 .cse37 .cse20 .cse18) (or .cse9 .cse12 .cse7 .cse13 .cse14 .cse39 .cse37 .cse38 .cse28 (< 1 |old(~a7~0)|) .cse40 (< |old(~a7~0)| 0) .cse18) (or .cse4 .cse7 (and .cse31 .cse1 .cse3)))))) [2018-11-12 17:10:49,467 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-12 17:10:49,467 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,467 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,467 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-12 17:10:49,468 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-12 17:10:49,469 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,470 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-12 17:10:49,471 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-12 17:10:49,472 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:10:49,472 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:10:49,472 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:10:49,472 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:10:49,472 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (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:10:49,472 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:10:49,473 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a8~0 13)) (.cse1 (not (= ~a16~0 6))) (.cse10 (= 1 ~a7~0)) (.cse3 (<= 1 main_~input~0)) (.cse4 (<= main_~input~0 6)) (.cse2 (<= 0 ~a17~0)) (.cse7 (<= 0 ~a20~0)) (.cse8 (<= ~a16~0 6)) (.cse5 (= ~a21~0 1)) (.cse6 (<= ~a17~0 1)) (.cse9 (<= ~a20~0 1))) (or (and .cse0 .cse1) (and .cse0 (= |old(~a20~0)| ~a20~0)) (and .cse2 .cse3 .cse4 .cse5 (<= ~a8~0 15) .cse6 (= ~a7~0 0) .cse7 .cse1 .cse8 (<= 4 ~a16~0) .cse9) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse0 .cse10 (<= 1 ~a20~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse10 .cse1) (not (= 21 ~u~0)) (and (<= ~a8~0 |old(~a8~0)|) .cse10 (not (= ~a20~0 1)) (<= 15 ~a8~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (and .cse3 .cse4 (= ~a7~0 |old(~a7~0)|) (and .cse2 (= ~a8~0 15) .cse7 .cse8 (<= 5 ~a16~0) .cse5 .cse6) .cse9) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-12 17:10:49,473 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-12 17:10:49,473 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-12 17:10:49,473 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-12 17:10:49,473 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1)) (.cse4 (= ~a7~0 0)) (.cse8 (<= 0 ~a17~0)) (.cse12 (<= 0 ~a20~0)) (.cse18 (= ~a8~0 15)) (.cse5 (<= ~a16~0 6)) (.cse15 (= ~a12~0 8)) (.cse19 (<= 5 ~a16~0)) (.cse2 (= ~a21~0 1)) (.cse13 (<= ~a20~0 1)) (.cse11 (<= ~a17~0 1))) (let ((.cse0 (<= ~a8~0 13)) (.cse14 (= 1 ~a7~0)) (.cse3 (<= ~a8~0 15)) (.cse1 (not (= ~a16~0 6))) (.cse6 (<= 4 ~a16~0)) (.cse17 (<= ~a20~0 0)) (.cse16 (or (and .cse4 (= ~a17~0 0) (= ~a16~0 4) (= ~a8~0 14) .cse15 .cse2 .cse7) (and .cse4 .cse8 .cse12 .cse18 .cse5 .cse15 .cse19 .cse2 .cse13 .cse11))) (.cse9 (<= 1 main_~input~0)) (.cse10 (<= main_~input~0 6))) (or (and .cse0 .cse1) (and (= ~a17~0 1) .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 .cse7) (and .cse0 (= |old(~a20~0)| ~a20~0)) (and .cse8 .cse9 .cse10 .cse2 .cse3 .cse11 .cse4 .cse12 .cse1 .cse5 .cse6 .cse13) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse0 .cse14 (<= 1 ~a20~0)) (not (= ~x~0 24)) (not .cse15) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse14 .cse1) (not (= 21 ~u~0)) (and (<= ~a8~0 |old(~a8~0)|) .cse14 (not .cse7) (<= 15 ~a8~0)) (not (= 22 ~v~0)) (and .cse1 .cse16) (and .cse8 .cse2 .cse3 .cse11 .cse4 .cse12 .cse1 .cse5 .cse6 .cse17) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse17 .cse16) (not (= 0 |old(~a7~0)|)) (and .cse9 .cse10 .cse2 .cse11 (and .cse8 .cse18 .cse19) (= ~a7~0 |old(~a7~0)|) .cse12 .cse5 .cse13) (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))))) [2018-11-12 17:10:49,473 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:10:49,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:10:49 BoogieIcfgContainer [2018-11-12 17:10:49,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:10:49,492 INFO L168 Benchmark]: Toolchain (without parser) took 111302.39 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -850.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:10:49,493 INFO L168 Benchmark]: CDTParser took 0.20 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:10:49,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:10:49,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-11-12 17:10:49,495 INFO L168 Benchmark]: Boogie Preprocessor took 109.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:10:49,496 INFO L168 Benchmark]: RCFGBuilder took 3307.08 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: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB. [2018-11-12 17:10:49,497 INFO L168 Benchmark]: TraceAbstraction took 106986.45 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -178.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:10:49,502 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.20 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 737.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 155.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3307.08 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: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106986.45 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -178.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((a8 <= 13 && !(a16 == 6)) || (((((((a17 == 1 && a21 == 1) && a8 <= 15) && a7 == 0) && a16 <= 6) && !(a16 == 6)) && 4 <= a16) && a20 == 1)) || (a8 <= 13 && \old(a20) == a20)) || (((((((((((0 <= a17 && 1 <= input) && input <= 6) && a21 == 1) && a8 <= 15) && a17 <= 1) && a7 == 0) && 0 <= a20) && !(a16 == 6)) && a16 <= 6) && 4 <= a16) && a20 <= 1)) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || ((a8 <= 13 && 1 == a7) && 1 <= a20)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || (1 == a7 && !(a16 == 6))) || !(21 == u)) || (((a8 <= \old(a8) && 1 == a7) && !(a20 == 1)) && 15 <= a8)) || !(22 == v)) || (!(a16 == 6) && (((((((a7 == 0 && a17 == 0) && a16 == 4) && a8 == 14) && a12 == 8) && a21 == 1) && a20 == 1) || (((((((((a7 == 0 && 0 <= a17) && 0 <= a20) && a8 == 15) && a16 <= 6) && a12 == 8) && 5 <= a16) && a21 == 1) && a20 <= 1) && a17 <= 1)))) || (((((((((0 <= a17 && a21 == 1) && a8 <= 15) && a17 <= 1) && a7 == 0) && 0 <= a20) && !(a16 == 6)) && a16 <= 6) && 4 <= a16) && a20 <= 0)) || !(z == 26)) || !(\old(a16) == 5)) || (a20 <= 0 && (((((((a7 == 0 && a17 == 0) && a16 == 4) && a8 == 14) && a12 == 8) && a21 == 1) && a20 == 1) || (((((((((a7 == 0 && 0 <= a17) && 0 <= a20) && a8 == 15) && a16 <= 6) && a12 == 8) && 5 <= a16) && a21 == 1) && a20 <= 1) && a17 <= 1)))) || !(0 == \old(a7))) || ((((((((1 <= input && input <= 6) && a21 == 1) && a17 <= 1) && (0 <= a17 && a8 == 15) && 5 <= a16) && a7 == \old(a7)) && 0 <= a20) && a16 <= 6) && a20 <= 1)) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 106.8s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 73.1s AutomataDifference, 0.0s DeadEndRemovalTime, 13.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1509 SDtfs, 9967 SDslu, 1940 SDs, 0 SdLazy, 12873 SolverSat, 2299 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.0s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1745 GetRequests, 1554 SyntacticMatches, 11 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7642occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.5s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9973835918788864 AbsIntWeakeningRatio, 0.21693735498839908 AbsIntAvgWeakeningVarsNumRemoved, 24.155452436194896 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 609 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 193 PreInvPairs, 346 NumberOfFragments, 1612 HoareAnnotationTreeSize, 193 FomulaSimplifications, 15750 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16115 FormulaSimplificationTreeSizeReductionInter, 12.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1869 NumberOfCodeBlocks, 1869 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2226 ConstructedInterpolants, 0 QuantifiedInterpolants, 757878 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1103 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 792/916 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...