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_label41_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:03:10,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:03:10,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:03:10,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:03:10,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:03:10,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:03:10,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:03:10,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:03:10,980 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:03:10,981 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:03:10,984 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:03:10,984 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:03:10,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:03:10,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:03:10,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:03:10,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:03:11,000 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:03:11,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:03:11,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:03:11,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:03:11,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:03:11,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:03:11,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:03:11,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:03:11,010 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:03:11,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:03:11,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:03:11,013 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:03:11,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:03:11,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:03:11,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:03:11,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:03:11,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:03:11,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:03:11,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:03:11,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:03:11,018 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:03:11,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:03:11,033 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:03:11,034 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:03:11,034 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:03:11,034 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:03:11,035 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:03:11,035 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:03:11,035 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:03:11,035 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:03:11,035 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:03:11,036 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:03:11,036 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:03:11,036 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:03:11,036 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:03:11,039 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:03:11,039 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:03:11,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:03:11,039 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:03:11,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:03:11,040 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:03:11,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:03:11,041 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:03:11,041 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:03:11,041 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:03:11,041 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:03:11,042 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:03:11,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:03:11,042 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:03:11,042 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:03:11,044 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:03:11,044 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:03:11,044 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:03:11,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:03:11,044 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:03:11,045 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:03:11,045 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:03:11,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:03:11,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:03:11,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:03:11,145 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:03:11,146 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:03:11,146 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.c [2018-10-25 00:03:11,220 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d676b2235/d64c20760ee84c3f9a250284bba2c005/FLAG19daf4054 [2018-10-25 00:03:11,817 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:03:11,818 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.c [2018-10-25 00:03:11,842 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d676b2235/d64c20760ee84c3f9a250284bba2c005/FLAG19daf4054 [2018-10-25 00:03:11,863 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d676b2235/d64c20760ee84c3f9a250284bba2c005 [2018-10-25 00:03:11,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:03:11,878 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:03:11,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:03:11,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:03:11,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:03:11,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:03:11" (1/1) ... [2018-10-25 00:03:11,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379aca2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:11, skipping insertion in model container [2018-10-25 00:03:11,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:03:11" (1/1) ... [2018-10-25 00:03:11,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:03:11,960 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:03:12,430 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:03:12,440 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:03:12,572 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:03:12,593 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:03:12,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12 WrapperNode [2018-10-25 00:03:12,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:03:12,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:03:12,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:03:12,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:03:12,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... [2018-10-25 00:03:12,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... [2018-10-25 00:03:12,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:03:12,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:03:12,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:03:12,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:03:12,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... [2018-10-25 00:03:12,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... [2018-10-25 00:03:12,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... [2018-10-25 00:03:12,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... [2018-10-25 00:03:12,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... [2018-10-25 00:03:12,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... [2018-10-25 00:03:12,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... [2018-10-25 00:03:12,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:03:12,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:03:12,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:03:12,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:03:12,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:03:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:03:12,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:03:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:03:12,933 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:03:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:03:12,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:03:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:03:12,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:03:16,245 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:03:16,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:03:16 BoogieIcfgContainer [2018-10-25 00:03:16,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:03:16,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:03:16,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:03:16,253 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:03:16,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:03:11" (1/3) ... [2018-10-25 00:03:16,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee7efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:03:16, skipping insertion in model container [2018-10-25 00:03:16,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:12" (2/3) ... [2018-10-25 00:03:16,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee7efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:03:16, skipping insertion in model container [2018-10-25 00:03:16,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:03:16" (3/3) ... [2018-10-25 00:03:16,259 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label41_true-unreach-call_false-termination.c [2018-10-25 00:03:16,270 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:03:16,285 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:03:16,306 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:03:16,347 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:03:16,348 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:03:16,348 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:03:16,348 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:03:16,348 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:03:16,349 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:03:16,349 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:03:16,350 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:03:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:03:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-25 00:03:16,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:16,392 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] [2018-10-25 00:03:16,396 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:16,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1784134456, now seen corresponding path program 1 times [2018-10-25 00:03:16,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:16,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:16,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:16,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:16,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:17,017 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:03:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:17,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:17,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:03:17,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:17,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:03:17,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:03:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:17,187 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:03:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:18,529 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:03:18,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:03:18,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-10-25 00:03:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:18,552 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:03:18,552 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:03:18,559 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:03:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:03:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:03:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:03:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-25 00:03:18,636 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 92 [2018-10-25 00:03:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:18,637 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-25 00:03:18,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:03:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-25 00:03:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-25 00:03:18,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:18,644 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] [2018-10-25 00:03:18,645 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:18,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1017763991, now seen corresponding path program 1 times [2018-10-25 00:03:18,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:18,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:18,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:18,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:18,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:03:18,867 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:18,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:03:18,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:03:18,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:03:18,870 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-25 00:03:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:20,979 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-25 00:03:20,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:03:20,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-10-25 00:03:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:20,987 INFO L225 Difference]: With dead ends: 888 [2018-10-25 00:03:20,988 INFO L226 Difference]: Without dead ends: 554 [2018-10-25 00:03:20,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:03:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-25 00:03:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-25 00:03:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-25 00:03:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-25 00:03:21,036 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 103 [2018-10-25 00:03:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:21,036 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-25 00:03:21,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:03:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-25 00:03:21,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-25 00:03:21,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:21,042 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] [2018-10-25 00:03:21,042 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:21,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:21,042 INFO L82 PathProgramCache]: Analyzing trace with hash 869358827, now seen corresponding path program 1 times [2018-10-25 00:03:21,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:21,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:21,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:21,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:21,044 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:21,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:21,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:03:21,230 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:21,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:03:21,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:03:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:21,231 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-10-25 00:03:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:22,488 INFO L93 Difference]: Finished difference Result 1530 states and 2432 transitions. [2018-10-25 00:03:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:03:22,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-10-25 00:03:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:22,498 INFO L225 Difference]: With dead ends: 1530 [2018-10-25 00:03:22,498 INFO L226 Difference]: Without dead ends: 997 [2018-10-25 00:03:22,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-10-25 00:03:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-10-25 00:03:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-10-25 00:03:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1488 transitions. [2018-10-25 00:03:22,547 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1488 transitions. Word has length 104 [2018-10-25 00:03:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:22,548 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 1488 transitions. [2018-10-25 00:03:22,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:03:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1488 transitions. [2018-10-25 00:03:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-25 00:03:22,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:22,559 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] [2018-10-25 00:03:22,560 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:22,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash -58190001, now seen corresponding path program 1 times [2018-10-25 00:03:22,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:22,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:22,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:22,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:22,564 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:22,866 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:03:23,228 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:03:23,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:23,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:03:23,228 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:23,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:03:23,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:03:23,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:03:23,230 INFO L87 Difference]: Start difference. First operand 997 states and 1488 transitions. Second operand 6 states. [2018-10-25 00:03:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:26,180 INFO L93 Difference]: Finished difference Result 2927 states and 4616 transitions. [2018-10-25 00:03:26,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:03:26,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2018-10-25 00:03:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:26,198 INFO L225 Difference]: With dead ends: 2927 [2018-10-25 00:03:26,198 INFO L226 Difference]: Without dead ends: 1936 [2018-10-25 00:03:26,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:03:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-10-25 00:03:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1881. [2018-10-25 00:03:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2018-10-25 00:03:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2656 transitions. [2018-10-25 00:03:26,293 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2656 transitions. Word has length 118 [2018-10-25 00:03:26,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:26,294 INFO L481 AbstractCegarLoop]: Abstraction has 1881 states and 2656 transitions. [2018-10-25 00:03:26,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:03:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2656 transitions. [2018-10-25 00:03:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 00:03:26,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:26,302 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:26,302 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:26,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:26,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2017463946, now seen corresponding path program 1 times [2018-10-25 00:03:26,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:26,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:26,304 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:26,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:26,498 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:26,499 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-10-25 00:03:26,501 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], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:26,562 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:26,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:27,507 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:27,509 INFO L272 AbstractInterpreter]: Visited 96 different actions 185 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:03:27,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:27,551 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:28,562 INFO L232 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 80.35% of their original sizes. [2018-10-25 00:03:28,564 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:31,846 INFO L413 sIntCurrentIteration]: We have 135 unified AI predicates [2018-10-25 00:03:31,847 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:31,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:31,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:03:31,848 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:31,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:03:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:03:31,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:03:31,849 INFO L87 Difference]: Start difference. First operand 1881 states and 2656 transitions. Second operand 15 states. [2018-10-25 00:03:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:53,281 INFO L93 Difference]: Finished difference Result 5490 states and 7675 transitions. [2018-10-25 00:03:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:03:53,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 136 [2018-10-25 00:03:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:53,301 INFO L225 Difference]: With dead ends: 5490 [2018-10-25 00:03:53,302 INFO L226 Difference]: Without dead ends: 3615 [2018-10-25 00:03:53,311 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 31 SyntacticMatches, 91 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:03:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2018-10-25 00:03:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3551. [2018-10-25 00:03:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3551 states. [2018-10-25 00:03:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3551 states to 3551 states and 4529 transitions. [2018-10-25 00:03:53,416 INFO L78 Accepts]: Start accepts. Automaton has 3551 states and 4529 transitions. Word has length 136 [2018-10-25 00:03:53,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:53,416 INFO L481 AbstractCegarLoop]: Abstraction has 3551 states and 4529 transitions. [2018-10-25 00:03:53,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:03:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3551 states and 4529 transitions. [2018-10-25 00:03:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-25 00:03:53,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:53,426 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:53,426 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:53,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:53,427 INFO L82 PathProgramCache]: Analyzing trace with hash -970438447, now seen corresponding path program 1 times [2018-10-25 00:03:53,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:53,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:53,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:53,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:53,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:03:53,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:53,677 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:53,678 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-10-25 00:03:53,678 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:53,684 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:53,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:53,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:53,930 INFO L272 AbstractInterpreter]: Visited 97 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:03:53,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:53,958 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:54,433 INFO L232 lantSequenceWeakener]: Weakened 146 states. On average, predicates are now at 80.17% of their original sizes. [2018-10-25 00:03:54,433 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:54,535 INFO L413 sIntCurrentIteration]: We have 148 unified AI predicates [2018-10-25 00:03:54,535 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:54,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:54,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:03:54,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:54,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:03:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:03:54,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:03:54,538 INFO L87 Difference]: Start difference. First operand 3551 states and 4529 transitions. Second operand 10 states. [2018-10-25 00:04:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:00,327 INFO L93 Difference]: Finished difference Result 6777 states and 8747 transitions. [2018-10-25 00:04:00,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:04:00,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2018-10-25 00:04:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:00,344 INFO L225 Difference]: With dead ends: 6777 [2018-10-25 00:04:00,345 INFO L226 Difference]: Without dead ends: 3692 [2018-10-25 00:04:00,356 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:04:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2018-10-25 00:04:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3689. [2018-10-25 00:04:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3689 states. [2018-10-25 00:04:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 4683 transitions. [2018-10-25 00:04:00,446 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 4683 transitions. Word has length 149 [2018-10-25 00:04:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:00,446 INFO L481 AbstractCegarLoop]: Abstraction has 3689 states and 4683 transitions. [2018-10-25 00:04:00,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:04:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 4683 transitions. [2018-10-25 00:04:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-25 00:04:00,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:00,455 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:00,456 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:00,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1340018050, now seen corresponding path program 1 times [2018-10-25 00:04:00,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:00,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:00,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:00,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:00,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-25 00:04:00,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:00,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:00,731 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-10-25 00:04:00,732 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:00,737 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:00,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:01,261 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:04:01,261 INFO L272 AbstractInterpreter]: Visited 99 different actions 298 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:04:01,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:01,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:04:01,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:01,267 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:04:01,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:01,276 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:04:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:01,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-25 00:04:01,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:01,991 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:04:02,093 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:04:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-25 00:04:02,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:04:02,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-25 00:04:02,743 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:04:02,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:04:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:04:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:04:02,744 INFO L87 Difference]: Start difference. First operand 3689 states and 4683 transitions. Second operand 8 states. [2018-10-25 00:04:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:09,278 INFO L93 Difference]: Finished difference Result 14022 states and 19393 transitions. [2018-10-25 00:04:09,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-25 00:04:09,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 161 [2018-10-25 00:04:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:09,319 INFO L225 Difference]: With dead ends: 14022 [2018-10-25 00:04:09,319 INFO L226 Difference]: Without dead ends: 6871 [2018-10-25 00:04:09,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-10-25 00:04:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6871 states. [2018-10-25 00:04:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6871 to 6724. [2018-10-25 00:04:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6724 states. [2018-10-25 00:04:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6724 states to 6724 states and 8038 transitions. [2018-10-25 00:04:09,557 INFO L78 Accepts]: Start accepts. Automaton has 6724 states and 8038 transitions. Word has length 161 [2018-10-25 00:04:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:09,557 INFO L481 AbstractCegarLoop]: Abstraction has 6724 states and 8038 transitions. [2018-10-25 00:04:09,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:04:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6724 states and 8038 transitions. [2018-10-25 00:04:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-25 00:04:09,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:09,576 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:09,577 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:09,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:09,577 INFO L82 PathProgramCache]: Analyzing trace with hash -684471189, now seen corresponding path program 1 times [2018-10-25 00:04:09,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:09,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:09,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 107 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:04:10,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:10,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:10,449 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-10-25 00:04:10,450 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [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], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [205], [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], [373], [375], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:10,455 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:10,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:11,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:04:11,496 INFO L272 AbstractInterpreter]: Visited 98 different actions 394 times. Merged at 8 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:04:11,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:11,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:04:11,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:11,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:04:11,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:11,548 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:04:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:11,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-25 00:04:12,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 113 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-25 00:04:13,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:04:13,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-25 00:04:13,246 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:04:13,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:04:13,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:04:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:04:13,247 INFO L87 Difference]: Start difference. First operand 6724 states and 8038 transitions. Second operand 12 states. [2018-10-25 00:04:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:20,735 INFO L93 Difference]: Finished difference Result 24052 states and 31713 transitions. [2018-10-25 00:04:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-25 00:04:20,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 202 [2018-10-25 00:04:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:20,738 INFO L225 Difference]: With dead ends: 24052 [2018-10-25 00:04:20,738 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:04:20,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 435 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-10-25 00:04:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:04:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:04:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:04:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:04:20,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2018-10-25 00:04:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:20,823 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:04:20,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:04:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:04:20,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:04:20,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:04:21,366 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-10-25 00:04:21,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:21,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:21,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:21,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:21,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:21,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:21,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:21,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:21,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:21,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:22,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,221 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 465 DAG size of output: 340 [2018-10-25 00:04:23,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:23,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:24,319 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 441 DAG size of output: 315 [2018-10-25 00:04:25,382 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-25 00:04:27,765 WARN L179 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 144 DAG size of output: 86 [2018-10-25 00:04:31,191 WARN L179 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 460 DAG size of output: 77 [2018-10-25 00:04:33,761 WARN L179 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 361 DAG size of output: 102 [2018-10-25 00:04:35,312 WARN L179 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 340 DAG size of output: 105 [2018-10-25 00:04:35,316 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:35,317 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a16~0)| ~a16~0)) [2018-10-25 00:04:35,317 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:35,317 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:04:35,317 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:04:35,317 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,317 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,317 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,317 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:04:35,318 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:04:35,319 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,320 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,321 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:04:35,322 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:04:35,323 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:04:35,323 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:04:35,323 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:04:35,323 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:04:35,323 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:04:35,323 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,323 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,323 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,323 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,324 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,324 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:04:35,324 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:04:35,324 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:04:35,324 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:04:35,324 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:04:35,324 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:04:35,324 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:04:35,324 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:04:35,325 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:04:35,325 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,325 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,325 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,325 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,325 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,325 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,325 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:04:35,326 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,326 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:04:35,326 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:04:35,326 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:04:35,326 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:04:35,326 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:04:35,326 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:04:35,326 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:04:35,326 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:04:35,327 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:04:35,327 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:04:35,327 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:04:35,327 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 431) no Hoare annotation was computed. [2018-10-25 00:04:35,327 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:04:35,327 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:04:35,327 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,328 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,328 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,328 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,328 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,328 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:04:35,328 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:04:35,328 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:04:35,328 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:04:35,329 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:04:35,329 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:04:35,329 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:04:35,329 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:04:35,329 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,329 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,329 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,329 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,329 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:04:35,330 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:04:35,331 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse3 (= 1 |old(~a17~0)|))) (let ((.cse10 (= ~a7~0 |old(~a7~0)|)) (.cse5 (not (= 1 |old(~a21~0)|))) (.cse13 (not (= 1 |old(~a20~0)|))) (.cse6 (not (= 8 ~a12~0))) (.cse7 (= |calculate_output_#in~input| 0)) (.cse8 (not .cse3)) (.cse11 (= |old(~a8~0)| ~a8~0)) (.cse16 (= |old(~a20~0)| ~a20~0)) (.cse17 (= ~a17~0 |old(~a17~0)|)) (.cse12 (= |old(~a16~0)| ~a16~0))) (let ((.cse1 (and (= 1 ~a7~0) .cse11 .cse16 .cse17 .cse12)) (.cse2 (not (= 1 |old(~a7~0)|))) (.cse0 (= 6 |old(~a16~0)|)) (.cse9 (= ~a21~0 1)) (.cse15 (or .cse5 .cse13 (= 0 |old(~a16~0)|) .cse6 .cse7 (= 0 |old(~a8~0)|) .cse8)) (.cse14 (and .cse10 .cse11 .cse12)) (.cse4 (and .cse10 .cse11 .cse16 .cse17 .cse12))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse4) (or (or (not (= 0 |old(~a7~0)|)) .cse5 (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) .cse6 .cse7 .cse8) (not (= 0 |old(~a20~0)|)) .cse9) (or .cse1 (not (= |old(~a20~0)| 1)) .cse2 (< 0 |old(~a17~0)|)) (or .cse0 (and .cse10 .cse11 (= 1 ~a20~0) .cse12) .cse13) (or .cse0 (= 4 |old(~a16~0)|) .cse14) (or (and (= ~a17~0 1) .cse9 (= ~a20~0 1)) .cse15) (or .cse15 .cse14) (or .cse4 (= 13 |old(~a8~0)|)))))) [2018-10-25 00:04:35,331 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:04:35,331 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,331 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,331 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,331 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:04:35,332 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:04:35,333 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:04:35,333 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:04:35,333 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:04:35,333 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:04:35,333 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:04:35,333 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,333 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,333 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,333 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:04:35,334 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,335 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:04:35,336 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:04:35,337 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:04:35,337 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:04:35,337 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:04:35,337 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:35,337 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:04:35,337 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:04:35,337 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:35,338 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= ~a16~0 5) (= ~a8~0 15) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:04:35,338 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:35,338 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a7~0 |old(~a7~0)|)) (.cse2 (= 1 ~a20~0)) (.cse0 (= ~a17~0 1)) (.cse4 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6)))) (or (and (not (= ~a16~0 0)) (not (= main_~input~0 0)) .cse0 (= ~a21~0 1) (= ~a20~0 1)) (not (= 1 |old(~a21~0)|)) (and .cse1 .cse2 .cse3) (not (= 4 ~d~0)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= 22 ~v~0)) (and .cse1 .cse3 (not (= ~a16~0 4))) (not (= ~c~0 3)) (not (= 1 ~a~0)) (not (= 5 |old(~a16~0)|)) (not (= ~u~0 21)) (and .cse4 .cse2 (<= ~a17~0 0)) (not (= |old(~a7~0)| 0)) (not (= ~a8~0 13)) (not (= 26 ~z~0)) (and .cse3 (not .cse0)) (and .cse4 .cse3) (not (= 8 ~a12~0)) (not (= 2 ~b~0)) (not (= 25 ~y~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-10-25 00:04:35,338 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:04:35,338 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:04:35,338 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:04:35,339 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a7~0 |old(~a7~0)|)) (.cse1 (= 1 ~a20~0)) (.cse3 (= 1 ~a7~0)) (.cse2 (not (= ~a16~0 6))) (.cse4 (= ~a17~0 1))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2) (not (= 4 ~d~0)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= 22 ~v~0)) (and .cse0 .cse2 (not (= ~a16~0 4))) (not (= ~c~0 3)) (not (= 1 ~a~0)) (not (= 5 |old(~a16~0)|)) (not (= ~u~0 21)) (and .cse3 .cse1 (<= ~a17~0 0)) (not (= |old(~a7~0)| 0)) (not (= ~a8~0 13)) (not (= 26 ~z~0)) (and .cse2 (not .cse4)) (and .cse3 .cse2) (and (not (= ~a16~0 0)) .cse4 (= ~a21~0 1) (= ~a20~0 1)) (not (= 8 ~a12~0)) (not (= 2 ~b~0)) (not (= 25 ~y~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-10-25 00:04:35,339 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:35,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:04:35 BoogieIcfgContainer [2018-10-25 00:04:35,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:04:35,355 INFO L168 Benchmark]: Toolchain (without parser) took 83478.24 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:35,356 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:04:35,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:35,357 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:35,358 INFO L168 Benchmark]: Boogie Preprocessor took 79.24 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:04:35,358 INFO L168 Benchmark]: RCFGBuilder took 3385.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:35,359 INFO L168 Benchmark]: TraceAbstraction took 79104.31 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:35,364 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 714.92 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 183.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.24 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3385.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79104.31 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 431]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(1 == \old(a21)) || ((a7 == \old(a7) && 1 == a20) && !(a16 == 6))) || !(4 == d)) || !(x == 24)) || !(e == 5)) || !(22 == v)) || ((a7 == \old(a7) && !(a16 == 6)) && !(a16 == 4))) || !(c == 3)) || !(1 == a)) || !(5 == \old(a16))) || !(u == 21)) || ((1 == a7 && 1 == a20) && a17 <= 0)) || !(\old(a7) == 0)) || !(a8 == 13)) || !(26 == z)) || (!(a16 == 6) && !(a17 == 1))) || (1 == a7 && !(a16 == 6))) || (((!(a16 == 0) && a17 == 1) && a21 == 1) && a20 == 1)) || !(8 == a12)) || !(2 == b)) || !(25 == y)) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 79.0s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 49.2s AutomataDifference, 0.0s DeadEndRemovalTime, 14.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1030 SDtfs, 8488 SDslu, 1531 SDs, 0 SdLazy, 13933 SolverSat, 2519 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1177 GetRequests, 952 SyntacticMatches, 96 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6724occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.9s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9966236453111442 AbsIntWeakeningRatio, 0.26855123674911663 AbsIntAvgWeakeningVarsNumRemoved, 1.176678445229682 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 284 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 363 PreInvPairs, 869 NumberOfFragments, 710 HoareAnnotationTreeSize, 363 FomulaSimplifications, 24391 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 26073 FormulaSimplificationTreeSizeReductionInter, 10.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1428 NumberOfCodeBlocks, 1428 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 476810 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1085 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 921/1027 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...