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_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:02:27,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:02:27,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:02:27,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:02:27,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:02:27,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:02:27,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:02:27,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:02:27,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:02:27,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:02:27,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:02:27,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:02:27,592 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:02:27,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:02:27,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:02:27,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:02:27,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:02:27,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:02:27,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:02:27,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:02:27,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:02:27,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:02:27,623 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:02:27,624 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:02:27,624 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:02:27,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:02:27,626 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:02:27,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:02:27,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:02:27,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:02:27,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:02:27,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:02:27,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:02:27,634 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:02:27,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:02:27,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:02:27,637 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:02:27,656 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:02:27,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:02:27,657 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:02:27,657 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:02:27,657 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:02:27,658 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:02:27,658 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:02:27,658 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:02:27,658 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:02:27,659 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:02:27,659 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:02:27,659 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:02:27,659 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:02:27,659 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:02:27,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:02:27,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:02:27,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:02:27,661 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:02:27,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:02:27,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:02:27,662 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:02:27,662 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:02:27,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:02:27,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:02:27,663 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:02:27,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:02:27,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:02:27,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:02:27,663 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:02:27,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:02:27,664 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:02:27,664 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:02:27,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:02:27,664 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:02:27,665 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:02:27,665 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:02:27,718 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:02:27,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:02:27,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:02:27,741 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:02:27,742 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:02:27,743 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-10-25 00:02:27,810 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cf07720db/e9c918ace6474dd6aecb8b4def3471cf/FLAG18fd82c5d [2018-10-25 00:02:28,385 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:02:28,386 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-10-25 00:02:28,411 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cf07720db/e9c918ace6474dd6aecb8b4def3471cf/FLAG18fd82c5d [2018-10-25 00:02:28,432 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cf07720db/e9c918ace6474dd6aecb8b4def3471cf [2018-10-25 00:02:28,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:02:28,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:02:28,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:02:28,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:02:28,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:02:28,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:02:28" (1/1) ... [2018-10-25 00:02:28,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:28, skipping insertion in model container [2018-10-25 00:02:28,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:02:28" (1/1) ... [2018-10-25 00:02:28,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:02:28,547 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:02:29,051 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:02:29,055 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:02:29,202 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:02:29,222 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:02:29,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29 WrapperNode [2018-10-25 00:02:29,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:02:29,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:02:29,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:02:29,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:02:29,233 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:02:29" (1/1) ... [2018-10-25 00:02:29,251 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:02:29" (1/1) ... [2018-10-25 00:02:29,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:02:29,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:02:29,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:02:29,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:02:29,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29" (1/1) ... [2018-10-25 00:02:29,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29" (1/1) ... [2018-10-25 00:02:29,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29" (1/1) ... [2018-10-25 00:02:29,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29" (1/1) ... [2018-10-25 00:02:29,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29" (1/1) ... [2018-10-25 00:02:29,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29" (1/1) ... [2018-10-25 00:02:29,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29" (1/1) ... [2018-10-25 00:02:29,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:02:29,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:02:29,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:02:29,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:02:29,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29" (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:02:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:02:29,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:02:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:02:29,543 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:02:29,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:02:29,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:02:29,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:02:29,544 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:02:32,806 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:02:32,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:32 BoogieIcfgContainer [2018-10-25 00:02:32,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:02:32,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:02:32,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:02:32,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:02:32,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:02:28" (1/3) ... [2018-10-25 00:02:32,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adc325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:32, skipping insertion in model container [2018-10-25 00:02:32,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:29" (2/3) ... [2018-10-25 00:02:32,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adc325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:32, skipping insertion in model container [2018-10-25 00:02:32,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:32" (3/3) ... [2018-10-25 00:02:32,820 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label34_true-unreach-call_false-termination.c [2018-10-25 00:02:32,832 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:02:32,843 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:02:32,862 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:02:32,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:02:32,916 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:02:32,916 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:02:32,916 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:02:32,916 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:02:32,917 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:02:32,917 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:02:32,917 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:02:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:02:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-25 00:02:32,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:32,985 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] [2018-10-25 00:02:32,990 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:32,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1144269880, now seen corresponding path program 1 times [2018-10-25 00:02:33,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:33,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:33,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:33,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:33,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:33,727 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:02:33,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:33,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:02:33,730 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:33,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:33,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:33,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:33,757 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:02:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:35,359 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:02:35,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:35,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-10-25 00:02:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:35,385 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:02:35,385 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:02:35,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:02:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:02:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:02:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-10-25 00:02:35,478 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 112 [2018-10-25 00:02:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:35,480 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-10-25 00:02:35,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-10-25 00:02:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-25 00:02:35,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:35,488 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:35,488 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:35,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:35,489 INFO L82 PathProgramCache]: Analyzing trace with hash -255516033, now seen corresponding path program 1 times [2018-10-25 00:02:35,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:35,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:35,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:35,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:35,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:35,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:35,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:02:35,801 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:35,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:02:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:02:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:02:35,804 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-10-25 00:02:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:37,776 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-10-25 00:02:37,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:37,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-10-25 00:02:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:37,790 INFO L225 Difference]: With dead ends: 1079 [2018-10-25 00:02:37,790 INFO L226 Difference]: Without dead ends: 745 [2018-10-25 00:02:37,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:02:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-10-25 00:02:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-10-25 00:02:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-10-25 00:02:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-10-25 00:02:37,856 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 122 [2018-10-25 00:02:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:37,857 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-10-25 00:02:37,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:02:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-10-25 00:02:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 00:02:37,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:37,866 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:37,866 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:37,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash -289707029, now seen corresponding path program 1 times [2018-10-25 00:02:37,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:37,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:37,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:37,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:37,868 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:38,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:38,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:02:38,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:38,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:38,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:38,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:38,091 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 3 states. [2018-10-25 00:02:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:39,973 INFO L93 Difference]: Finished difference Result 1919 states and 3096 transitions. [2018-10-25 00:02:39,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:39,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-10-25 00:02:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:39,982 INFO L225 Difference]: With dead ends: 1919 [2018-10-25 00:02:39,982 INFO L226 Difference]: Without dead ends: 1192 [2018-10-25 00:02:39,986 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:02:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-10-25 00:02:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2018-10-25 00:02:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-10-25 00:02:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1735 transitions. [2018-10-25 00:02:40,041 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1735 transitions. Word has length 132 [2018-10-25 00:02:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:40,042 INFO L481 AbstractCegarLoop]: Abstraction has 1192 states and 1735 transitions. [2018-10-25 00:02:40,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1735 transitions. [2018-10-25 00:02:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 00:02:40,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:40,047 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:40,048 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:40,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:40,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1523382030, now seen corresponding path program 1 times [2018-10-25 00:02:40,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:40,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:40,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:40,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:40,050 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:40,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:40,197 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:40,198 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-10-25 00:02:40,200 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:40,253 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:40,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:41,462 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:41,463 INFO L272 AbstractInterpreter]: Visited 116 different actions 225 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:41,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:41,500 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:42,436 INFO L232 lantSequenceWeakener]: Weakened 106 states. On average, predicates are now at 80.83% of their original sizes. [2018-10-25 00:02:42,436 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:46,665 INFO L413 sIntCurrentIteration]: We have 133 unified AI predicates [2018-10-25 00:02:46,666 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:46,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:46,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:02:46,667 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:46,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:02:46,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:02:46,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:02:46,669 INFO L87 Difference]: Start difference. First operand 1192 states and 1735 transitions. Second operand 15 states. [2018-10-25 00:03:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:07,695 INFO L93 Difference]: Finished difference Result 3673 states and 5265 transitions. [2018-10-25 00:03:07,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:03:07,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 134 [2018-10-25 00:03:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:07,708 INFO L225 Difference]: With dead ends: 3673 [2018-10-25 00:03:07,709 INFO L226 Difference]: Without dead ends: 2487 [2018-10-25 00:03:07,715 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 140 GetRequests, 51 SyntacticMatches, 69 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:03:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2018-10-25 00:03:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2442. [2018-10-25 00:03:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2018-10-25 00:03:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3154 transitions. [2018-10-25 00:03:07,781 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3154 transitions. Word has length 134 [2018-10-25 00:03:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:07,781 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 3154 transitions. [2018-10-25 00:03:07,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:03:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3154 transitions. [2018-10-25 00:03:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-25 00:03:07,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:07,789 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:07,789 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:07,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:07,790 INFO L82 PathProgramCache]: Analyzing trace with hash -521176307, now seen corresponding path program 1 times [2018-10-25 00:03:07,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:07,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:07,791 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:03:08,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:08,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:08,011 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-10-25 00:03:08,011 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [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], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:08,017 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:08,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:08,257 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:08,257 INFO L272 AbstractInterpreter]: Visited 117 different actions 228 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:08,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:08,266 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:08,653 INFO L232 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 80.52% of their original sizes. [2018-10-25 00:03:08,654 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:08,833 INFO L413 sIntCurrentIteration]: We have 146 unified AI predicates [2018-10-25 00:03:08,834 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:08,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:08,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:03:08,834 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:08,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:03:08,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:03:08,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:03:08,835 INFO L87 Difference]: Start difference. First operand 2442 states and 3154 transitions. Second operand 10 states. [2018-10-25 00:03:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:17,486 INFO L93 Difference]: Finished difference Result 4629 states and 6092 transitions. [2018-10-25 00:03:17,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:03:17,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2018-10-25 00:03:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:17,500 INFO L225 Difference]: With dead ends: 4629 [2018-10-25 00:03:17,500 INFO L226 Difference]: Without dead ends: 2583 [2018-10-25 00:03:17,508 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:03:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2018-10-25 00:03:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2580. [2018-10-25 00:03:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2018-10-25 00:03:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3308 transitions. [2018-10-25 00:03:17,575 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3308 transitions. Word has length 147 [2018-10-25 00:03:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:17,576 INFO L481 AbstractCegarLoop]: Abstraction has 2580 states and 3308 transitions. [2018-10-25 00:03:17,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:03:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3308 transitions. [2018-10-25 00:03:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-25 00:03:17,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:17,583 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2018-10-25 00:03:17,584 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:17,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash 644918266, now seen corresponding path program 1 times [2018-10-25 00:03:17,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:17,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:17,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:17,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:03:17,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:17,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:17,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-10-25 00:03:17,711 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [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], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:17,715 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:17,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:18,577 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:18,577 INFO L272 AbstractInterpreter]: Visited 118 different actions 357 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:03:18,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:18,584 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:19,353 INFO L232 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 80.67% of their original sizes. [2018-10-25 00:03:19,354 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:22,777 INFO L413 sIntCurrentIteration]: We have 158 unified AI predicates [2018-10-25 00:03:22,777 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:22,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:22,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 17 [2018-10-25 00:03:22,778 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:22,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:03:22,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:03:22,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:03:22,779 INFO L87 Difference]: Start difference. First operand 2580 states and 3308 transitions. Second operand 14 states. [2018-10-25 00:03:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:37,448 INFO L93 Difference]: Finished difference Result 6053 states and 7990 transitions. [2018-10-25 00:03:37,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:03:37,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2018-10-25 00:03:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:37,467 INFO L225 Difference]: With dead ends: 6053 [2018-10-25 00:03:37,468 INFO L226 Difference]: Without dead ends: 4007 [2018-10-25 00:03:37,478 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 33 SyntacticMatches, 113 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:03:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4007 states. [2018-10-25 00:03:37,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4007 to 3947. [2018-10-25 00:03:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3947 states. [2018-10-25 00:03:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 4951 transitions. [2018-10-25 00:03:37,581 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 4951 transitions. Word has length 159 [2018-10-25 00:03:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:37,581 INFO L481 AbstractCegarLoop]: Abstraction has 3947 states and 4951 transitions. [2018-10-25 00:03:37,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:03:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 4951 transitions. [2018-10-25 00:03:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-25 00:03:37,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:37,592 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2018-10-25 00:03:37,592 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:37,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:37,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1387665827, now seen corresponding path program 1 times [2018-10-25 00:03:37,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:37,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:37,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-25 00:03:37,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:37,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:37,879 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-10-25 00:03:37,879 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:37,891 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:37,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:39,735 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:03:39,735 INFO L272 AbstractInterpreter]: Visited 120 different actions 616 times. Merged at 10 different actions 63 times. Widened at 1 different actions 7 times. Found 12 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-25 00:03:39,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:39,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:03:39,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:39,744 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:03:39,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:39,755 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:03:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:39,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:03:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-25 00:03:40,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:03:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-25 00:03:40,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:03:40,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-25 00:03:40,581 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:03:40,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:03:40,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:03:40,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:03:40,582 INFO L87 Difference]: Start difference. First operand 3947 states and 4951 transitions. Second operand 8 states. [2018-10-25 00:03:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:45,680 INFO L93 Difference]: Finished difference Result 13337 states and 18081 transitions. [2018-10-25 00:03:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-25 00:03:45,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2018-10-25 00:03:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:45,712 INFO L225 Difference]: With dead ends: 13337 [2018-10-25 00:03:45,713 INFO L226 Difference]: Without dead ends: 5737 [2018-10-25 00:03:45,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-10-25 00:03:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5737 states. [2018-10-25 00:03:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5737 to 5646. [2018-10-25 00:03:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5646 states. [2018-10-25 00:03:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 6638 transitions. [2018-10-25 00:03:45,914 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 6638 transitions. Word has length 179 [2018-10-25 00:03:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:45,914 INFO L481 AbstractCegarLoop]: Abstraction has 5646 states and 6638 transitions. [2018-10-25 00:03:45,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:03:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 6638 transitions. [2018-10-25 00:03:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-25 00:03:45,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:45,926 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:45,926 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:45,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1042057633, now seen corresponding path program 1 times [2018-10-25 00:03:45,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:45,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:45,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:03:46,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:46,404 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:46,404 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-10-25 00:03:46,405 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:46,410 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:46,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:46,858 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:46,859 INFO L272 AbstractInterpreter]: Visited 117 different actions 228 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:46,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:46,891 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:47,773 INFO L232 lantSequenceWeakener]: Weakened 116 states. On average, predicates are now at 80.77% of their original sizes. [2018-10-25 00:03:47,773 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:51,115 INFO L413 sIntCurrentIteration]: We have 179 unified AI predicates [2018-10-25 00:03:51,116 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:51,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:51,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:03:51,116 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:51,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:03:51,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:03:51,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:03:51,117 INFO L87 Difference]: Start difference. First operand 5646 states and 6638 transitions. Second operand 15 states. [2018-10-25 00:03:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:58,495 INFO L93 Difference]: Finished difference Result 10631 states and 12497 transitions. [2018-10-25 00:03:58,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:03:58,495 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 180 [2018-10-25 00:03:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:58,523 INFO L225 Difference]: With dead ends: 10631 [2018-10-25 00:03:58,523 INFO L226 Difference]: Without dead ends: 6297 [2018-10-25 00:03:58,539 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 102 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:03:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6297 states. [2018-10-25 00:03:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6297 to 6153. [2018-10-25 00:03:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2018-10-25 00:03:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 7175 transitions. [2018-10-25 00:03:58,687 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 7175 transitions. Word has length 180 [2018-10-25 00:03:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:58,688 INFO L481 AbstractCegarLoop]: Abstraction has 6153 states and 7175 transitions. [2018-10-25 00:03:58,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:03:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 7175 transitions. [2018-10-25 00:03:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-25 00:03:58,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:58,701 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:58,702 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:58,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash 660025092, now seen corresponding path program 1 times [2018-10-25 00:03:58,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:58,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:58,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:58,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:58,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-25 00:03:59,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:59,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:59,301 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-10-25 00:03:59,302 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:59,304 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:59,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:00,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:04:00,268 INFO L272 AbstractInterpreter]: Visited 119 different actions 481 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:00,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:00,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:04:00,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:00,274 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:00,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:00,491 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:04:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:00,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-25 00:04:00,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 82 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-25 00:04:00,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:04:00,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:04:00,936 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:04:00,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:04:00,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:04:00,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:04:00,937 INFO L87 Difference]: Start difference. First operand 6153 states and 7175 transitions. Second operand 11 states. [2018-10-25 00:04:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:02,818 INFO L93 Difference]: Finished difference Result 12985 states and 15388 transitions. [2018-10-25 00:04:02,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:04:02,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-10-25 00:04:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:02,857 INFO L225 Difference]: With dead ends: 12985 [2018-10-25 00:04:02,857 INFO L226 Difference]: Without dead ends: 7481 [2018-10-25 00:04:02,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:04:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7481 states. [2018-10-25 00:04:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7481 to 7188. [2018-10-25 00:04:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7188 states. [2018-10-25 00:04:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7188 states to 7188 states and 8324 transitions. [2018-10-25 00:04:03,047 INFO L78 Accepts]: Start accepts. Automaton has 7188 states and 8324 transitions. Word has length 189 [2018-10-25 00:04:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:03,048 INFO L481 AbstractCegarLoop]: Abstraction has 7188 states and 8324 transitions. [2018-10-25 00:04:03,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:04:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7188 states and 8324 transitions. [2018-10-25 00:04:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-25 00:04:03,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:03,063 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:04:03,063 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:03,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2084128074, now seen corresponding path program 1 times [2018-10-25 00:04:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:03,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:03,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:03,633 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:04:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 98 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-25 00:04:03,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:03,846 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:03,846 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-10-25 00:04:03,847 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:03,849 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:03,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:04,270 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:04,270 INFO L272 AbstractInterpreter]: Visited 118 different actions 346 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:04:04,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:04,278 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:05,233 INFO L232 lantSequenceWeakener]: Weakened 101 states. On average, predicates are now at 80.94% of their original sizes. [2018-10-25 00:04:05,233 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:08,350 INFO L413 sIntCurrentIteration]: We have 197 unified AI predicates [2018-10-25 00:04:08,350 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:08,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:08,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:04:08,351 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:08,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:04:08,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:04:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:04:08,352 INFO L87 Difference]: Start difference. First operand 7188 states and 8324 transitions. Second operand 15 states. [2018-10-25 00:04:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:19,277 INFO L93 Difference]: Finished difference Result 14292 states and 16636 transitions. [2018-10-25 00:04:19,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:04:19,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 198 [2018-10-25 00:04:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:19,302 INFO L225 Difference]: With dead ends: 14292 [2018-10-25 00:04:19,302 INFO L226 Difference]: Without dead ends: 7891 [2018-10-25 00:04:19,313 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 42 SyntacticMatches, 142 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:04:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2018-10-25 00:04:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7880. [2018-10-25 00:04:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7880 states. [2018-10-25 00:04:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7880 states to 7880 states and 9078 transitions. [2018-10-25 00:04:19,469 INFO L78 Accepts]: Start accepts. Automaton has 7880 states and 9078 transitions. Word has length 198 [2018-10-25 00:04:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:19,469 INFO L481 AbstractCegarLoop]: Abstraction has 7880 states and 9078 transitions. [2018-10-25 00:04:19,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:04:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 7880 states and 9078 transitions. [2018-10-25 00:04:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-25 00:04:19,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:19,485 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:19,485 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:19,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1822184039, now seen corresponding path program 1 times [2018-10-25 00:04:19,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:19,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:19,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 98 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-25 00:04:19,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:19,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:19,767 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-10-25 00:04:19,767 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [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], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:19,769 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:19,769 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:20,738 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:04:20,739 INFO L272 AbstractInterpreter]: Visited 120 different actions 491 times. Merged at 10 different actions 47 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:04:20,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:20,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:04:20,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:20,747 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:04:20,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:20,758 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:04:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:20,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 122 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-25 00:04:20,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 104 proven. 20 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-25 00:04:21,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:04:21,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-25 00:04:21,065 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:04:21,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:04:21,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:04:21,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:04:21,068 INFO L87 Difference]: Start difference. First operand 7880 states and 9078 transitions. Second operand 12 states. [2018-10-25 00:04:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:27,060 INFO L93 Difference]: Finished difference Result 18832 states and 22731 transitions. [2018-10-25 00:04:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-25 00:04:27,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 209 [2018-10-25 00:04:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:27,097 INFO L225 Difference]: With dead ends: 18832 [2018-10-25 00:04:27,097 INFO L226 Difference]: Without dead ends: 11014 [2018-10-25 00:04:27,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=468, Invalid=1788, Unknown=0, NotChecked=0, Total=2256 [2018-10-25 00:04:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11014 states. [2018-10-25 00:04:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11014 to 10462. [2018-10-25 00:04:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10462 states. [2018-10-25 00:04:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10462 states to 10462 states and 12345 transitions. [2018-10-25 00:04:27,390 INFO L78 Accepts]: Start accepts. Automaton has 10462 states and 12345 transitions. Word has length 209 [2018-10-25 00:04:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:27,390 INFO L481 AbstractCegarLoop]: Abstraction has 10462 states and 12345 transitions. [2018-10-25 00:04:27,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:04:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 10462 states and 12345 transitions. [2018-10-25 00:04:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-25 00:04:27,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:27,414 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 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] [2018-10-25 00:04:27,414 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:27,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:27,415 INFO L82 PathProgramCache]: Analyzing trace with hash -637261400, now seen corresponding path program 1 times [2018-10-25 00:04:27,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:27,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:27,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:27,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:28,428 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:04:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 153 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:04:28,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:28,667 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:28,668 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-10-25 00:04:28,668 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:28,670 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:28,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:29,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:04:29,764 INFO L272 AbstractInterpreter]: Visited 119 different actions 478 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:04:29,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:29,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:04:29,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:29,773 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:04:29,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:29,783 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:04:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:29,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-25 00:04:29,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-25 00:04:30,289 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:30,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:04:30,290 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:30,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:04:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:04:30,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:04:30,291 INFO L87 Difference]: Start difference. First operand 10462 states and 12345 transitions. Second operand 3 states. [2018-10-25 00:04:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:30,975 INFO L93 Difference]: Finished difference Result 16330 states and 19364 transitions. [2018-10-25 00:04:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:04:30,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-10-25 00:04:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:30,976 INFO L225 Difference]: With dead ends: 16330 [2018-10-25 00:04:30,976 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:04:31,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 426 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:04:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:04:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:04:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:04:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:04:31,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2018-10-25 00:04:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:31,010 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:04:31,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:04:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:04:31,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:04:31,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:04:31,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:31,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:31,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:32,905 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 396 DAG size of output: 277 [2018-10-25 00:04:33,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:33,816 WARN L179 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 206 [2018-10-25 00:04:34,289 WARN L179 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-25 00:04:34,707 WARN L179 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 86 [2018-10-25 00:04:43,959 WARN L179 SmtUtils]: Spent 9.22 s on a formula simplification. DAG size of input: 426 DAG size of output: 177 [2018-10-25 00:04:45,928 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 298 DAG size of output: 121 [2018-10-25 00:04:46,943 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 229 DAG size of output: 121 [2018-10-25 00:04:46,947 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:46,947 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|)) [2018-10-25 00:04:46,948 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:46,948 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:04:46,948 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:04:46,948 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,948 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,948 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,949 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,949 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,949 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,949 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:04:46,949 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:04:46,949 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:04:46,949 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:04:46,949 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:04:46,949 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:04:46,950 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:04:46,950 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:04:46,950 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:04:46,950 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:04:46,950 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,950 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,950 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,950 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,951 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,951 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,951 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:04:46,951 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:04:46,951 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:04:46,951 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:04:46,951 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:04:46,951 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:04:46,952 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:04:46,952 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:04:46,952 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:04:46,952 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:04:46,952 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:04:46,952 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:04:46,952 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:04:46,952 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:04:46,953 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:04:46,953 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,953 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,953 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,953 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,953 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,953 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:04:46,953 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:04:46,953 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:04:46,954 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:04:46,954 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:04:46,954 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:04:46,954 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:04:46,954 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:04:46,954 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:04:46,954 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,954 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,954 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,955 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,955 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,955 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:04:46,955 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:04:46,955 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:04:46,955 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:04:46,955 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:04:46,955 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:04:46,956 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:04:46,956 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:04:46,956 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:04:46,956 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:04:46,956 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:04:46,956 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:04:46,956 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:04:46,956 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,956 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,957 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,957 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,957 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,957 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:04:46,957 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:04:46,957 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:04:46,957 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:04:46,957 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:04:46,957 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,958 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:04:46,959 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,960 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,961 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:04:46,962 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:04:46,963 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:04:46,963 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:04:46,963 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse29 (= ~a17~0 1)) (.cse6 (= ~a12~0 8)) (.cse30 (= ~a21~0 1)) (.cse23 (= ~a7~0 |old(~a7~0)|)) (.cse14 (= 1 ~a7~0)) (.cse15 (= |old(~a8~0)| ~a8~0)) (.cse16 (= |old(~a20~0)| ~a20~0)) (.cse17 (= ~a17~0 |old(~a17~0)|)) (.cse11 (not (= ~a16~0 6))) (.cse2 (not (= 0 |old(~a7~0)|))) (.cse3 (not (= 15 |old(~a8~0)|))) (.cse4 (not (= 5 |old(~a16~0)|))) (.cse33 (not (= ~a16~0 0))) (.cse38 (not (= ~a8~0 0))) (.cse34 (not (= 1 |old(~a21~0)|))) (.cse8 (not (= 1 |old(~a20~0)|))) (.cse35 (= 0 |old(~a16~0)|)) (.cse36 (not (= 8 ~a12~0))) (.cse5 (= |calculate_output_#in~input| 0)) (.cse37 (= 0 |old(~a8~0)|)) (.cse28 (not (= 1 |old(~a17~0)|)))) (let ((.cse19 (< |old(~a8~0)| 15)) (.cse20 (or .cse34 .cse8 .cse35 .cse36 .cse5 .cse37 .cse28)) (.cse21 (and .cse33 .cse38 (= ~a20~0 1))) (.cse26 (= 1 ~a20~0)) (.cse1 (not (= |old(~a20~0)| 1))) (.cse0 (= ~a16~0 5)) (.cse27 (or .cse2 .cse34 .cse3 .cse4 .cse36 .cse5)) (.cse18 (and .cse14 .cse15 .cse16 .cse17 .cse11)) (.cse31 (= 13 |old(~a8~0)|)) (.cse32 (and .cse23 .cse15 .cse16 .cse17)) (.cse13 (< 0 |old(~a20~0)|)) (.cse9 (not (= 1 |old(~a7~0)|))) (.cse22 (< 13 |old(~a8~0)|)) (.cse25 (and .cse33 .cse38 .cse29 .cse6 .cse30 (not .cse5))) (.cse24 (or .cse34 .cse35 .cse36 .cse5 .cse37 .cse28)) (.cse7 (= 6 |old(~a16~0)|)) (.cse12 (< 0 |old(~a7~0)|)) (.cse10 (< 0 |old(~a17~0)|))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4) (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= 3 ~c~0)) .cse5 (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not .cse6) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)))) (or .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse7 .cse12 .cse10 .cse11 .cse13) (or (and .cse14 .cse15 .cse16 .cse17) .cse1 .cse9 .cse10) (or .cse7 .cse18 .cse9 .cse10 .cse13) (or .cse7 (and .cse14 .cse15 .cse11) .cse9 .cse19) (or .cse20 .cse21 .cse9) (or .cse7 (and .cse16 .cse17) .cse12 .cse10 .cse13) (or .cse7 (= |old(~a7~0)| 1) .cse22 (and .cse23 .cse15 .cse11)) (or .cse7 .cse11 .cse12 .cse24 .cse13) (or .cse7 .cse18 .cse22 .cse8 .cse9) (or (and .cse25 .cse23 .cse15 .cse11 .cse21) (or .cse7 .cse20) .cse12) (or .cse8 (and .cse14 .cse15 .cse26) .cse9 .cse19) (or .cse0 .cse27 .cse13 .cse28) (or .cse22 .cse20 (and .cse23 .cse15 .cse29 .cse30 .cse21)) (or .cse26 .cse7 .cse22 .cse8) (or .cse0 .cse8 .cse10 .cse27) (or (and .cse14 .cse15 .cse25) .cse31 .cse9 .cse24) (or .cse7 .cse11 .cse1 .cse12 .cse10) (or (and .cse30 .cse0) (or .cse10 .cse27 .cse13)) (or .cse8 .cse32 .cse31 .cse12 .cse10) (or .cse7 .cse22 .cse18 .cse9 .cse13) (or (and .cse23 .cse15 .cse16 .cse25) .cse31 .cse12 .cse24 .cse13) (or .cse31 .cse12 .cse10 .cse32 .cse13) (or .cse7 .cse11 .cse9 .cse24) (or .cse7 .cse22 (and .cse23 .cse15 .cse25) .cse24) (or (and .cse33 .cse30) (or .cse10 (or .cse2 .cse34 .cse8 .cse3 .cse35 .cse36 .cse5))) (or .cse7 .cse8 .cse17 .cse12 .cse10)))) [2018-10-25 00:04:46,963 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:04:46,963 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 491) no Hoare annotation was computed. [2018-10-25 00:04:46,963 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:04:46,964 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:04:46,965 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,966 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,967 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,967 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,967 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:46,967 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:04:46,967 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:04:46,967 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:04:46,967 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:04:46,967 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:04:46,967 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:04:46,968 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:04:46,968 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:04:46,968 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:04:46,968 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:04:46,968 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:46,968 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:46,968 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:04:46,968 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:46,969 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a7~0 |old(~a7~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:04:46,969 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:46,969 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse11 (= ~a12~0 8))) (let ((.cse9 (<= ~a8~0 |old(~a8~0)|)) (.cse10 (<= 15 ~a8~0)) (.cse12 (= ~a20~0 1)) (.cse8 (= 1 ~a20~0)) (.cse2 (<= ~a17~0 0)) (.cse4 (and (not (= ~a16~0 0)) (not (= main_~input~0 0)) (not (= ~a8~0 0)) (= ~a17~0 1) .cse11 (= ~a21~0 1))) (.cse5 (not (= ~a8~0 13))) (.cse6 (<= ~a7~0 0)) (.cse7 (<= ~a8~0 13)) (.cse0 (= 1 ~a7~0)) (.cse1 (not (= ~a16~0 6))) (.cse3 (<= ~a20~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse7 .cse0 .cse8 .cse1) (and .cse9 .cse0 .cse10 .cse1) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse7 .cse1 .cse4) (and .cse9 .cse0 .cse10 .cse8) (and .cse7 (= ~a7~0 |old(~a7~0)|) .cse1) (and .cse8 .cse1 .cse2 .cse6) (and (= |old(~a20~0)| ~a20~0) .cse2 .cse5 .cse6) (not (= ~x~0 24)) (not .cse11) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse4 .cse6 .cse1 .cse12) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse7 .cse4 .cse12) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse0 .cse8 .cse2) (not (= 0 |old(~a7~0)|)) (and .cse2 .cse5 .cse3 .cse6) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (and .cse4 .cse5 .cse3 .cse6) (not (= |old(~a17~0)| 1)) (and .cse7 .cse0 .cse1 .cse3) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))))) [2018-10-25 00:04:46,969 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:04:46,970 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:04:46,970 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:04:46,970 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse14 (not (= ~a16~0 0))) (.cse15 (not (= ~a8~0 0))) (.cse16 (= ~a17~0 1)) (.cse12 (= ~a12~0 8)) (.cse17 (= ~a21~0 1))) (let ((.cse13 (and .cse14 .cse15 .cse16 .cse12 .cse17)) (.cse9 (not (= ~a8~0 13)))) (let ((.cse10 (and .cse14 .cse15 .cse16 .cse17 (= ~a20~0 1))) (.cse5 (<= ~a8~0 |old(~a8~0)|)) (.cse0 (= 1 ~a7~0)) (.cse6 (<= 15 ~a8~0)) (.cse7 (= 1 ~a20~0)) (.cse2 (<= ~a17~0 0)) (.cse11 (and .cse13 .cse9)) (.cse3 (<= ~a20~0 0)) (.cse4 (<= ~a7~0 0)) (.cse8 (<= ~a8~0 13)) (.cse1 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse7) (and .cse8 (= ~a7~0 |old(~a7~0)|) .cse1) (and .cse0 .cse7 .cse2) (and .cse2 .cse9 .cse3 .cse4) (not (= 3 ~c~0)) (and .cse8 .cse10) (and .cse8 .cse0 .cse1 .cse3) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (and .cse0 .cse11) (and .cse7 .cse2 .cse9 .cse4) (not (= 2 ~b~0)) (and (and .cse10 .cse1) .cse4) (and .cse8 .cse0 .cse7 .cse1) (and .cse5 .cse0 .cse6 .cse1) (not (= ~y~0 25)) (and .cse7 .cse1 .cse2 .cse4) (not (= ~x~0 24)) (not .cse12) (not (= ~e~0 5)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse11 .cse3 .cse4) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (and .cse8 (and .cse13 .cse1)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))))) [2018-10-25 00:04:46,970 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:46,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:04:46 BoogieIcfgContainer [2018-10-25 00:04:46,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:04:46,993 INFO L168 Benchmark]: Toolchain (without parser) took 138546.90 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -552.0 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:46,994 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:04:46,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:46,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:47,000 INFO L168 Benchmark]: Boogie Preprocessor took 60.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:47,000 INFO L168 Benchmark]: RCFGBuilder took 3352.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 128.5 MB). Peak memory consumption was 128.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:47,001 INFO L168 Benchmark]: TraceAbstraction took 134180.11 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 112.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:47,011 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 174.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3352.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 128.5 MB). Peak memory consumption was 128.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134180.11 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 112.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 491]: 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: ((((((((((((((((((((((((((((((((((((1 == a7 && !(a16 == 6)) && a17 <= 0) && a20 <= 0) || (((!(a16 == 6) && a17 <= 0) && a20 <= 0) && a7 <= 0)) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && 1 == a20)) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || ((1 == a7 && 1 == a20) && a17 <= 0)) || (((a17 <= 0 && !(a8 == 13)) && a20 <= 0) && a7 <= 0)) || !(3 == c)) || (a8 <= 13 && (((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a21 == 1) && a20 == 1)) || (((a8 <= 13 && 1 == a7) && !(a16 == 6)) && a20 <= 0)) || !(1 == \old(a21))) || !(4 == d)) || (1 == a7 && ((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a12 == 8) && a21 == 1) && !(a8 == 13))) || (((1 == a20 && a17 <= 0) && !(a8 == 13)) && a7 <= 0)) || !(2 == b)) || ((((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a21 == 1) && a20 == 1) && !(a16 == 6)) && a7 <= 0)) || (((a8 <= 13 && 1 == a7) && 1 == a20) && !(a16 == 6))) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && !(a16 == 6))) || !(y == 25)) || (((1 == a20 && !(a16 == 6)) && a17 <= 0) && a7 <= 0)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || (((((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a12 == 8) && a21 == 1) && !(a8 == 13)) && a20 <= 0) && a7 <= 0)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || (a8 <= 13 && ((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a12 == 8) && a21 == 1) && !(a16 == 6))) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 134.0s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 82.2s AutomataDifference, 0.0s DeadEndRemovalTime, 15.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1488 SDtfs, 13179 SDslu, 2238 SDs, 0 SdLazy, 21309 SolverSat, 2575 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.8s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2597 GetRequests, 1961 SyntacticMatches, 434 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4565 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10462occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.2s AbstIntTime, 9 AbstIntIterations, 5 AbstIntStrong, 0.9963975682266957 AbsIntWeakeningRatio, 0.25953259532595324 AbsIntAvgWeakeningVarsNumRemoved, 0.8991389913899139 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1211 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 434 PreInvPairs, 714 NumberOfFragments, 1945 HoareAnnotationTreeSize, 434 FomulaSimplifications, 44590 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 31030 FormulaSimplificationTreeSizeReductionInter, 13.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2766 NumberOfCodeBlocks, 2766 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3537 ConstructedInterpolants, 0 QuantifiedInterpolants, 1235806 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2463 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 2193/2446 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...