java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label12_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 15:48:10,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 15:48:10,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 15:48:11,013 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 15:48:11,013 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 15:48:11,014 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 15:48:11,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 15:48:11,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 15:48:11,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 15:48:11,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 15:48:11,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 15:48:11,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 15:48:11,024 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 15:48:11,027 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 15:48:11,028 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 15:48:11,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 15:48:11,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 15:48:11,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 15:48:11,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 15:48:11,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 15:48:11,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 15:48:11,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 15:48:11,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 15:48:11,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 15:48:11,046 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 15:48:11,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 15:48:11,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 15:48:11,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 15:48:11,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 15:48:11,055 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 15:48:11,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 15:48:11,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 15:48:11,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 15:48:11,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 15:48:11,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 15:48:11,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 15:48:11,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-15 15:48:11,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 15:48:11,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 15:48:11,086 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 15:48:11,086 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 15:48:11,087 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 15:48:11,087 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 15:48:11,087 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 15:48:11,087 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 15:48:11,087 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-15 15:48:11,088 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 15:48:11,088 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 15:48:11,088 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 15:48:11,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 15:48:11,089 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 15:48:11,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 15:48:11,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 15:48:11,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 15:48:11,089 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 15:48:11,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 15:48:11,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 15:48:11,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 15:48:11,090 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 15:48:11,090 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 15:48:11,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 15:48:11,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 15:48:11,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 15:48:11,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 15:48:11,091 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 15:48:11,092 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 15:48:11,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 15:48:11,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 15:48:11,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 15:48:11,092 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 15:48:11,093 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 15:48:11,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 15:48:11,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 15:48:11,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 15:48:11,163 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 15:48:11,163 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 15:48:11,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label12_true-unreach-call_false-termination.c [2018-09-15 15:48:11,536 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2d261ca/50a289bc05444d0f9a30f4eee3e7000a/FLAG3412392ab [2018-09-15 15:48:11,788 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 15:48:11,789 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label12_true-unreach-call_false-termination.c [2018-09-15 15:48:11,811 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2d261ca/50a289bc05444d0f9a30f4eee3e7000a/FLAG3412392ab [2018-09-15 15:48:11,833 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2d261ca/50a289bc05444d0f9a30f4eee3e7000a [2018-09-15 15:48:11,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 15:48:11,849 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 15:48:11,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 15:48:11,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 15:48:11,858 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 15:48:11,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 03:48:11" (1/1) ... [2018-09-15 15:48:11,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a806aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:11, skipping insertion in model container [2018-09-15 15:48:11,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 03:48:11" (1/1) ... [2018-09-15 15:48:11,875 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 15:48:12,385 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 15:48:12,407 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 15:48:12,534 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 15:48:12,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12 WrapperNode [2018-09-15 15:48:12,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 15:48:12,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 15:48:12,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 15:48:12,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 15:48:12,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... [2018-09-15 15:48:12,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... [2018-09-15 15:48:12,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 15:48:12,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 15:48:12,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 15:48:12,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 15:48:12,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... [2018-09-15 15:48:12,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... [2018-09-15 15:48:12,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... [2018-09-15 15:48:12,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... [2018-09-15 15:48:12,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... [2018-09-15 15:48:12,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... [2018-09-15 15:48:12,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... [2018-09-15 15:48:12,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 15:48:12,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 15:48:12,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 15:48:12,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 15:48:12,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-09-15 15:48:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 15:48:13,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 15:48:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 15:48:13,016 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 15:48:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 15:48:13,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 15:48:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 15:48:13,017 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 15:48:16,334 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 15:48:16,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 03:48:16 BoogieIcfgContainer [2018-09-15 15:48:16,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 15:48:16,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 15:48:16,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 15:48:16,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 15:48:16,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 03:48:11" (1/3) ... [2018-09-15 15:48:16,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5fd1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 03:48:16, skipping insertion in model container [2018-09-15 15:48:16,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 03:48:12" (2/3) ... [2018-09-15 15:48:16,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5fd1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 03:48:16, skipping insertion in model container [2018-09-15 15:48:16,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 03:48:16" (3/3) ... [2018-09-15 15:48:16,342 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label12_true-unreach-call_false-termination.c [2018-09-15 15:48:16,352 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 15:48:16,361 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 15:48:16,411 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 15:48:16,412 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 15:48:16,412 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 15:48:16,412 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 15:48:16,412 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 15:48:16,412 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 15:48:16,413 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 15:48:16,413 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 15:48:16,413 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 15:48:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-09-15 15:48:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-15 15:48:16,455 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:16,456 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:48:16,457 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash 52473581, now seen corresponding path program 1 times [2018-09-15 15:48:16,465 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:16,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-09-15 15:48:16,469 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [653], [655], [761], [765], [771], [775], [782], [783], [784], [786] [2018-09-15 15:48:16,509 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:16,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:16,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:48:16,764 INFO L272 AbstractInterpreter]: Visited 126 different actions 126 times. Never merged. Never widened. Never found a fixpoint. Largest state had 41 variables. [2018-09-15 15:48:16,813 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:48:17,066 INFO L232 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 80.64% of their original sizes. [2018-09-15 15:48:17,066 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:48:17,343 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:48:17,347 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:48:17,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 15:48:17,347 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:48:17,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 15:48:17,363 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 15:48:17,364 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-15 15:48:17,367 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 6 states. [2018-09-15 15:48:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:48:19,370 INFO L93 Difference]: Finished difference Result 552 states and 944 transitions. [2018-09-15 15:48:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 15:48:19,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-09-15 15:48:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:48:19,389 INFO L225 Difference]: With dead ends: 552 [2018-09-15 15:48:19,389 INFO L226 Difference]: Without dead ends: 342 [2018-09-15 15:48:19,395 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-15 15:48:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-09-15 15:48:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-09-15 15:48:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-15 15:48:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 473 transitions. [2018-09-15 15:48:19,477 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 473 transitions. Word has length 127 [2018-09-15 15:48:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:48:19,478 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 473 transitions. [2018-09-15 15:48:19,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 15:48:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 473 transitions. [2018-09-15 15:48:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-15 15:48:19,484 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:19,485 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:48:19,485 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1816413610, now seen corresponding path program 1 times [2018-09-15 15:48:19,486 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:19,486 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-09-15 15:48:19,487 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], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [653], [655], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-15 15:48:19,492 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:19,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:19,672 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:48:19,672 INFO L272 AbstractInterpreter]: Visited 130 different actions 254 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-09-15 15:48:19,718 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:48:19,921 INFO L232 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 80.66% of their original sizes. [2018-09-15 15:48:19,921 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:48:20,183 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:48:20,183 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:48:20,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:48:20,184 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:48:20,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:48:20,185 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:48:20,185 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:48:20,186 INFO L87 Difference]: Start difference. First operand 340 states and 473 transitions. Second operand 9 states. [2018-09-15 15:48:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:48:25,201 INFO L93 Difference]: Finished difference Result 679 states and 1068 transitions. [2018-09-15 15:48:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-15 15:48:25,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-09-15 15:48:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:48:25,210 INFO L225 Difference]: With dead ends: 679 [2018-09-15 15:48:25,210 INFO L226 Difference]: Without dead ends: 481 [2018-09-15 15:48:25,213 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-15 15:48:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-15 15:48:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 478. [2018-09-15 15:48:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-15 15:48:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 625 transitions. [2018-09-15 15:48:25,247 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 625 transitions. Word has length 136 [2018-09-15 15:48:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:48:25,247 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 625 transitions. [2018-09-15 15:48:25,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:48:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 625 transitions. [2018-09-15 15:48:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-15 15:48:25,252 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:25,252 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:48:25,253 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1236260954, now seen corresponding path program 1 times [2018-09-15 15:48:25,253 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:25,253 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-09-15 15:48:25,254 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [653], [655], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-15 15:48:25,258 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:25,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:25,331 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 15:48:25,331 INFO L272 AbstractInterpreter]: Visited 130 different actions 253 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-09-15 15:48:25,369 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 15:48:25,505 INFO L232 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 80.65% of their original sizes. [2018-09-15 15:48:25,505 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 15:48:26,171 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 15:48:26,175 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 15:48:26,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 15:48:26,175 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 15:48:26,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 15:48:26,176 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 15:48:26,176 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 15:48:26,179 INFO L87 Difference]: Start difference. First operand 478 states and 625 transitions. Second operand 9 states. [2018-09-15 15:48:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 15:48:28,969 INFO L93 Difference]: Finished difference Result 998 states and 1569 transitions. [2018-09-15 15:48:28,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 15:48:28,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2018-09-15 15:48:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 15:48:28,981 INFO L225 Difference]: With dead ends: 998 [2018-09-15 15:48:28,982 INFO L226 Difference]: Without dead ends: 800 [2018-09-15 15:48:28,984 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 15:48:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-09-15 15:48:29,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 793. [2018-09-15 15:48:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 15:48:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 959 transitions. [2018-09-15 15:48:29,037 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 959 transitions. Word has length 139 [2018-09-15 15:48:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 15:48:29,038 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 959 transitions. [2018-09-15 15:48:29,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 15:48:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 959 transitions. [2018-09-15 15:48:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-15 15:48:29,048 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 15:48:29,049 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 15:48:29,049 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 15:48:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash -587700515, now seen corresponding path program 1 times [2018-09-15 15:48:29,050 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 15:48:29,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-09-15 15:48:29,051 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [653], [655], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-09-15 15:48:29,057 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 15:48:29,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 15:48:29,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 15:48:29,240 INFO L272 AbstractInterpreter]: Visited 132 different actions 515 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 42 variables. [2018-09-15 15:48:29,279 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 15:48:29,310 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 15:48:29,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 03:48:29 BoogieIcfgContainer [2018-09-15 15:48:29,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 15:48:29,311 INFO L168 Benchmark]: Toolchain (without parser) took 17464.75 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 923.8 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -466.4 MB). Peak memory consumption was 457.4 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:29,313 INFO L168 Benchmark]: CDTParser took 0.19 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-09-15 15:48:29,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.76 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:29,315 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.43 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:29,316 INFO L168 Benchmark]: Boogie Preprocessor took 252.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -894.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:29,316 INFO L168 Benchmark]: RCFGBuilder took 3380.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 106.5 MB). Peak memory consumption was 106.5 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:29,317 INFO L168 Benchmark]: TraceAbstraction took 12974.85 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 130.0 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.4 MB). Peak memory consumption was 398.4 MB. Max. memory is 7.1 GB. [2018-09-15 15:48:29,322 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.19 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 729.76 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 121.43 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 252.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -894.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3380.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 106.5 MB). Peak memory consumption was 106.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12974.85 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 130.0 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.4 MB). Peak memory consumption was 398.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 536]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND TRUE ((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))) [L50] a8 = 13 [L51] a7 = 1 [L52] a16 = 4 [L53] RET return -1; [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L32] a16 = 5 [L33] a20 = 0 [L34] RET return 24; [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L424] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L427] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L430] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L433] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L436] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L439] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L442] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L445] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L448] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L451] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L454] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L457] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L460] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L463] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L466] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L469] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L472] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L475] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L478] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L481] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L484] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L487] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L490] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L493] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L496] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L499] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L502] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L505] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L508] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==6))&&(a21==1))) [L511] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L514] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L517] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L520] COND FALSE !((((((((a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L523] COND FALSE !((((((((a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L526] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L529] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==5))&&(a21==1))) [L532] COND FALSE !((((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==15))&&(a12==8))&&(a16==6))&&(a21==1))) [L535] COND TRUE (((((((a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) [L536] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. UNKNOWN Result, 12.9s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 604 SDtfs, 1583 SDslu, 747 SDs, 0 SdLazy, 3617 SolverSat, 537 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 413 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=793occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9984828208073261 AbsIntWeakeningRatio, 0.20300751879699247 AbsIntAvgWeakeningVarsNumRemoved, 12.546365914786968 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label12_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_15-48-29-337.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label12_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_15-48-29-337.csv Received shutdown request...