java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:03:12,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:03:12,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:03:12,379 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:03:12,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:03:12,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:03:12,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:03:12,385 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:03:12,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:03:12,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:03:12,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:03:12,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:03:12,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:03:12,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:03:12,403 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:03:12,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:03:12,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:03:12,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:03:12,414 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:03:12,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:03:12,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:03:12,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:03:12,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:03:12,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:03:12,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:03:12,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:03:12,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:03:12,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:03:12,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:03:12,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:03:12,433 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:03:12,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:03:12,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:03:12,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:03:12,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:03:12,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:03:12,437 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:03:12,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:03:12,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:03:12,455 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:03:12,455 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:03:12,455 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:03:12,456 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:03:12,456 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:03:12,456 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:03:12,456 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:03:12,456 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:03:12,457 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:03:12,457 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:03:12,457 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:03:12,457 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:03:12,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:03:12,458 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:03:12,458 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:03:12,458 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:03:12,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:03:12,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:03:12,459 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:03:12,459 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:03:12,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:03:12,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:03:12,460 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:03:12,460 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:03:12,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:03:12,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:03:12,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:03:12,461 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:03:12,461 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:03:12,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:03:12,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:03:12,462 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:03:12,462 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:03:12,462 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:03:12,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:03:12,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:03:12,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:03:12,532 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:03:12,532 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:03:12,533 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-10-25 00:03:12,603 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a1f3fc14b/202b87522b2e4fce9ea61b4408284a77/FLAGbdcab78cf [2018-10-25 00:03:13,158 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:03:13,161 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-10-25 00:03:13,182 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a1f3fc14b/202b87522b2e4fce9ea61b4408284a77/FLAGbdcab78cf [2018-10-25 00:03:13,196 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a1f3fc14b/202b87522b2e4fce9ea61b4408284a77 [2018-10-25 00:03:13,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:03:13,208 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:03:13,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:03:13,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:03:13,215 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:03:13,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:13,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13, skipping insertion in model container [2018-10-25 00:03:13,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:13,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:03:13,295 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:03:13,789 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:03:13,794 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:03:13,928 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:03:13,959 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:03:13,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13 WrapperNode [2018-10-25 00:03:13,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:03:13,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:03:13,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:03:13,961 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:03:13,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:13,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:14,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:03:14,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:03:14,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:03:14,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:03:14,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:14,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:14,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:14,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:14,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:14,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:14,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... [2018-10-25 00:03:14,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:03:14,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:03:14,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:03:14,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:03:14,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:03:14,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:03:14,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:03:14,299 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:03:14,300 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:03:14,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:03:14,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:03:14,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:03:14,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:03:17,848 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:03:17,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:03:17 BoogieIcfgContainer [2018-10-25 00:03:17,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:03:17,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:03:17,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:03:17,853 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:03:17,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:03:13" (1/3) ... [2018-10-25 00:03:17,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b16a889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:03:17, skipping insertion in model container [2018-10-25 00:03:17,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:13" (2/3) ... [2018-10-25 00:03:17,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b16a889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:03:17, skipping insertion in model container [2018-10-25 00:03:17,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:03:17" (3/3) ... [2018-10-25 00:03:17,857 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label42_true-unreach-call_false-termination.c [2018-10-25 00:03:17,865 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:03:17,872 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:03:17,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:03:17,924 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:03:17,925 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:03:17,925 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:03:17,925 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:03:17,925 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:03:17,928 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:03:17,928 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:03:17,928 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:03:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:03:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-25 00:03:17,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:17,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:17,979 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:17,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1053299728, now seen corresponding path program 1 times [2018-10-25 00:03:17,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:18,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:18,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:18,671 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:03:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:18,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:18,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:03:18,830 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:18,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:03:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:03:18,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:18,860 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:03:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:20,765 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:03:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:03:20,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-10-25 00:03:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:20,785 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:03:20,785 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:03:20,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:03:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:03:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:03:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-10-25 00:03:20,903 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 122 [2018-10-25 00:03:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:20,905 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-10-25 00:03:20,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:03:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-10-25 00:03:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-25 00:03:20,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:20,923 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:20,923 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:20,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:20,924 INFO L82 PathProgramCache]: Analyzing trace with hash -693386961, now seen corresponding path program 1 times [2018-10-25 00:03:20,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:20,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:20,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:21,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:21,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:03:21,213 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:21,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:03:21,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:03:21,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:03:21,216 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-10-25 00:03:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:23,044 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-10-25 00:03:23,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:03:23,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-10-25 00:03:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:23,059 INFO L225 Difference]: With dead ends: 1075 [2018-10-25 00:03:23,059 INFO L226 Difference]: Without dead ends: 741 [2018-10-25 00:03:23,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:03:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-25 00:03:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-10-25 00:03:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-25 00:03:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-10-25 00:03:23,127 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 133 [2018-10-25 00:03:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:23,127 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-10-25 00:03:23,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:03:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-10-25 00:03:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 00:03:23,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:23,138 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:23,138 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:23,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash -214566269, now seen corresponding path program 1 times [2018-10-25 00:03:23,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:23,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:23,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:23,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:23,142 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:23,707 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-25 00:03:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:23,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:23,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:03:23,858 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:23,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:03:23,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:03:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:03:23,860 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 5 states. [2018-10-25 00:03:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:26,349 INFO L93 Difference]: Finished difference Result 1578 states and 2533 transitions. [2018-10-25 00:03:26,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:03:26,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-10-25 00:03:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:26,360 INFO L225 Difference]: With dead ends: 1578 [2018-10-25 00:03:26,360 INFO L226 Difference]: Without dead ends: 721 [2018-10-25 00:03:26,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:03:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-10-25 00:03:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-10-25 00:03:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-25 00:03:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1069 transitions. [2018-10-25 00:03:26,406 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1069 transitions. Word has length 134 [2018-10-25 00:03:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:26,407 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1069 transitions. [2018-10-25 00:03:26,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:03:26,407 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1069 transitions. [2018-10-25 00:03:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-25 00:03:26,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:26,413 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:26,413 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:26,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash -441297109, now seen corresponding path program 1 times [2018-10-25 00:03:26,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:26,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:26,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:27,312 WARN L179 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-25 00:03:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:27,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:27,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:03:27,486 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:27,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:03:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:03:27,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:03:27,488 INFO L87 Difference]: Start difference. First operand 721 states and 1069 transitions. Second operand 5 states. [2018-10-25 00:03:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:28,673 INFO L93 Difference]: Finished difference Result 1572 states and 2365 transitions. [2018-10-25 00:03:28,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:03:28,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-10-25 00:03:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:28,680 INFO L225 Difference]: With dead ends: 1572 [2018-10-25 00:03:28,680 INFO L226 Difference]: Without dead ends: 720 [2018-10-25 00:03:28,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:03:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-25 00:03:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-10-25 00:03:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-25 00:03:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2018-10-25 00:03:28,713 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 135 [2018-10-25 00:03:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:28,714 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2018-10-25 00:03:28,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:03:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2018-10-25 00:03:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-25 00:03:28,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:28,717 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:28,717 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:28,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash -689394821, now seen corresponding path program 1 times [2018-10-25 00:03:28,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:28,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:28,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:28,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:28,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:28,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:28,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:03:28,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:28,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:03:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:03:28,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:28,925 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 3 states. [2018-10-25 00:03:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:29,995 INFO L93 Difference]: Finished difference Result 1882 states and 2820 transitions. [2018-10-25 00:03:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:03:30,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-25 00:03:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:30,010 INFO L225 Difference]: With dead ends: 1882 [2018-10-25 00:03:30,010 INFO L226 Difference]: Without dead ends: 1168 [2018-10-25 00:03:30,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-25 00:03:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1164. [2018-10-25 00:03:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-10-25 00:03:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1592 transitions. [2018-10-25 00:03:30,052 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1592 transitions. Word has length 138 [2018-10-25 00:03:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:30,053 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1592 transitions. [2018-10-25 00:03:30,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:03:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1592 transitions. [2018-10-25 00:03:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-25 00:03:30,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:30,060 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:30,061 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:30,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -155247930, now seen corresponding path program 1 times [2018-10-25 00:03:30,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:30,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:30,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:30,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:30,063 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:30,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:30,277 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:30,278 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-10-25 00:03:30,280 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:30,330 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:30,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:30,941 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:30,942 INFO L272 AbstractInterpreter]: Visited 123 different actions 123 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-25 00:03:30,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:30,974 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:31,641 INFO L232 lantSequenceWeakener]: Weakened 161 states. On average, predicates are now at 80.48% of their original sizes. [2018-10-25 00:03:31,642 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:31,911 INFO L413 sIntCurrentIteration]: We have 169 unified AI predicates [2018-10-25 00:03:31,912 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:31,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:31,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:03:31,913 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:31,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:03:31,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:03:31,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:03:31,915 INFO L87 Difference]: Start difference. First operand 1164 states and 1592 transitions. Second operand 6 states. [2018-10-25 00:03:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:40,406 INFO L93 Difference]: Finished difference Result 2460 states and 3350 transitions. [2018-10-25 00:03:40,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:03:40,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-10-25 00:03:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:40,413 INFO L225 Difference]: With dead ends: 2460 [2018-10-25 00:03:40,414 INFO L226 Difference]: Without dead ends: 1302 [2018-10-25 00:03:40,418 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:03:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2018-10-25 00:03:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1300. [2018-10-25 00:03:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-10-25 00:03:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1734 transitions. [2018-10-25 00:03:40,453 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1734 transitions. Word has length 170 [2018-10-25 00:03:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:40,453 INFO L481 AbstractCegarLoop]: Abstraction has 1300 states and 1734 transitions. [2018-10-25 00:03:40,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:03:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1734 transitions. [2018-10-25 00:03:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-25 00:03:40,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:40,460 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:40,460 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:40,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1006399511, now seen corresponding path program 1 times [2018-10-25 00:03:40,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:40,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:40,462 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:03:40,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:40,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:40,688 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-10-25 00:03:40,689 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:40,696 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:40,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:41,133 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:41,133 INFO L272 AbstractInterpreter]: Visited 127 different actions 248 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:03:41,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:41,173 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:41,971 INFO L232 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 80.57% of their original sizes. [2018-10-25 00:03:41,972 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:42,370 INFO L413 sIntCurrentIteration]: We have 178 unified AI predicates [2018-10-25 00:03:42,370 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:42,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:42,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:03:42,371 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:42,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:03:42,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:03:42,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:03:42,372 INFO L87 Difference]: Start difference. First operand 1300 states and 1734 transitions. Second operand 10 states. [2018-10-25 00:03:48,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:48,875 INFO L93 Difference]: Finished difference Result 2599 states and 3521 transitions. [2018-10-25 00:03:48,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:03:48,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2018-10-25 00:03:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:48,883 INFO L225 Difference]: With dead ends: 2599 [2018-10-25 00:03:48,883 INFO L226 Difference]: Without dead ends: 1441 [2018-10-25 00:03:48,887 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:03:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-10-25 00:03:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1438. [2018-10-25 00:03:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-25 00:03:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1882 transitions. [2018-10-25 00:03:48,926 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1882 transitions. Word has length 179 [2018-10-25 00:03:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:48,926 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 1882 transitions. [2018-10-25 00:03:48,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:03:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1882 transitions. [2018-10-25 00:03:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-25 00:03:48,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:48,933 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:48,934 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:48,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1171173763, now seen corresponding path program 1 times [2018-10-25 00:03:48,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:48,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:49,465 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-25 00:03:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:03:49,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:49,666 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:49,667 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-10-25 00:03:49,667 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:49,673 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:49,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:50,092 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:50,093 INFO L272 AbstractInterpreter]: Visited 127 different actions 248 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:03:50,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:50,130 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:51,065 INFO L232 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 80.77% of their original sizes. [2018-10-25 00:03:51,065 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:54,599 INFO L413 sIntCurrentIteration]: We have 211 unified AI predicates [2018-10-25 00:03:54,599 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:54,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:54,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:03:54,600 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:54,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:03:54,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:03:54,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:03:54,601 INFO L87 Difference]: Start difference. First operand 1438 states and 1882 transitions. Second operand 15 states. [2018-10-25 00:04:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:05,614 INFO L93 Difference]: Finished difference Result 3065 states and 4058 transitions. [2018-10-25 00:04:05,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:04:05,614 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 212 [2018-10-25 00:04:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:05,623 INFO L225 Difference]: With dead ends: 3065 [2018-10-25 00:04:05,623 INFO L226 Difference]: Without dead ends: 1907 [2018-10-25 00:04:05,628 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 74 SyntacticMatches, 124 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:04:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2018-10-25 00:04:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1760. [2018-10-25 00:04:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1760 states. [2018-10-25 00:04:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2226 transitions. [2018-10-25 00:04:05,676 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2226 transitions. Word has length 212 [2018-10-25 00:04:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:05,676 INFO L481 AbstractCegarLoop]: Abstraction has 1760 states and 2226 transitions. [2018-10-25 00:04:05,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:04:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2226 transitions. [2018-10-25 00:04:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-25 00:04:05,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:05,684 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:05,685 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:05,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash -234510368, now seen corresponding path program 1 times [2018-10-25 00:04:05,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:05,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:05,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:05,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:05,686 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:04:05,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:05,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:05,878 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-10-25 00:04:05,881 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:05,886 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:05,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:06,931 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:04:06,931 INFO L272 AbstractInterpreter]: Visited 129 different actions 521 times. Merged at 9 different actions 41 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:04:06,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:06,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:04:06,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:06,944 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:04:06,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:06,954 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:04:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:07,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-25 00:04:07,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:04:08,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:04:08,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:04:08,601 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:04:08,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:04:08,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:04:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:04:08,602 INFO L87 Difference]: Start difference. First operand 1760 states and 2226 transitions. Second operand 11 states. [2018-10-25 00:04:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:11,728 INFO L93 Difference]: Finished difference Result 3634 states and 4754 transitions. [2018-10-25 00:04:11,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:04:11,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 221 [2018-10-25 00:04:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:11,745 INFO L225 Difference]: With dead ends: 3634 [2018-10-25 00:04:11,746 INFO L226 Difference]: Without dead ends: 2338 [2018-10-25 00:04:11,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:04:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2018-10-25 00:04:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2330. [2018-10-25 00:04:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2330 states. [2018-10-25 00:04:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 2908 transitions. [2018-10-25 00:04:11,814 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 2908 transitions. Word has length 221 [2018-10-25 00:04:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:11,814 INFO L481 AbstractCegarLoop]: Abstraction has 2330 states and 2908 transitions. [2018-10-25 00:04:11,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:04:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 2908 transitions. [2018-10-25 00:04:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-25 00:04:11,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:11,825 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:11,825 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:11,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash 47880722, now seen corresponding path program 2 times [2018-10-25 00:04:11,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:11,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:11,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:11,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:11,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:04:12,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:12,780 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:12,780 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 00:04:12,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 00:04:12,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:12,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:04:12,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 00:04:12,789 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 00:04:12,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-25 00:04:12,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 00:04:12,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-25 00:04:12,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-25 00:04:13,315 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:13,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:04:13,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:13,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:04:13,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:04:13,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:04:13,316 INFO L87 Difference]: Start difference. First operand 2330 states and 2908 transitions. Second operand 3 states. [2018-10-25 00:04:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:13,984 INFO L93 Difference]: Finished difference Result 5022 states and 6481 transitions. [2018-10-25 00:04:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:04:13,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-10-25 00:04:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:13,987 INFO L225 Difference]: With dead ends: 5022 [2018-10-25 00:04:13,988 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:04:14,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 441 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:04:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:04:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:04:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:04:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:04:14,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 221 [2018-10-25 00:04:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:14,002 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:04:14,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:04:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:04:14,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:04:14,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:04:14,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:14,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:14,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:14,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:14,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:14,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:14,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:15,218 WARN L179 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-10-25 00:04:15,562 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 86 [2018-10-25 00:04:17,164 WARN L179 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 235 DAG size of output: 129 [2018-10-25 00:04:17,466 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 84 [2018-10-25 00:04:17,744 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 84 [2018-10-25 00:04:17,748 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:17,748 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-10-25 00:04:17,748 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:17,749 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:04:17,749 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:04:17,749 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,749 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,749 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,749 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,749 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,749 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,750 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:04:17,750 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:04:17,750 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:04:17,750 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:04:17,750 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:04:17,750 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:04:17,750 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:04:17,750 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:04:17,751 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:04:17,751 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:04:17,751 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,751 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,751 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,751 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,751 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,751 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,751 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:04:17,752 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:04:17,752 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:04:17,752 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:04:17,752 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:04:17,752 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:04:17,752 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:04:17,752 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:04:17,752 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:04:17,753 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:04:17,753 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:04:17,753 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:04:17,753 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:04:17,753 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:04:17,753 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:04:17,753 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,753 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,754 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,754 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,754 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,754 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:04:17,754 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:04:17,754 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:04:17,754 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:04:17,754 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:04:17,754 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:04:17,755 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:04:17,755 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:04:17,755 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:04:17,755 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,755 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,755 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,755 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,755 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,755 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:04:17,756 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:04:17,756 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:04:17,756 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:04:17,756 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:04:17,756 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:04:17,756 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:04:17,756 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:04:17,756 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:04:17,756 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:04:17,757 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:04:17,757 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:04:17,757 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:04:17,757 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,757 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,757 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,757 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,757 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,757 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:04:17,758 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:04:17,758 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:04:17,758 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:04:17,758 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:04:17,758 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:04:17,758 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:04:17,758 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:04:17,758 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2018-10-25 00:04:17,759 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:04:17,759 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,759 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,759 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,759 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,759 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,759 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,759 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:04:17,759 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:04:17,760 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:04:17,761 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:04:17,761 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:04:17,761 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:04:17,761 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,761 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,761 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,761 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,761 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,761 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,762 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,763 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,763 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,763 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:04:17,763 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:04:17,763 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:04:17,763 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:04:17,763 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:04:17,763 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:04:17,763 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:04:17,764 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:04:17,764 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:04:17,764 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:04:17,764 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse22 (= |old(~a20~0)| ~a20~0)) (.cse23 (= |old(~a16~0)| ~a16~0)) (.cse16 (= 13 |old(~a8~0)|)) (.cse18 (not (= 0 |old(~a7~0)|))) (.cse5 (not (= 1 |old(~a21~0)|))) (.cse19 (not (= 15 |old(~a8~0)|))) (.cse9 (not (= 8 ~a12~0))) (.cse20 (= |calculate_output_#in~input| 0)) (.cse14 (not (= 1 |old(~a17~0)|)))) (let ((.cse0 (or .cse18 .cse5 .cse19 (not (= 5 |old(~a16~0)|)) .cse9 .cse20 .cse14)) (.cse1 (= ~a17~0 1)) (.cse8 (not (= 4 |old(~a16~0)|))) (.cse10 (= 13 ~a8~0)) (.cse11 (= 1 ~a21~0)) (.cse12 (= 1 ~a17~0)) (.cse6 (= 1 |old(~a7~0)|)) (.cse13 (not .cse16)) (.cse4 (= ~a7~0 0)) (.cse2 (= ~a8~0 15)) (.cse3 (= ~a21~0 1)) (.cse7 (not (= 1 |old(~a20~0)|))) (.cse17 (and .cse22 .cse23)) (.cse15 (not (= ~a8~0 13))) (.cse21 (< 0 |old(~a20~0)|))) (and (or (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) .cse0 .cse1) (or .cse0 (and .cse2 .cse1 .cse3 .cse4) (not (= 0 |old(~a20~0)|))) (or .cse5 .cse6 .cse7 .cse8 .cse9 (and (not (= ~a7~0 1)) .cse10 .cse11 .cse12) .cse13 .cse14) (or .cse7 .cse15 .cse16 .cse9) (or .cse5 .cse7 .cse8 (and (= 1 ~a7~0) .cse10 .cse11 .cse12) .cse9 (not .cse6) .cse13 .cse14) (or .cse7 .cse17 .cse9) (or (and .cse4 .cse2 .cse3) (or .cse18 .cse5 .cse7 .cse19 (= 0 |old(~a16~0)|) .cse9 .cse20)) (or (< 4 |old(~a16~0)|) .cse17 .cse9 .cse21) (or (and .cse22 .cse23 .cse15) .cse16 .cse9 .cse21)))) [2018-10-25 00:04:17,764 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:04:17,764 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,764 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:04:17,765 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:04:17,766 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:04:17,766 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:04:17,766 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:04:17,766 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:04:17,766 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:04:17,766 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:04:17,766 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:04:17,766 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,766 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:04:17,767 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:04:17,768 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:04:17,769 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:04:17,770 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:04:17,770 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:04:17,770 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:04:17,770 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:04:17,770 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:04:17,770 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:17,770 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-10-25 00:04:17,770 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:04:17,770 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:17,771 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (and (= ~a8~0 15) (= ~a21~0 1) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~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-10-25 00:04:17,771 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:17,771 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (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-10-25 00:04:17,771 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:04:17,771 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:04:17,771 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:04:17,772 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (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-10-25 00:04:17,772 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:17,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:04:17 BoogieIcfgContainer [2018-10-25 00:04:17,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:04:17,790 INFO L168 Benchmark]: Toolchain (without parser) took 64582.87 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -709.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:17,791 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:04:17,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:17,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 186.07 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 681.1 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -745.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:17,793 INFO L168 Benchmark]: Boogie Preprocessor took 69.38 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:04:17,794 INFO L168 Benchmark]: RCFGBuilder took 3632.70 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:17,794 INFO L168 Benchmark]: TraceAbstraction took 59939.23 ms. Allocated memory was 2.2 GB in the beginning and 3.6 GB in the end (delta: 1.4 GB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -119.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:17,799 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 186.07 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 681.1 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -745.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.38 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3632.70 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59939.23 ms. Allocated memory was 2.2 GB in the beginning and 3.6 GB in the end (delta: 1.4 GB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -119.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((a20 <= 0 && !(a8 == 13)) || !(v == 22)) || !(u == 21)) || !(\old(a16) == 5)) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || !(\old(a7) == 0)) || !(3 == c)) || !(\old(a20) == 1)) || (a20 <= 0 && a16 <= 4)) || \old(a20) == a20) || !(a == 1)) || !(26 == z)) || !(x == 24)) || !(\old(a17) == 1)) || !(a12 == 8)) || !(e == 5)) || !(\old(a8) == 15)) || !(d == 4)) || !(6 == f)) || !(w == 23) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 59.8s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 38.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1379 SDtfs, 5805 SDslu, 1091 SDs, 0 SdLazy, 8546 SolverSat, 1146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1522 GetRequests, 1305 SyntacticMatches, 137 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2330occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9974718049115545 AbsIntWeakeningRatio, 0.20967741935483872 AbsIntAvgWeakeningVarsNumRemoved, 9.670250896057349 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 181 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 85 PreInvPairs, 131 NumberOfFragments, 681 HoareAnnotationTreeSize, 85 FomulaSimplifications, 3502 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3425 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 2107 NumberOfCodeBlocks, 2040 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2535 ConstructedInterpolants, 0 QuantifiedInterpolants, 1530332 SizeOfPredicates, 3 NumberOfNonLiveVariables, 990 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1209/1393 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...