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_label30_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:02:12,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:02:12,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:02:12,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:02:12,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:02:12,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:02:12,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:02:12,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:02:12,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:02:12,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:02:12,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:02:12,902 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:02:12,903 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:02:12,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:02:12,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:02:12,906 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:02:12,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:02:12,909 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:02:12,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:02:12,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:02:12,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:02:12,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:02:12,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:02:12,921 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:02:12,921 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:02:12,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:02:12,923 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:02:12,924 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:02:12,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:02:12,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:02:12,926 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:02:12,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:02:12,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:02:12,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:02:12,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:02:12,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:02:12,931 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:02:12,961 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:02:12,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:02:12,962 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:02:12,963 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:02:12,964 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:02:12,964 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:02:12,964 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:02:12,964 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:02:12,964 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:02:12,965 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:02:12,965 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:02:12,965 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:02:12,965 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:02:12,965 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:02:12,967 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:02:12,967 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:02:12,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:02:12,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:02:12,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:02:12,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:02:12,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:02:12,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:02:12,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:02:12,968 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:02:12,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:02:12,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:02:12,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:02:12,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:02:12,969 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:02:12,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:02:12,972 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:02:12,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:02:12,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:02:12,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:02:12,973 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:02:12,973 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:02:13,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:02:13,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:02:13,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:02:13,051 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:02:13,051 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:02:13,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-10-25 00:02:13,105 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ca4c7de05/bc4c69da4e5c44bc9f5d3e50792c2837/FLAGa702f06d5 [2018-10-25 00:02:13,657 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:02:13,657 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-10-25 00:02:13,686 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ca4c7de05/bc4c69da4e5c44bc9f5d3e50792c2837/FLAGa702f06d5 [2018-10-25 00:02:13,709 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ca4c7de05/bc4c69da4e5c44bc9f5d3e50792c2837 [2018-10-25 00:02:13,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:02:13,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:02:13,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:02:13,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:02:13,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:02:13,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:02:13" (1/1) ... [2018-10-25 00:02:13,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21dfb9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:13, skipping insertion in model container [2018-10-25 00:02:13,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:02:13" (1/1) ... [2018-10-25 00:02:13,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:02:13,800 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:02:14,323 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:02:14,328 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:02:14,442 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:02:14,468 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:02:14,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14 WrapperNode [2018-10-25 00:02:14,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:02:14,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:02:14,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:02:14,469 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:02:14,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... [2018-10-25 00:02:14,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... [2018-10-25 00:02:14,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:02:14,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:02:14,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:02:14,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:02:14,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... [2018-10-25 00:02:14,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... [2018-10-25 00:02:14,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... [2018-10-25 00:02:14,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... [2018-10-25 00:02:14,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... [2018-10-25 00:02:14,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... [2018-10-25 00:02:14,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... [2018-10-25 00:02:14,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:02:14,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:02:14,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:02:14,731 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:02:14,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:02:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:02:14,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:02:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:02:14,799 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:02:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:02:14,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:02:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:02:14,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:02:17,932 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:02:17,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:17 BoogieIcfgContainer [2018-10-25 00:02:17,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:02:17,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:02:17,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:02:17,941 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:02:17,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:02:13" (1/3) ... [2018-10-25 00:02:17,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1a80ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:17, skipping insertion in model container [2018-10-25 00:02:17,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:14" (2/3) ... [2018-10-25 00:02:17,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1a80ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:17, skipping insertion in model container [2018-10-25 00:02:17,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:17" (3/3) ... [2018-10-25 00:02:17,947 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label30_true-unreach-call_false-termination.c [2018-10-25 00:02:17,959 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:02:17,972 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:02:17,991 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:02:18,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:02:18,046 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:02:18,046 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:02:18,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:02:18,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:02:18,047 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:02:18,047 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:02:18,047 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:02:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:02:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 00:02:18,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:18,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:18,118 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:18,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:18,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2071841880, now seen corresponding path program 1 times [2018-10-25 00:02:18,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:18,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:18,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:18,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:18,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:19,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:19,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 00:02:19,024 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:19,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 00:02:19,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 00:02:19,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:02:19,053 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 4 states. [2018-10-25 00:02:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:21,470 INFO L93 Difference]: Finished difference Result 702 states and 1227 transitions. [2018-10-25 00:02:21,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:02:21,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-10-25 00:02:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:21,495 INFO L225 Difference]: With dead ends: 702 [2018-10-25 00:02:21,495 INFO L226 Difference]: Without dead ends: 488 [2018-10-25 00:02:21,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:02:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-25 00:02:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 340. [2018-10-25 00:02:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:02:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 571 transitions. [2018-10-25 00:02:21,618 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 571 transitions. Word has length 132 [2018-10-25 00:02:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:21,620 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 571 transitions. [2018-10-25 00:02:21,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 00:02:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 571 transitions. [2018-10-25 00:02:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-25 00:02:21,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:21,627 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:21,627 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:21,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1746853559, now seen corresponding path program 1 times [2018-10-25 00:02:21,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:21,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:21,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:21,906 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:02:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:22,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:22,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:02:22,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:22,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:22,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:22,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:22,037 INFO L87 Difference]: Start difference. First operand 340 states and 571 transitions. Second operand 6 states. [2018-10-25 00:02:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:23,516 INFO L93 Difference]: Finished difference Result 882 states and 1513 transitions. [2018-10-25 00:02:23,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:23,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-10-25 00:02:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:23,526 INFO L225 Difference]: With dead ends: 882 [2018-10-25 00:02:23,527 INFO L226 Difference]: Without dead ends: 548 [2018-10-25 00:02:23,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-10-25 00:02:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 531. [2018-10-25 00:02:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-10-25 00:02:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 836 transitions. [2018-10-25 00:02:23,573 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 836 transitions. Word has length 143 [2018-10-25 00:02:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:23,574 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 836 transitions. [2018-10-25 00:02:23,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 836 transitions. [2018-10-25 00:02:23,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-25 00:02:23,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:23,580 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:23,580 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:23,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1493139701, now seen corresponding path program 1 times [2018-10-25 00:02:23,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:23,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:23,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:23,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:23,582 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:24,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:24,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:02:24,132 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:24,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:02:24,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:02:24,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:02:24,135 INFO L87 Difference]: Start difference. First operand 531 states and 836 transitions. Second operand 5 states. [2018-10-25 00:02:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:26,096 INFO L93 Difference]: Finished difference Result 1192 states and 1911 transitions. [2018-10-25 00:02:26,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:02:26,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-10-25 00:02:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:26,106 INFO L225 Difference]: With dead ends: 1192 [2018-10-25 00:02:26,106 INFO L226 Difference]: Without dead ends: 528 [2018-10-25 00:02:26,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:02:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-25 00:02:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-10-25 00:02:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-25 00:02:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 782 transitions. [2018-10-25 00:02:26,152 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 782 transitions. Word has length 144 [2018-10-25 00:02:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:26,152 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 782 transitions. [2018-10-25 00:02:26,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:02:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 782 transitions. [2018-10-25 00:02:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 00:02:26,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:26,156 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:26,156 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:26,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1935386109, now seen corresponding path program 1 times [2018-10-25 00:02:26,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:26,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:26,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:26,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:26,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:26,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:26,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:02:26,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:26,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:26,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:26,361 INFO L87 Difference]: Start difference. First operand 528 states and 782 transitions. Second operand 3 states. [2018-10-25 00:02:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:28,734 INFO L93 Difference]: Finished difference Result 1493 states and 2284 transitions. [2018-10-25 00:02:28,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:28,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-25 00:02:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:28,746 INFO L225 Difference]: With dead ends: 1493 [2018-10-25 00:02:28,746 INFO L226 Difference]: Without dead ends: 971 [2018-10-25 00:02:28,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-10-25 00:02:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2018-10-25 00:02:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2018-10-25 00:02:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1393 transitions. [2018-10-25 00:02:28,799 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1393 transitions. Word has length 148 [2018-10-25 00:02:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:28,799 INFO L481 AbstractCegarLoop]: Abstraction has 971 states and 1393 transitions. [2018-10-25 00:02:28,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1393 transitions. [2018-10-25 00:02:28,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-25 00:02:28,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:28,806 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:28,807 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:28,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:28,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1185891811, now seen corresponding path program 1 times [2018-10-25 00:02:28,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:28,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:28,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:28,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:28,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:29,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:29,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:02:29,035 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:29,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:29,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:29,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:29,037 INFO L87 Difference]: Start difference. First operand 971 states and 1393 transitions. Second operand 6 states. [2018-10-25 00:02:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:30,348 INFO L93 Difference]: Finished difference Result 2867 states and 4269 transitions. [2018-10-25 00:02:30,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:30,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-25 00:02:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:30,361 INFO L225 Difference]: With dead ends: 2867 [2018-10-25 00:02:30,361 INFO L226 Difference]: Without dead ends: 1902 [2018-10-25 00:02:30,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2018-10-25 00:02:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1873. [2018-10-25 00:02:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2018-10-25 00:02:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2527 transitions. [2018-10-25 00:02:30,433 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2527 transitions. Word has length 164 [2018-10-25 00:02:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:30,434 INFO L481 AbstractCegarLoop]: Abstraction has 1873 states and 2527 transitions. [2018-10-25 00:02:30,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2527 transitions. [2018-10-25 00:02:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-25 00:02:30,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:30,443 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:30,443 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:30,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash -151226562, now seen corresponding path program 1 times [2018-10-25 00:02:30,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:30,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:30,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:30,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:30,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:30,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:30,651 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-10-25 00:02:30,653 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [26], [30], [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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:30,708 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:30,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:31,393 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:31,395 INFO L272 AbstractInterpreter]: Visited 133 different actions 133 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-25 00:02:31,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:31,439 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:32,104 INFO L232 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 80.61% of their original sizes. [2018-10-25 00:02:32,104 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:32,359 INFO L413 sIntCurrentIteration]: We have 176 unified AI predicates [2018-10-25 00:02:32,359 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:32,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:32,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:02:32,362 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:32,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:32,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:32,363 INFO L87 Difference]: Start difference. First operand 1873 states and 2527 transitions. Second operand 6 states. [2018-10-25 00:02:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:40,147 INFO L93 Difference]: Finished difference Result 3878 states and 5218 transitions. [2018-10-25 00:02:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:02:40,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2018-10-25 00:02:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:40,159 INFO L225 Difference]: With dead ends: 3878 [2018-10-25 00:02:40,159 INFO L226 Difference]: Without dead ends: 2011 [2018-10-25 00:02:40,165 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:02:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2018-10-25 00:02:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 2009. [2018-10-25 00:02:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-10-25 00:02:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2669 transitions. [2018-10-25 00:02:40,220 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2669 transitions. Word has length 177 [2018-10-25 00:02:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:40,221 INFO L481 AbstractCegarLoop]: Abstraction has 2009 states and 2669 transitions. [2018-10-25 00:02:40,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2669 transitions. [2018-10-25 00:02:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-25 00:02:40,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:40,230 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:40,230 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:40,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1836874565, now seen corresponding path program 1 times [2018-10-25 00:02:40,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:40,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:40,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:02:40,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:40,570 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:40,570 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-10-25 00:02:40,571 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:40,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:40,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:41,048 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:41,049 INFO L272 AbstractInterpreter]: Visited 137 different actions 268 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:41,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:41,089 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:41,693 INFO L232 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 80.68% of their original sizes. [2018-10-25 00:02:41,694 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:42,102 INFO L413 sIntCurrentIteration]: We have 185 unified AI predicates [2018-10-25 00:02:42,102 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:42,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:42,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:02:42,103 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:42,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:02:42,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:02:42,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:02:42,104 INFO L87 Difference]: Start difference. First operand 2009 states and 2669 transitions. Second operand 10 states. [2018-10-25 00:02:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:51,447 INFO L93 Difference]: Finished difference Result 4017 states and 5385 transitions. [2018-10-25 00:02:51,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:02:51,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2018-10-25 00:02:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:51,458 INFO L225 Difference]: With dead ends: 4017 [2018-10-25 00:02:51,459 INFO L226 Difference]: Without dead ends: 2150 [2018-10-25 00:02:51,466 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:02:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2018-10-25 00:02:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2147. [2018-10-25 00:02:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2018-10-25 00:02:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2817 transitions. [2018-10-25 00:02:51,523 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2817 transitions. Word has length 186 [2018-10-25 00:02:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:51,523 INFO L481 AbstractCegarLoop]: Abstraction has 2147 states and 2817 transitions. [2018-10-25 00:02:51,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:02:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2817 transitions. [2018-10-25 00:02:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-25 00:02:51,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:51,533 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:51,533 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:51,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash -315492441, now seen corresponding path program 1 times [2018-10-25 00:02:51,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:51,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:51,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:51,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:51,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 00:02:51,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:51,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:51,722 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-10-25 00:02:51,722 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [26], [30], [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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:51,728 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:51,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:52,243 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:52,244 INFO L272 AbstractInterpreter]: Visited 137 different actions 268 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:52,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:52,246 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:52,875 INFO L232 lantSequenceWeakener]: Weakened 155 states. On average, predicates are now at 80.9% of their original sizes. [2018-10-25 00:02:52,875 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:56,661 INFO L413 sIntCurrentIteration]: We have 218 unified AI predicates [2018-10-25 00:02:56,661 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:56,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:56,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:02:56,662 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:56,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:02:56,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:02:56,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:02:56,663 INFO L87 Difference]: Start difference. First operand 2147 states and 2817 transitions. Second operand 15 states. [2018-10-25 00:03:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:11,561 INFO L93 Difference]: Finished difference Result 4483 states and 5914 transitions. [2018-10-25 00:03:11,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:03:11,562 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 219 [2018-10-25 00:03:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:11,573 INFO L225 Difference]: With dead ends: 4483 [2018-10-25 00:03:11,574 INFO L226 Difference]: Without dead ends: 2616 [2018-10-25 00:03:11,580 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 84 SyntacticMatches, 121 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:03:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2018-10-25 00:03:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2469. [2018-10-25 00:03:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2018-10-25 00:03:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3161 transitions. [2018-10-25 00:03:11,642 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3161 transitions. Word has length 219 [2018-10-25 00:03:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:11,643 INFO L481 AbstractCegarLoop]: Abstraction has 2469 states and 3161 transitions. [2018-10-25 00:03:11,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:03:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3161 transitions. [2018-10-25 00:03:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-25 00:03:11,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:11,653 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:11,653 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:11,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:11,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1938544868, now seen corresponding path program 1 times [2018-10-25 00:03:11,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:11,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:11,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:11,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 95 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-25 00:03:12,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:12,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:12,252 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-10-25 00:03:12,252 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:12,256 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:12,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:13,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:13,018 INFO L272 AbstractInterpreter]: Visited 138 different actions 556 times. Merged at 8 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:03:13,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:13,023 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:15,092 INFO L232 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 80.62% of their original sizes. [2018-10-25 00:03:15,092 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:20,416 INFO L413 sIntCurrentIteration]: We have 227 unified AI predicates [2018-10-25 00:03:20,416 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:20,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:20,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2018-10-25 00:03:20,417 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:20,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:03:20,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:03:20,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:03:20,419 INFO L87 Difference]: Start difference. First operand 2469 states and 3161 transitions. Second operand 13 states. [2018-10-25 00:03:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:37,855 INFO L93 Difference]: Finished difference Result 6565 states and 8724 transitions. [2018-10-25 00:03:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-25 00:03:37,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 228 [2018-10-25 00:03:37,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:37,874 INFO L225 Difference]: With dead ends: 6565 [2018-10-25 00:03:37,874 INFO L226 Difference]: Without dead ends: 4698 [2018-10-25 00:03:37,883 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 233 GetRequests, 45 SyntacticMatches, 171 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-10-25 00:03:37,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2018-10-25 00:03:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 4624. [2018-10-25 00:03:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4624 states. [2018-10-25 00:03:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 5868 transitions. [2018-10-25 00:03:38,013 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 5868 transitions. Word has length 228 [2018-10-25 00:03:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:38,014 INFO L481 AbstractCegarLoop]: Abstraction has 4624 states and 5868 transitions. [2018-10-25 00:03:38,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:03:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 5868 transitions. [2018-10-25 00:03:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-25 00:03:38,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:38,031 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:38,032 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:38,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:38,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1391516712, now seen corresponding path program 1 times [2018-10-25 00:03:38,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:38,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:38,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:38,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:38,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:03:39,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:39,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:39,043 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-10-25 00:03:39,043 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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:39,046 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:39,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:40,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:03:40,393 INFO L272 AbstractInterpreter]: Visited 139 different actions 561 times. Merged at 9 different actions 41 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:03:40,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:40,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:03:40,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:40,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:03:40,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:40,414 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:03:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:40,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:03:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-25 00:03:40,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:03:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:03:41,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:03:41,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:03:41,784 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:03:41,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:03:41,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:03:41,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:03:41,786 INFO L87 Difference]: Start difference. First operand 4624 states and 5868 transitions. Second operand 11 states. [2018-10-25 00:03:43,407 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-10-25 00:03:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:46,027 INFO L93 Difference]: Finished difference Result 10228 states and 13114 transitions. [2018-10-25 00:03:46,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:03:46,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 231 [2018-10-25 00:03:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:46,053 INFO L225 Difference]: With dead ends: 10228 [2018-10-25 00:03:46,053 INFO L226 Difference]: Without dead ends: 6068 [2018-10-25 00:03:46,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 463 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:03:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2018-10-25 00:03:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 6037. [2018-10-25 00:03:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6037 states. [2018-10-25 00:03:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6037 states to 6037 states and 7437 transitions. [2018-10-25 00:03:46,277 INFO L78 Accepts]: Start accepts. Automaton has 6037 states and 7437 transitions. Word has length 231 [2018-10-25 00:03:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:46,277 INFO L481 AbstractCegarLoop]: Abstraction has 6037 states and 7437 transitions. [2018-10-25 00:03:46,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:03:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 6037 states and 7437 transitions. [2018-10-25 00:03:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-25 00:03:46,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:46,299 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:46,299 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:46,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1335216166, now seen corresponding path program 2 times [2018-10-25 00:03:46,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:46,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:46,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:46,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:03:46,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:46,799 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:46,800 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 00:03:46,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 00:03:46,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:46,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:03:46,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 00:03:46,811 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 00:03:46,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-25 00:03:46,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 00:03:46,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:03:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-25 00:03:47,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:03:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-25 00:03:47,245 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:47,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:03:47,246 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:47,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:03:47,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:03:47,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:03:47,248 INFO L87 Difference]: Start difference. First operand 6037 states and 7437 transitions. Second operand 3 states. [2018-10-25 00:03:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:48,240 INFO L93 Difference]: Finished difference Result 13596 states and 17101 transitions. [2018-10-25 00:03:48,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:03:48,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2018-10-25 00:03:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:48,243 INFO L225 Difference]: With dead ends: 13596 [2018-10-25 00:03:48,243 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:03:48,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 461 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:03:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:03:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:03:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:03:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:03:48,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2018-10-25 00:03:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:48,277 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:03:48,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:03:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:03:48,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:03:48,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:03:49,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,408 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 163 [2018-10-25 00:03:49,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:49,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:50,129 WARN L179 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 155 [2018-10-25 00:03:50,689 WARN L179 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-25 00:03:51,115 WARN L179 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 86 [2018-10-25 00:03:55,549 WARN L179 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 334 DAG size of output: 143 [2018-10-25 00:03:56,039 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 96 [2018-10-25 00:03:56,533 WARN L179 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 96 [2018-10-25 00:03:56,537 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:56,537 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-10-25 00:03:56,537 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:56,537 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:03:56,537 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:03:56,538 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,538 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,538 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,538 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,538 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,538 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,538 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:03:56,538 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,539 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:03:56,540 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,541 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,542 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:03:56,543 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,544 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2018-10-25 00:03:56,545 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:03:56,546 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,547 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,548 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,548 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,548 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:03:56,548 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:03:56,548 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:03:56,548 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:03:56,548 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:03:56,548 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:03:56,548 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:03:56,549 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:03:56,550 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:03:56,550 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:03:56,550 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:03:56,550 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:03:56,550 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:03:56,550 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:03:56,551 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse12 (= 1 ~a17~0))) (let ((.cse10 (not (= 1 |old(~a21~0)|))) (.cse19 (= 0 |old(~a16~0)|)) (.cse20 (= 0 |old(~a8~0)|)) (.cse18 (= 1 |old(~a17~0)|)) (.cse17 (or (not (= ~a7~0 ~a17~0)) (not .cse12))) (.cse21 (= |old(~a8~0)| ~a8~0)) (.cse22 (= |old(~a20~0)| ~a20~0)) (.cse23 (= |old(~a16~0)| ~a16~0))) (let ((.cse15 (and .cse21 .cse22 .cse23)) (.cse11 (not (= 1 |old(~a20~0)|))) (.cse8 (and .cse21 .cse22 .cse23 .cse17)) (.cse6 (and (= |old(~a7~0)| |old(~a17~0)|) .cse18)) (.cse5 (= 13 |old(~a8~0)|)) (.cse16 (< 4 |old(~a16~0)|)) (.cse13 (and (= ~a7~0 0) (not (= ~a16~0 0)) (not (= ~a8~0 0)) (= ~a21~0 1))) (.cse14 (or (not (= 0 |old(~a7~0)|)) .cse10 .cse19 .cse20)) (.cse7 (not (= 8 ~a12~0))) (.cse9 (< 0 |old(~a20~0)|)) (.cse3 (= ~a17~0 1)) (.cse4 (or (not (= ~v~0 22)) .cse19 (not (= ~u~0 21)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (= |calculate_output_#in~input| 0) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) .cse20 (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)))) (.cse0 (not (= 15 |old(~a8~0)|))) (.cse1 (not (= 5 |old(~a16~0)|))) (.cse2 (not .cse18))) (and (or (or .cse0 (not (= 0 |old(~a20~0)|)) .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 (not (= 4 |old(~a16~0)|)) (and (= 1 ~a7~0) (= 1 ~a21~0) .cse12) .cse7 (not (= 1 |old(~a7~0)|)) (not .cse5) .cse2) (or .cse11 .cse13 .cse14 .cse7) (or .cse15 .cse16 .cse7 .cse9) (or (= 6 |old(~a16~0)|) .cse11 .cse15 .cse7) (or .cse11 .cse6 .cse7 .cse8) (or .cse16 .cse17 .cse6 .cse7 .cse9) (or .cse13 .cse14 .cse5 .cse7 .cse9) (or .cse16 .cse13 .cse14 .cse7 .cse9) (or .cse3 (not (= |old(~a20~0)| 1)) .cse4 (or .cse0 .cse1 .cse2)))))) [2018-10-25 00:03:56,551 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:03:56,551 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,551 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,551 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,551 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,551 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:03:56,551 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,551 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:03:56,552 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,553 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:03:56,554 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:03:56,554 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:03:56,554 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:03:56,554 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:03:56,554 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:03:56,554 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:03:56,554 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:03:56,554 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:03:56,554 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,555 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:03:56,556 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:03:56,557 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:56,557 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:03:56,557 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:03:56,557 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:56,557 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:03:56,557 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:56,558 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0)) (.cse1 (or (not (= ~a7~0 ~a17~0)) (not (= 1 ~a17~0))))) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse0 (<= ~a16~0 4)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and .cse1 (not (= ~a8~0 13)) .cse0) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and (= 1 ~a20~0) .cse1) (not (= 23 ~w~0)) (and (= |old(~a20~0)| ~a20~0) (not (= ~a16~0 6))) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-25 00:03:56,558 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:03:56,558 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:03:56,558 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:03:56,558 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0)) (.cse1 (or (not (= ~a7~0 ~a17~0)) (not (= 1 ~a17~0))))) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse0 (<= ~a16~0 4)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and .cse1 (not (= ~a8~0 13)) .cse0) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and (= 1 ~a20~0) .cse1) (not (= 23 ~w~0)) (and (= |old(~a20~0)| ~a20~0) (not (= ~a16~0 6))) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-25 00:03:56,558 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:56,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:03:56 BoogieIcfgContainer [2018-10-25 00:03:56,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:03:56,575 INFO L168 Benchmark]: Toolchain (without parser) took 102855.00 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:56,577 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:03:56,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:56,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 172.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.5 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:56,579 INFO L168 Benchmark]: Boogie Preprocessor took 88.18 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-25 00:03:56,579 INFO L168 Benchmark]: RCFGBuilder took 3202.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:56,580 INFO L168 Benchmark]: TraceAbstraction took 98637.30 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -722.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:56,585 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.23 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 746.12 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 172.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.5 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 88.18 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 3202.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98637.30 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -722.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: 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: (((((((((((((((((((((!(\old(a21) == 1) || !(b == 2)) || !(y == 25)) || (a20 <= 0 && a16 <= 4)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || (((!(a7 == a17) || !(1 == a17)) && !(a8 == 13)) && a20 <= 0)) || !(3 == c)) || !(\old(a20) == 1)) || (1 == a20 && (!(a7 == a17) || !(1 == a17)))) || !(23 == w)) || (\old(a20) == a20 && !(a16 == 6))) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 98.5s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 64.5s AutomataDifference, 0.0s DeadEndRemovalTime, 8.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1431 SDtfs, 6225 SDslu, 1572 SDs, 0 SdLazy, 12766 SolverSat, 1289 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1818 GetRequests, 1415 SyntacticMatches, 301 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6037occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.9s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9973579046710379 AbsIntWeakeningRatio, 0.20347394540942929 AbsIntAvgWeakeningVarsNumRemoved, 7.663771712158809 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 451 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 178 PreInvPairs, 284 NumberOfFragments, 902 HoareAnnotationTreeSize, 178 FomulaSimplifications, 25004 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 25778 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2465 NumberOfCodeBlocks, 2398 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2912 ConstructedInterpolants, 0 QuantifiedInterpolants, 1572067 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1012 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 1343/1560 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...