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_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:01:50,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:01:50,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:01:50,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:01:50,983 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:01:50,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:01:50,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:01:50,987 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:01:50,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:01:50,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:01:50,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:01:50,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:01:50,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:01:50,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:01:50,994 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:01:50,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:01:50,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:01:50,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:01:51,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:01:51,003 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:01:51,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:01:51,007 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:01:51,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:01:51,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:01:51,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:01:51,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:01:51,018 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:01:51,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:01:51,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:01:51,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:01:51,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:01:51,028 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:01:51,028 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:01:51,028 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:01:51,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:01:51,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:01:51,030 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:01:51,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:01:51,059 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:01:51,061 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:01:51,062 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:01:51,064 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:01:51,064 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:01:51,065 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:01:51,065 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:01:51,065 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:01:51,065 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:01:51,065 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:01:51,066 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:01:51,066 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:01:51,066 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:01:51,067 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:01:51,067 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:01:51,068 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:01:51,068 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:01:51,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:01:51,068 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:01:51,068 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:01:51,069 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:01:51,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:01:51,070 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:01:51,071 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:01:51,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:01:51,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:01:51,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:01:51,071 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:01:51,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:01:51,072 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:01:51,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:01:51,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:01:51,072 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:01:51,073 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:01:51,073 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:01:51,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:01:51,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:01:51,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:01:51,165 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:01:51,165 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:01:51,166 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-10-25 00:01:51,236 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/780b1ad3e/9e43a48b09a84f82a5e2ad3d54847f52/FLAG3a621a8ea [2018-10-25 00:01:51,850 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:01:51,854 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-10-25 00:01:51,873 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/780b1ad3e/9e43a48b09a84f82a5e2ad3d54847f52/FLAG3a621a8ea [2018-10-25 00:01:51,897 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/780b1ad3e/9e43a48b09a84f82a5e2ad3d54847f52 [2018-10-25 00:01:51,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:01:51,911 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:01:51,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:01:51,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:01:51,917 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:01:51,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:51" (1/1) ... [2018-10-25 00:01:51,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e34a1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:51, skipping insertion in model container [2018-10-25 00:01:51,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:51" (1/1) ... [2018-10-25 00:01:51,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:01:51,995 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:01:52,465 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:01:52,473 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:01:52,623 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:01:52,644 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:01:52,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52 WrapperNode [2018-10-25 00:01:52,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:01:52,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:01:52,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:01:52,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:01:52,658 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:01:52" (1/1) ... [2018-10-25 00:01:52,693 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:01:52" (1/1) ... [2018-10-25 00:01:52,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:01:52,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:01:52,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:01:52,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:01:52,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52" (1/1) ... [2018-10-25 00:01:52,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52" (1/1) ... [2018-10-25 00:01:52,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52" (1/1) ... [2018-10-25 00:01:52,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52" (1/1) ... [2018-10-25 00:01:52,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52" (1/1) ... [2018-10-25 00:01:52,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52" (1/1) ... [2018-10-25 00:01:52,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52" (1/1) ... [2018-10-25 00:01:52,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:01:52,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:01:52,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:01:52,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:01:52,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52" (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:01:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:01:53,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:01:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:01:53,077 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:01:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:01:53,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:01:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:01:53,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:01:56,622 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:01:56,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:01:56 BoogieIcfgContainer [2018-10-25 00:01:56,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:01:56,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:01:56,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:01:56,628 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:01:56,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:01:51" (1/3) ... [2018-10-25 00:01:56,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a1c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:01:56, skipping insertion in model container [2018-10-25 00:01:56,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:52" (2/3) ... [2018-10-25 00:01:56,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a1c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:01:56, skipping insertion in model container [2018-10-25 00:01:56,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:01:56" (3/3) ... [2018-10-25 00:01:56,632 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label23_true-unreach-call_false-termination.c [2018-10-25 00:01:56,642 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:01:56,652 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:01:56,670 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:01:56,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:01:56,727 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:01:56,727 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:01:56,727 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:01:56,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:01:56,727 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:01:56,728 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:01:56,728 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:01:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:01:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-25 00:01:56,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:56,792 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] [2018-10-25 00:01:56,795 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:56,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1921053824, now seen corresponding path program 1 times [2018-10-25 00:01:56,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:56,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:56,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:57,413 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:01:57,562 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:01:57,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:57,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:01:57,565 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:57,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:01:57,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:01:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:57,592 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:01:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:59,536 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:01:59,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:01:59,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-25 00:01:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:59,569 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:01:59,569 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:01:59,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:01:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:01:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:01:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-25 00:01:59,672 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 102 [2018-10-25 00:01:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:59,673 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-25 00:01:59,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:01:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-25 00:01:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-25 00:01:59,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:59,683 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] [2018-10-25 00:01:59,684 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:59,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:59,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1248804383, now seen corresponding path program 1 times [2018-10-25 00:01:59,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:59,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:59,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:59,929 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:01:59,968 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:01:59,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:59,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:01:59,969 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:59,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:01:59,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:01:59,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:01:59,972 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-25 00:02:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:01,782 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-25 00:02:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:01,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-10-25 00:02:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:01,791 INFO L225 Difference]: With dead ends: 888 [2018-10-25 00:02:01,791 INFO L226 Difference]: Without dead ends: 554 [2018-10-25 00:02:01,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-25 00:02:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-25 00:02:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-25 00:02:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-25 00:02:01,840 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 113 [2018-10-25 00:02:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:01,840 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-25 00:02:01,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-25 00:02:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-25 00:02:01,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:01,846 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] [2018-10-25 00:02:01,846 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:01,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:01,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2079561357, now seen corresponding path program 1 times [2018-10-25 00:02:01,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:01,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:01,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:01,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:01,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:02,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:02,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:02,132 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-10-25 00:02:02,134 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:02,180 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:02,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:03,346 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:03,348 INFO L272 AbstractInterpreter]: Visited 106 different actions 204 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:03,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:03,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:03,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:03,404 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:02:03,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:03,418 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:03,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:03,819 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:03,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:04,159 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:04,196 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:04,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-10-25 00:02:04,196 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:04,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:04,199 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-10-25 00:02:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:05,956 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-10-25 00:02:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:05,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-10-25 00:02:05,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:05,972 INFO L225 Difference]: With dead ends: 1530 [2018-10-25 00:02:05,972 INFO L226 Difference]: Without dead ends: 997 [2018-10-25 00:02:05,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-10-25 00:02:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-10-25 00:02:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-10-25 00:02:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1433 transitions. [2018-10-25 00:02:06,034 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1433 transitions. Word has length 114 [2018-10-25 00:02:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:06,035 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 1433 transitions. [2018-10-25 00:02:06,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1433 transitions. [2018-10-25 00:02:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-25 00:02:06,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:06,046 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:06,047 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:06,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:06,047 INFO L82 PathProgramCache]: Analyzing trace with hash 896515303, now seen corresponding path program 1 times [2018-10-25 00:02:06,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:06,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:06,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:06,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:06,049 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:06,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:06,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:02:06,314 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:06,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:06,315 INFO L87 Difference]: Start difference. First operand 997 states and 1433 transitions. Second operand 3 states. [2018-10-25 00:02:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:08,186 INFO L93 Difference]: Finished difference Result 2438 states and 3658 transitions. [2018-10-25 00:02:08,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:08,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-10-25 00:02:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:08,203 INFO L225 Difference]: With dead ends: 2438 [2018-10-25 00:02:08,204 INFO L226 Difference]: Without dead ends: 1447 [2018-10-25 00:02:08,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2018-10-25 00:02:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2018-10-25 00:02:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-10-25 00:02:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2086 transitions. [2018-10-25 00:02:08,265 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2086 transitions. Word has length 120 [2018-10-25 00:02:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:08,265 INFO L481 AbstractCegarLoop]: Abstraction has 1447 states and 2086 transitions. [2018-10-25 00:02:08,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2086 transitions. [2018-10-25 00:02:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-25 00:02:08,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:08,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,271 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:08,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1267173673, now seen corresponding path program 1 times [2018-10-25 00:02:08,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:08,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:08,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:08,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:08,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:02:08,443 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:08,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:08,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:08,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:08,444 INFO L87 Difference]: Start difference. First operand 1447 states and 2086 transitions. Second operand 6 states. [2018-10-25 00:02:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:09,723 INFO L93 Difference]: Finished difference Result 3031 states and 4481 transitions. [2018-10-25 00:02:09,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:09,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-10-25 00:02:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:09,733 INFO L225 Difference]: With dead ends: 3031 [2018-10-25 00:02:09,733 INFO L226 Difference]: Without dead ends: 1590 [2018-10-25 00:02:09,740 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:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-10-25 00:02:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1540. [2018-10-25 00:02:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2018-10-25 00:02:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1980 transitions. [2018-10-25 00:02:09,789 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1980 transitions. Word has length 128 [2018-10-25 00:02:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:09,789 INFO L481 AbstractCegarLoop]: Abstraction has 1540 states and 1980 transitions. [2018-10-25 00:02:09,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1980 transitions. [2018-10-25 00:02:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-25 00:02:09,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:09,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,794 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:09,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1675141633, now seen corresponding path program 1 times [2018-10-25 00:02:09,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:09,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:09,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:09,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:02:09,936 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:09,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:09,937 INFO L87 Difference]: Start difference. First operand 1540 states and 1980 transitions. Second operand 3 states. [2018-10-25 00:02:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:11,014 INFO L93 Difference]: Finished difference Result 4456 states and 5895 transitions. [2018-10-25 00:02:11,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:11,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-10-25 00:02:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:11,031 INFO L225 Difference]: With dead ends: 4456 [2018-10-25 00:02:11,031 INFO L226 Difference]: Without dead ends: 2922 [2018-10-25 00:02:11,040 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:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2018-10-25 00:02:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2914. [2018-10-25 00:02:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2018-10-25 00:02:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3698 transitions. [2018-10-25 00:02:11,131 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3698 transitions. Word has length 129 [2018-10-25 00:02:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:11,132 INFO L481 AbstractCegarLoop]: Abstraction has 2914 states and 3698 transitions. [2018-10-25 00:02:11,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3698 transitions. [2018-10-25 00:02:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-25 00:02:11,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:11,144 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:11,144 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:11,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash 208675339, now seen corresponding path program 1 times [2018-10-25 00:02:11,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:11,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:11,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:11,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:11,498 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:11,499 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-10-25 00:02:11,499 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:11,508 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:11,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:12,057 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:12,057 INFO L272 AbstractInterpreter]: Visited 105 different actions 204 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:12,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:12,094 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:13,273 INFO L232 lantSequenceWeakener]: Weakened 92 states. On average, predicates are now at 80.67% of their original sizes. [2018-10-25 00:02:13,273 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:17,830 INFO L413 sIntCurrentIteration]: We have 165 unified AI predicates [2018-10-25 00:02:17,830 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:17,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:17,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-10-25 00:02:17,832 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:17,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:02:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:02:17,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:02:17,833 INFO L87 Difference]: Start difference. First operand 2914 states and 3698 transitions. Second operand 15 states. [2018-10-25 00:02:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:30,487 INFO L93 Difference]: Finished difference Result 6522 states and 8487 transitions. [2018-10-25 00:02:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:02:30,488 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 166 [2018-10-25 00:02:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:30,503 INFO L225 Difference]: With dead ends: 6522 [2018-10-25 00:02:30,504 INFO L226 Difference]: Without dead ends: 3614 [2018-10-25 00:02:30,514 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 34 SyntacticMatches, 118 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:02:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3614 states. [2018-10-25 00:02:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3614 to 3610. [2018-10-25 00:02:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2018-10-25 00:02:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4493 transitions. [2018-10-25 00:02:30,606 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4493 transitions. Word has length 166 [2018-10-25 00:02:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:30,607 INFO L481 AbstractCegarLoop]: Abstraction has 3610 states and 4493 transitions. [2018-10-25 00:02:30,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:02:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4493 transitions. [2018-10-25 00:02:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-25 00:02:30,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:30,621 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:02:30,621 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:30,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2117677329, now seen corresponding path program 1 times [2018-10-25 00:02:30,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:30,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:30,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 96 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:02:30,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:30,913 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:30,913 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-10-25 00:02:30,914 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:30,918 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:30,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:31,363 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:31,363 INFO L272 AbstractInterpreter]: Visited 107 different actions 328 times. Merged at 8 different actions 29 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:02:31,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:31,372 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:32,692 INFO L232 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 82.5% of their original sizes. [2018-10-25 00:02:32,692 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:37,764 INFO L413 sIntCurrentIteration]: We have 194 unified AI predicates [2018-10-25 00:02:37,764 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:37,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:37,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-10-25 00:02:37,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:37,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:02:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:02:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:02:37,767 INFO L87 Difference]: Start difference. First operand 3610 states and 4493 transitions. Second operand 12 states. [2018-10-25 00:02:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:51,535 INFO L93 Difference]: Finished difference Result 8470 states and 10895 transitions. [2018-10-25 00:02:51,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:02:51,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 195 [2018-10-25 00:02:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:51,556 INFO L225 Difference]: With dead ends: 8470 [2018-10-25 00:02:51,557 INFO L226 Difference]: Without dead ends: 5562 [2018-10-25 00:02:51,567 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 29 SyntacticMatches, 155 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:02:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2018-10-25 00:02:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5552. [2018-10-25 00:02:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2018-10-25 00:02:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 6969 transitions. [2018-10-25 00:02:51,720 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 6969 transitions. Word has length 195 [2018-10-25 00:02:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:51,721 INFO L481 AbstractCegarLoop]: Abstraction has 5552 states and 6969 transitions. [2018-10-25 00:02:51,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:02:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 6969 transitions. [2018-10-25 00:02:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-25 00:02:51,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:51,741 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:02:51,741 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:51,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1122503782, now seen corresponding path program 1 times [2018-10-25 00:02:51,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:51,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:51,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:51,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-25 00:02:52,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:52,124 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:52,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-10-25 00:02:52,126 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:52,132 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:52,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:52,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:52,526 INFO L272 AbstractInterpreter]: Visited 109 different actions 331 times. Merged at 8 different actions 27 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:02:52,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:52,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:52,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:52,534 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:02:52,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:52,543 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:52,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-25 00:02:52,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-25 00:02:53,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:53,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:02:53,127 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:53,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:02:53,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:02:53,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:02:53,128 INFO L87 Difference]: Start difference. First operand 5552 states and 6969 transitions. Second operand 9 states. [2018-10-25 00:02:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:56,297 INFO L93 Difference]: Finished difference Result 14059 states and 18456 transitions. [2018-10-25 00:02:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:02:56,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2018-10-25 00:02:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:56,355 INFO L225 Difference]: With dead ends: 14059 [2018-10-25 00:02:56,355 INFO L226 Difference]: Without dead ends: 8491 [2018-10-25 00:02:56,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:02:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2018-10-25 00:02:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 8284. [2018-10-25 00:02:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8284 states. [2018-10-25 00:02:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 10655 transitions. [2018-10-25 00:02:56,651 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 10655 transitions. Word has length 219 [2018-10-25 00:02:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:56,651 INFO L481 AbstractCegarLoop]: Abstraction has 8284 states and 10655 transitions. [2018-10-25 00:02:56,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:02:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 10655 transitions. [2018-10-25 00:02:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-25 00:02:56,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:56,696 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:02:56,697 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:56,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:56,697 INFO L82 PathProgramCache]: Analyzing trace with hash 889346168, now seen corresponding path program 1 times [2018-10-25 00:02:56,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:56,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:56,698 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 130 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-25 00:02:57,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:57,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:57,115 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-10-25 00:02:57,115 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:57,118 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:57,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:57,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:57,532 INFO L272 AbstractInterpreter]: Visited 109 different actions 331 times. Merged at 8 different actions 27 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:02:57,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:57,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:57,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:57,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:57,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:57,545 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:57,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-25 00:02:57,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-25 00:02:57,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:57,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 00:02:57,885 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:57,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:02:57,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:02:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:02:57,886 INFO L87 Difference]: Start difference. First operand 8284 states and 10655 transitions. Second operand 9 states. [2018-10-25 00:03:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:01,059 INFO L93 Difference]: Finished difference Result 22653 states and 30492 transitions. [2018-10-25 00:03:01,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-25 00:03:01,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2018-10-25 00:03:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:01,060 INFO L225 Difference]: With dead ends: 22653 [2018-10-25 00:03:01,060 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:03:01,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 460 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2018-10-25 00:03:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:03:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:03:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:03:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:03:01,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2018-10-25 00:03:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:01,144 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:03:01,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:03:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:03:01,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:03:01,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:03:01,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:01,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,827 WARN L179 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 398 DAG size of output: 254 [2018-10-25 00:03:02,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:02,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:03:03,694 WARN L179 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 394 DAG size of output: 253 [2018-10-25 00:03:04,352 WARN L179 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-25 00:03:04,821 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 86 [2018-10-25 00:03:08,897 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 381 DAG size of output: 134 [2018-10-25 00:03:10,215 WARN L179 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 281 DAG size of output: 98 [2018-10-25 00:03:11,897 WARN L179 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 281 DAG size of output: 98 [2018-10-25 00:03:11,900 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:11,900 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a21~0 |old(~a21~0)|)) [2018-10-25 00:03:11,901 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:11,901 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:03:11,901 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:03:11,901 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,901 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,901 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,901 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,901 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:03:11,902 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:03:11,903 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,904 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:03:11,905 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:03:11,906 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:03:11,907 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:03:11,907 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:03:11,907 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:03:11,907 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:03:11,907 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:03:11,907 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:03:11,907 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,907 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:03:11,908 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:03:11,909 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,910 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,911 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:03:11,912 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 15 |old(~a8~0)|))) (let ((.cse17 (= |old(~a8~0)| ~a8~0)) (.cse18 (= |old(~a16~0)| ~a16~0)) (.cse11 (not (= 0 |old(~a7~0)|))) (.cse3 (not (= 1 |old(~a21~0)|))) (.cse12 (not .cse6)) (.cse13 (= 0 |old(~a16~0)|)) (.cse14 (not (= 8 ~a12~0)))) (let ((.cse0 (and (= ~a7~0 0) (not (= ~a16~0 0)) (= ~a8~0 15))) (.cse1 (or .cse11 .cse3 .cse12 .cse13 .cse14)) (.cse7 (< 0 |old(~a17~0)|)) (.cse15 (= |calculate_output_#in~input| 0)) (.cse16 (= ~a20~0 1)) (.cse8 (and (<= ~a17~0 |old(~a17~0)|) .cse17 .cse18 (= ~a21~0 |old(~a21~0)|))) (.cse5 (not (= |old(~a16~0)| 5))) (.cse10 (< 13 |old(~a8~0)|)) (.cse9 (= 4 |old(~a16~0)|)) (.cse2 (= 1 |old(~a20~0)|)) (.cse4 (not (= 1 ~a20~0)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse2) (or .cse4 .cse5 .cse2 .cse6) (or .cse0 .cse1 .cse7) (or .cse3 .cse8 .cse9) (or .cse10 .cse7 .cse8) (or (or .cse11 .cse3 (not .cse2) .cse12 .cse13 .cse14 .cse15) .cse16 .cse7) (or .cse9 .cse0 .cse1) (or (= 6 |old(~a16~0)|) .cse10 .cse8) (or .cse8 .cse3 .cse7) (or .cse3 .cse8 .cse6) (or (or (not (= ~v~0 22)) (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)) (not (= |old(~a20~0)| 1)) .cse15 (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (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))) .cse5 (and (= ~a17~0 1) .cse16) (not (= |old(~a17~0)| 1))) (or .cse3 .cse2 .cse8) (or (and .cse17 .cse18) .cse5 .cse6) (or .cse10 (not .cse9) .cse2 .cse4))))) [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:03:11,913 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,914 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:03:11,915 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:11,916 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:03:11,917 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:11,917 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) (= ~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) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:03:11,917 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:03:11,918 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:11,918 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= |old(~a8~0)| ~a8~0) (= 1 ~a21~0) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:03:11,918 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:11,918 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (not (= ~a8~0 15))) (.cse0 (<= ~a8~0 13)) (.cse3 (<= ~a17~0 0)) (.cse2 (= 1 ~a21~0))) (or (and .cse0 (not (= ~a16~0 6))) (and (= |old(~a16~0)| ~a16~0) .cse1) (not (= 3 ~c~0)) (and .cse1 .cse2) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3) (not (= 4 ~d~0)) (and (not (= 1 ~a20~0)) .cse2) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse2 .cse3) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 (not (= ~a16~0 4))) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-10-25 00:03:11,918 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:03:11,918 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:03:11,918 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:03:11,918 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (not (= ~a8~0 15))) (.cse0 (<= ~a8~0 13)) (.cse3 (<= ~a17~0 0)) (.cse2 (= 1 ~a21~0))) (or (and .cse0 (not (= ~a16~0 6))) (and (= |old(~a16~0)| ~a16~0) .cse1) (not (= 3 ~c~0)) (and .cse1 .cse2) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3) (not (= 4 ~d~0)) (and (not (= 1 ~a20~0)) .cse2) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse2 .cse3) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 (not (= ~a16~0 4))) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-10-25 00:03:11,919 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:11,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:03:11 BoogieIcfgContainer [2018-10-25 00:03:11,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:03:11,934 INFO L168 Benchmark]: Toolchain (without parser) took 80023.93 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 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:11,936 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:03:11,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.61 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:11,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 222.56 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:11,938 INFO L168 Benchmark]: Boogie Preprocessor took 99.80 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:03:11,939 INFO L168 Benchmark]: RCFGBuilder took 3654.45 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.4 MB). Peak memory consumption was 106.4 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:11,939 INFO L168 Benchmark]: TraceAbstraction took 75309.55 ms. Allocated memory was 2.2 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 3.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:11,945 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.61 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 222.56 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.80 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3654.45 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.4 MB). Peak memory consumption was 106.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75309.55 ms. Allocated memory was 2.2 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 3.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((a8 <= 13 && !(a16 == 6)) || (\old(a16) == a16 && !(a8 == 15))) || !(3 == c)) || (!(a8 == 15) && 1 == a21)) || !(1 == \old(a21))) || (a8 <= 13 && a17 <= 0)) || !(4 == d)) || (!(1 == a20) && 1 == a21)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || (1 == a21 && a17 <= 0)) || !(a12 == 8)) || !(e == 5)) || (1 == a21 && !(a16 == 4))) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 75.2s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 42.8s AutomataDifference, 0.0s DeadEndRemovalTime, 10.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1867 SDtfs, 6895 SDslu, 1208 SDs, 0 SdLazy, 12083 SolverSat, 1810 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1584 GetRequests, 1201 SyntacticMatches, 282 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8284occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.1s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9977459660638579 AbsIntWeakeningRatio, 0.19498607242339833 AbsIntAvgWeakeningVarsNumRemoved, 0.49303621169916434 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 294 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 393 PreInvPairs, 789 NumberOfFragments, 846 HoareAnnotationTreeSize, 393 FomulaSimplifications, 35024 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 34183 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2608 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038605 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1582 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 1369/1522 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...