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_label45_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:36,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:36,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:36,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:36,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:36,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:36,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:36,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:36,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:36,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:36,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:36,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:36,816 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:36,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:36,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:36,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:36,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:36,836 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:36,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:36,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:36,847 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:36,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:36,851 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:36,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:36,852 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:36,852 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:36,854 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:36,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:36,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:36,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:36,859 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:36,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:36,860 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:36,861 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:36,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:36,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:36,882 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-27 06:10:36,918 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:36,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:36,920 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 06:10:36,920 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 06:10:36,920 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 06:10:36,921 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 06:10:36,921 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 06:10:36,921 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 06:10:36,921 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 06:10:36,921 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 06:10:36,921 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 06:10:36,922 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 06:10:36,922 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 06:10:36,922 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 06:10:36,923 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:36,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:36,924 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:36,924 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 06:10:36,924 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 06:10:36,924 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 06:10:36,924 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:36,924 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 06:10:36,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:36,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:36,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 06:10:36,927 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 06:10:36,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:10:36,927 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:36,928 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 06:10:36,928 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 06:10:36,928 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 06:10:36,928 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 06:10:36,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 06:10:36,928 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 06:10:36,929 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 06:10:36,929 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 06:10:36,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:37,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:37,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:37,016 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:37,017 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:37,017 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-10-27 06:10:37,104 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b679a5d26/43227b18b2d4450685bfef7721bfe5fc/FLAGc8686bce6 [2018-10-27 06:10:37,695 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:37,696 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-10-27 06:10:37,710 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b679a5d26/43227b18b2d4450685bfef7721bfe5fc/FLAGc8686bce6 [2018-10-27 06:10:37,725 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b679a5d26/43227b18b2d4450685bfef7721bfe5fc [2018-10-27 06:10:37,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:37,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 06:10:37,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:37,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:37,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:37,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:37" (1/1) ... [2018-10-27 06:10:37,748 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 27.10 06:10:37, skipping insertion in model container [2018-10-27 06:10:37,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:37" (1/1) ... [2018-10-27 06:10:37,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:37,821 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:38,294 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:38,300 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:38,457 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:38,479 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:38,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38 WrapperNode [2018-10-27 06:10:38,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:38,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:38,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:38,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:38,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (1/1) ... [2018-10-27 06:10:38,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (1/1) ... [2018-10-27 06:10:38,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:38,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:38,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:38,661 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:38,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (1/1) ... [2018-10-27 06:10:38,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (1/1) ... [2018-10-27 06:10:38,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (1/1) ... [2018-10-27 06:10:38,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (1/1) ... [2018-10-27 06:10:38,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (1/1) ... [2018-10-27 06:10:38,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (1/1) ... [2018-10-27 06:10:38,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (1/1) ... [2018-10-27 06:10:38,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:38,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:38,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:38,767 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:38,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (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-27 06:10:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 06:10:38,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 06:10:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 06:10:38,842 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 06:10:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:38,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 06:10:38,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 06:10:42,237 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:42,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:42 BoogieIcfgContainer [2018-10-27 06:10:42,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:42,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 06:10:42,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 06:10:42,248 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 06:10:42,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 06:10:37" (1/3) ... [2018-10-27 06:10:42,250 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 27.10 06:10:42, skipping insertion in model container [2018-10-27 06:10:42,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:38" (2/3) ... [2018-10-27 06:10:42,250 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 27.10 06:10:42, skipping insertion in model container [2018-10-27 06:10:42,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:42" (3/3) ... [2018-10-27 06:10:42,253 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label45_true-unreach-call_false-termination.c [2018-10-27 06:10:42,262 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 06:10:42,271 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 06:10:42,289 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 06:10:42,339 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 06:10:42,340 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 06:10:42,340 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 06:10:42,340 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:42,340 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:42,341 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 06:10:42,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:42,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 06:10:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 06:10:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-27 06:10:42,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:10:42,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:42,399 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:10:42,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1391094344, now seen corresponding path program 1 times [2018-10-27 06:10:42,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:10:42,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:42,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:42,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:10:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:43,173 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-27 06:10:43,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:43,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:43,176 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:10:43,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:10:43,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:43,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:43,202 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 06:10:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:44,597 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 06:10:44,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:44,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-10-27 06:10:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:10:44,619 INFO L225 Difference]: With dead ends: 550 [2018-10-27 06:10:44,620 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 06:10:44,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-27 06:10:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 06:10:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 06:10:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 06:10:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-10-27 06:10:44,731 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 124 [2018-10-27 06:10:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:10:44,732 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-10-27 06:10:44,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:10:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-10-27 06:10:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 06:10:44,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:10:44,751 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:44,752 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:10:44,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash -624789737, now seen corresponding path program 1 times [2018-10-27 06:10:44,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:10:44,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:44,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,756 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:10:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:45,052 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:10:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:45,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:45,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:10:45,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:10:45,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:10:45,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:10:45,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:10:45,111 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-10-27 06:10:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:46,974 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-10-27 06:10:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:10:46,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-27 06:10:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:10:46,986 INFO L225 Difference]: With dead ends: 1075 [2018-10-27 06:10:46,987 INFO L226 Difference]: Without dead ends: 741 [2018-10-27 06:10:46,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:10:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-27 06:10:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-10-27 06:10:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-27 06:10:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-10-27 06:10:47,045 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 135 [2018-10-27 06:10:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:10:47,046 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-10-27 06:10:47,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:10:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-10-27 06:10:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-27 06:10:47,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:10:47,053 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,053 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:10:47,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,056 INFO L82 PathProgramCache]: Analyzing trace with hash -39605397, now seen corresponding path program 1 times [2018-10-27 06:10:47,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:10:47,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:10:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:47,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:47,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:47,545 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:10:47,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:10:47,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:47,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:47,547 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 5 states. [2018-10-27 06:10:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:49,885 INFO L93 Difference]: Finished difference Result 1578 states and 2533 transitions. [2018-10-27 06:10:49,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:10:49,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2018-10-27 06:10:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:10:49,894 INFO L225 Difference]: With dead ends: 1578 [2018-10-27 06:10:49,894 INFO L226 Difference]: Without dead ends: 721 [2018-10-27 06:10:49,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-10-27 06:10:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-10-27 06:10:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-27 06:10:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1069 transitions. [2018-10-27 06:10:49,950 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1069 transitions. Word has length 136 [2018-10-27 06:10:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:10:49,950 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1069 transitions. [2018-10-27 06:10:49,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:10:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1069 transitions. [2018-10-27 06:10:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-27 06:10:49,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:10:49,955 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:49,955 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:10:49,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:49,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1115389459, now seen corresponding path program 1 times [2018-10-27 06:10:49,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:10:49,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:49,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,957 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:10:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:50,891 WARN L179 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-27 06:10:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:51,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:51,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:51,124 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:10:51,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:10:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:51,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:51,125 INFO L87 Difference]: Start difference. First operand 721 states and 1069 transitions. Second operand 5 states. [2018-10-27 06:10:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:52,350 INFO L93 Difference]: Finished difference Result 1572 states and 2365 transitions. [2018-10-27 06:10:52,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:10:52,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-10-27 06:10:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:10:52,357 INFO L225 Difference]: With dead ends: 1572 [2018-10-27 06:10:52,357 INFO L226 Difference]: Without dead ends: 720 [2018-10-27 06:10:52,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-27 06:10:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-10-27 06:10:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-27 06:10:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2018-10-27 06:10:52,389 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 137 [2018-10-27 06:10:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:10:52,389 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2018-10-27 06:10:52,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:10:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2018-10-27 06:10:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 06:10:52,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:10:52,393 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:52,393 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:10:52,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1083310493, now seen corresponding path program 1 times [2018-10-27 06:10:52,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:10:52,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:52,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:52,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:52,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:10:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:52,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:52,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:52,613 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:10:52,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:10:52,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:52,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:52,614 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 3 states. [2018-10-27 06:10:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:53,253 INFO L93 Difference]: Finished difference Result 1882 states and 2820 transitions. [2018-10-27 06:10:53,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:53,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-10-27 06:10:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:10:53,270 INFO L225 Difference]: With dead ends: 1882 [2018-10-27 06:10:53,270 INFO L226 Difference]: Without dead ends: 1168 [2018-10-27 06:10:53,274 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-27 06:10:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-27 06:10:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1164. [2018-10-27 06:10:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-10-27 06:10:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1592 transitions. [2018-10-27 06:10:53,312 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1592 transitions. Word has length 140 [2018-10-27 06:10:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:10:53,313 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1592 transitions. [2018-10-27 06:10:53,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:10:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1592 transitions. [2018-10-27 06:10:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 06:10:53,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:10:53,320 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:53,320 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:10:53,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1130743534, now seen corresponding path program 1 times [2018-10-27 06:10:53,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:10:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:53,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:53,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:10:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:53,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:53,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:10:53,595 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-10-27 06:10:53,597 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:10:53,655 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:10:53,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:10:54,321 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:10:54,322 INFO L272 AbstractInterpreter]: Visited 125 different actions 125 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 06:10:54,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:54,367 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:10:54,929 INFO L227 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 80.51% of their original sizes. [2018-10-27 06:10:54,929 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:10:55,026 INFO L415 sIntCurrentIteration]: We unified 171 AI predicates to 171 [2018-10-27 06:10:55,027 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:10:55,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:10:55,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-27 06:10:55,028 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:10:55,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:10:55,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:10:55,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:10:55,030 INFO L87 Difference]: Start difference. First operand 1164 states and 1592 transitions. Second operand 6 states. [2018-10-27 06:11:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:03,641 INFO L93 Difference]: Finished difference Result 2460 states and 3350 transitions. [2018-10-27 06:11:03,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:11:03,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-10-27 06:11:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:03,649 INFO L225 Difference]: With dead ends: 2460 [2018-10-27 06:11:03,649 INFO L226 Difference]: Without dead ends: 1302 [2018-10-27 06:11:03,653 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:11:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2018-10-27 06:11:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1300. [2018-10-27 06:11:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-10-27 06:11:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1734 transitions. [2018-10-27 06:11:03,689 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1734 transitions. Word has length 172 [2018-10-27 06:11:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:03,690 INFO L481 AbstractCegarLoop]: Abstraction has 1300 states and 1734 transitions. [2018-10-27 06:11:03,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:11:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1734 transitions. [2018-10-27 06:11:03,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-27 06:11:03,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:03,697 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:03,697 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:03,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:03,697 INFO L82 PathProgramCache]: Analyzing trace with hash -782139567, now seen corresponding path program 1 times [2018-10-27 06:11:03,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:03,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:03,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:03,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:04,236 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 06:11:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:11:04,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:04,391 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:11:04,391 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-10-27 06:11:04,392 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:11:04,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:11:04,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:11:04,685 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:11:04,685 INFO L272 AbstractInterpreter]: Visited 129 different actions 252 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 06:11:04,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:04,693 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:11:05,099 INFO L227 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 81.93% of their original sizes. [2018-10-27 06:11:05,099 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:11:05,271 INFO L415 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2018-10-27 06:11:05,271 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:11:05,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:11:05,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:11:05,272 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:05,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:11:05,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:11:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:11:05,274 INFO L87 Difference]: Start difference. First operand 1300 states and 1734 transitions. Second operand 10 states. [2018-10-27 06:11:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:09,465 INFO L93 Difference]: Finished difference Result 2599 states and 3521 transitions. [2018-10-27 06:11:09,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:11:09,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 181 [2018-10-27 06:11:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:09,472 INFO L225 Difference]: With dead ends: 2599 [2018-10-27 06:11:09,472 INFO L226 Difference]: Without dead ends: 1441 [2018-10-27 06:11:09,477 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 172 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-27 06:11:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-10-27 06:11:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1438. [2018-10-27 06:11:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-27 06:11:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1882 transitions. [2018-10-27 06:11:09,515 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1882 transitions. Word has length 181 [2018-10-27 06:11:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:09,515 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 1882 transitions. [2018-10-27 06:11:09,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:11:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1882 transitions. [2018-10-27 06:11:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-27 06:11:09,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:09,522 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:09,523 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:09,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash -216405787, now seen corresponding path program 1 times [2018-10-27 06:11:09,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:09,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:09,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:09,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:10,064 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 06:11:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 06:11:10,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:10,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:11:10,258 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-10-27 06:11:10,258 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:11:10,263 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:11:10,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:11:10,647 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:11:10,648 INFO L272 AbstractInterpreter]: Visited 129 different actions 252 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 06:11:10,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:10,658 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:11:10,943 INFO L227 lantSequenceWeakener]: Weakened 211 states. On average, predicates are now at 81.87% of their original sizes. [2018-10-27 06:11:10,943 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:11:11,078 INFO L415 sIntCurrentIteration]: We unified 213 AI predicates to 213 [2018-10-27 06:11:11,078 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:11:11,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:11:11,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:11:11,079 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:11,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:11:11,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:11:11,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:11:11,080 INFO L87 Difference]: Start difference. First operand 1438 states and 1882 transitions. Second operand 10 states. [2018-10-27 06:11:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:15,780 INFO L93 Difference]: Finished difference Result 2876 states and 3820 transitions. [2018-10-27 06:11:15,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 06:11:15,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2018-10-27 06:11:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:15,788 INFO L225 Difference]: With dead ends: 2876 [2018-10-27 06:11:15,788 INFO L226 Difference]: Without dead ends: 1718 [2018-10-27 06:11:15,792 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-27 06:11:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2018-10-27 06:11:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1715. [2018-10-27 06:11:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-10-27 06:11:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2181 transitions. [2018-10-27 06:11:15,833 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2181 transitions. Word has length 214 [2018-10-27 06:11:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:15,833 INFO L481 AbstractCegarLoop]: Abstraction has 1715 states and 2181 transitions. [2018-10-27 06:11:15,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:11:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2181 transitions. [2018-10-27 06:11:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-27 06:11:15,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:15,842 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:15,842 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:15,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2026015352, now seen corresponding path program 1 times [2018-10-27 06:11:15,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:15,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:15,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:15,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 06:11:16,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:16,084 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:11:16,084 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-10-27 06:11:16,084 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:11:16,088 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:11:16,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:11:16,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:11:16,567 INFO L272 AbstractInterpreter]: Visited 131 different actions 526 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 06:11:16,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:16,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:11:16,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:16,576 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-27 06:11:16,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:16,586 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:11:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:16,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 06:11:17,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:11:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 06:11:17,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:11:17,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 06:11:17,967 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:11:17,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 06:11:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:11:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:11:17,968 INFO L87 Difference]: Start difference. First operand 1715 states and 2181 transitions. Second operand 11 states. [2018-10-27 06:11:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:20,854 INFO L93 Difference]: Finished difference Result 3589 states and 4709 transitions. [2018-10-27 06:11:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:11:20,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 223 [2018-10-27 06:11:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:20,866 INFO L225 Difference]: With dead ends: 3589 [2018-10-27 06:11:20,866 INFO L226 Difference]: Without dead ends: 2293 [2018-10-27 06:11:20,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 447 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:11:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2018-10-27 06:11:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2285. [2018-10-27 06:11:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2018-10-27 06:11:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2863 transitions. [2018-10-27 06:11:20,934 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2863 transitions. Word has length 223 [2018-10-27 06:11:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:20,934 INFO L481 AbstractCegarLoop]: Abstraction has 2285 states and 2863 transitions. [2018-10-27 06:11:20,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 06:11:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2863 transitions. [2018-10-27 06:11:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-27 06:11:20,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:20,945 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:20,946 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:20,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1231117510, now seen corresponding path program 2 times [2018-10-27 06:11:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:20,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:20,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 06:11:21,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:21,911 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:11:21,911 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 06:11:21,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 06:11:21,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:21,912 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-27 06:11:21,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:21,930 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 06:11:22,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 06:11:22,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:22,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 06:11:22,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:11:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 06:11:22,334 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:11:22,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-27 06:11:22,334 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:22,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:11:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:11:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:11:22,335 INFO L87 Difference]: Start difference. First operand 2285 states and 2863 transitions. Second operand 3 states. [2018-10-27 06:11:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:23,129 INFO L93 Difference]: Finished difference Result 5115 states and 6588 transitions. [2018-10-27 06:11:23,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:11:23,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-10-27 06:11:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:23,130 INFO L225 Difference]: With dead ends: 5115 [2018-10-27 06:11:23,130 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 06:11:23,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 445 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:11:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 06:11:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 06:11:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 06:11:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:11:23,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2018-10-27 06:11:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:23,145 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:23,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:11:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:23,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 06:11:23,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 06:11:23,703 WARN L179 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2018-10-27 06:11:24,257 WARN L179 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2018-10-27 06:11:25,281 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 143 DAG size of output: 89 [2018-10-27 06:11:25,397 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 [2018-10-27 06:11:25,530 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-10-27 06:11:25,534 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:11:25,534 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-10-27 06:11:25,534 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:11:25,534 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-27 06:11:25,535 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-27 06:11:25,535 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,535 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,535 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,535 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,535 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,535 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,535 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-27 06:11:25,536 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-27 06:11:25,536 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-27 06:11:25,536 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-27 06:11:25,536 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-27 06:11:25,536 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-27 06:11:25,536 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-27 06:11:25,536 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-27 06:11:25,536 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-27 06:11:25,536 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 06:11:25,537 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-27 06:11:25,538 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-27 06:11:25,538 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-27 06:11:25,538 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-27 06:11:25,538 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-27 06:11:25,538 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-27 06:11:25,538 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-27 06:11:25,538 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-27 06:11:25,538 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-27 06:11:25,539 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-27 06:11:25,539 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-27 06:11:25,539 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-27 06:11:25,539 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,539 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,539 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,539 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,539 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,539 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-27 06:11:25,540 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-27 06:11:25,540 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-27 06:11:25,540 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-27 06:11:25,540 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-27 06:11:25,540 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-27 06:11:25,540 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-27 06:11:25,540 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-27 06:11:25,540 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-27 06:11:25,541 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,541 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,541 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,541 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,541 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,541 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-27 06:11:25,541 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-27 06:11:25,541 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-27 06:11:25,542 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-27 06:11:25,542 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-27 06:11:25,542 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-27 06:11:25,542 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-27 06:11:25,542 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-27 06:11:25,542 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-27 06:11:25,542 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-27 06:11:25,542 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-27 06:11:25,543 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-27 06:11:25,543 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-27 06:11:25,543 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,543 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,543 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,543 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,543 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,543 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-27 06:11:25,543 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-27 06:11:25,544 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-27 06:11:25,544 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-27 06:11:25,544 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-27 06:11:25,544 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-27 06:11:25,544 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-27 06:11:25,544 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-27 06:11:25,544 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-27 06:11:25,544 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,545 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,545 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,545 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,545 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,545 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,545 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-27 06:11:25,545 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,545 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-27 06:11:25,546 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-27 06:11:25,546 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-27 06:11:25,546 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-27 06:11:25,546 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-27 06:11:25,546 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-27 06:11:25,546 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-27 06:11:25,546 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-27 06:11:25,546 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-27 06:11:25,547 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-27 06:11:25,547 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-27 06:11:25,547 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-27 06:11:25,547 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-27 06:11:25,547 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,547 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,547 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,547 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,547 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,548 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,549 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,549 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,549 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,549 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-27 06:11:25,549 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-27 06:11:25,549 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-27 06:11:25,549 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-27 06:11:25,549 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-27 06:11:25,549 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-27 06:11:25,550 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-27 06:11:25,550 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-27 06:11:25,550 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-27 06:11:25,550 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-27 06:11:25,550 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse23 (= |old(~a20~0)| ~a20~0)) (.cse24 (= |old(~a16~0)| ~a16~0)) (.cse19 (= 13 |old(~a8~0)|))) (let ((.cse14 (not (= 5 |old(~a16~0)|))) (.cse12 (= ~a17~0 1)) (.cse3 (not (= 4 |old(~a16~0)|))) (.cse5 (= 13 ~a8~0)) (.cse6 (= 1 ~a21~0)) (.cse7 (= 1 ~a17~0)) (.cse1 (= 1 |old(~a7~0)|)) (.cse8 (not .cse19)) (.cse9 (not (= 1 |old(~a17~0)|))) (.cse20 (and .cse23 .cse24)) (.cse11 (= |calculate_output_#in~input| 0)) (.cse16 (= ~a8~0 15)) (.cse17 (= ~a21~0 1)) (.cse15 (= ~a7~0 0)) (.cse21 (= 6 |old(~a16~0)|)) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse2 (not (= 1 |old(~a20~0)|))) (.cse13 (not (= 15 |old(~a8~0)|))) (.cse18 (not (= ~a8~0 13))) (.cse4 (not (= 8 ~a12~0))) (.cse22 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (not (= ~a7~0 1)) .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 .cse0 .cse4 .cse11 .cse9 .cse12 .cse2 .cse13 .cse14) (or (or .cse10 .cse0 .cse13 (not (= 0 |old(~a20~0)|)) .cse14 .cse4) .cse11 (and .cse15 .cse16 .cse12 .cse17) .cse9) (or .cse2 .cse18 .cse19 .cse4) (or .cse0 .cse2 .cse3 (and (= 1 ~a7~0) .cse5 .cse6 .cse7) .cse4 (not .cse1) .cse8 .cse9) (or .cse2 .cse20 .cse4) (or .cse21 .cse10 .cse0 .cse2 .cse13 (= 0 |old(~a16~0)|) .cse4 .cse11 (and .cse16 .cse17 .cse15)) (or (< 4 |old(~a16~0)|) .cse20 .cse4 .cse22) (or .cse11 (and .cse16 .cse17 (= ~a17~0 0) .cse15) (or (not .cse21) .cse10 .cse0 .cse2 .cse13 (not (= 0 |old(~a17~0)|)) .cse4)) (or (and .cse23 .cse24 .cse18) .cse19 .cse4 .cse22)))) [2018-10-27 06:11:25,550 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-27 06:11:25,551 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 527) no Hoare annotation was computed. [2018-10-27 06:11:25,551 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,551 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,551 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,551 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,551 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-27 06:11:25,551 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,551 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,552 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-27 06:11:25,553 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-27 06:11:25,554 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-27 06:11:25,555 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 06:11:25,555 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:11:25,555 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (= ~a8~0 15) (= ~a17~0 1) (= ~a21~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-10-27 06:11:25,556 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-27 06:11:25,556 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-10-27 06:11:25,556 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-27 06:11:25,556 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-27 06:11:25,556 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-27 06:11:25,556 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-10-27 06:11:25,556 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-27 06:11:25,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 06:11:25 BoogieIcfgContainer [2018-10-27 06:11:25,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 06:11:25,569 INFO L168 Benchmark]: Toolchain (without parser) took 47831.57 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 369.2 MB. Max. memory is 7.1 GB. [2018-10-27 06:11:25,570 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:11:25,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.51 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-27 06:11:25,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 179.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-27 06:11:25,572 INFO L168 Benchmark]: Boogie Preprocessor took 105.47 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:11:25,573 INFO L168 Benchmark]: RCFGBuilder took 3475.19 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: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2018-10-27 06:11:25,574 INFO L168 Benchmark]: TraceAbstraction took 43326.08 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 774.9 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -479.5 MB). Peak memory consumption was 295.4 MB. Max. memory is 7.1 GB. [2018-10-27 06:11:25,578 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 740.51 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 179.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.47 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3475.19 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: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43326.08 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 774.9 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -479.5 MB). Peak memory consumption was 295.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a20 <= 0 && !(a8 == 13)) || !(0 == \old(a7))) || !(1 == \old(a21))) || !(8 == a12)) || (a20 <= 0 && a16 <= 4)) || \old(a20) == a20) || !(1 == \old(a17))) || !(1 == \old(a20))) || !(15 == \old(a8))) || !(5 == \old(a16)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 43.2s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 28.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1381 SDtfs, 4884 SDslu, 1304 SDs, 0 SdLazy, 7068 SolverSat, 1145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1538 GetRequests, 1448 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2285occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9974585564825035 AbsIntWeakeningRatio, 0.2074468085106383 AbsIntAvgWeakeningVarsNumRemoved, 29.28191489361702 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 86 PreInvPairs, 132 NumberOfFragments, 499 HoareAnnotationTreeSize, 86 FomulaSimplifications, 1865 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1346 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2064 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2563 ConstructedInterpolants, 0 QuantifiedInterpolants, 1557056 SizeOfPredicates, 3 NumberOfNonLiveVariables, 992 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1209/1393 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...