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_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label41_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 20:37:26,784 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 20:37:26,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 20:37:26,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 20:37:26,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 20:37:26,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 20:37:26,806 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 20:37:26,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 20:37:26,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 20:37:26,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 20:37:26,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 20:37:26,812 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 20:37:26,813 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 20:37:26,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 20:37:26,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 20:37:26,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 20:37:26,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 20:37:26,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 20:37:26,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 20:37:26,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 20:37:26,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 20:37:26,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 20:37:26,829 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 20:37:26,832 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 20:37:26,833 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 20:37:26,834 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 20:37:26,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 20:37:26,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 20:37:26,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 20:37:26,840 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 20:37:26,840 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 20:37:26,841 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 20:37:26,841 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 20:37:26,841 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 20:37:26,842 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 20:37:26,843 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 20:37:26,843 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-15 20:37:26,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 20:37:26,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 20:37:26,860 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 20:37:26,860 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 20:37:26,860 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 20:37:26,861 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 20:37:26,861 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-15 20:37:26,861 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 20:37:26,861 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-15 20:37:26,861 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 20:37:26,861 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 20:37:26,862 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 20:37:26,862 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 20:37:26,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 20:37:26,863 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 20:37:26,863 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 20:37:26,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 20:37:26,863 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 20:37:26,863 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 20:37:26,864 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 20:37:26,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 20:37:26,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 20:37:26,864 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 20:37:26,864 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 20:37:26,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 20:37:26,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 20:37:26,866 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 20:37:26,866 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 20:37:26,866 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 20:37:26,866 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 20:37:26,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 20:37:26,867 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 20:37:26,867 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 20:37:26,867 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 20:37:26,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 20:37:26,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 20:37:26,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 20:37:26,955 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 20:37:26,955 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 20:37:26,956 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label41_true-unreach-call.c [2018-09-15 20:37:27,331 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1b501ac/89248728c1c44453bfd08dcca2dc7643/FLAG6c4753f42 [2018-09-15 20:37:27,715 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 20:37:27,717 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label41_true-unreach-call.c [2018-09-15 20:37:27,739 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1b501ac/89248728c1c44453bfd08dcca2dc7643/FLAG6c4753f42 [2018-09-15 20:37:27,757 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1b501ac/89248728c1c44453bfd08dcca2dc7643 [2018-09-15 20:37:27,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 20:37:27,772 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 20:37:27,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 20:37:27,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 20:37:27,783 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 20:37:27,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:37:27" (1/1) ... [2018-09-15 20:37:27,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e64ebd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:27, skipping insertion in model container [2018-09-15 20:37:27,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:37:27" (1/1) ... [2018-09-15 20:37:27,800 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 20:37:28,772 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 20:37:28,793 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 20:37:29,411 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 20:37:29,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29 WrapperNode [2018-09-15 20:37:29,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 20:37:29,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 20:37:29,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 20:37:29,622 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 20:37:29,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (1/1) ... [2018-09-15 20:37:29,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (1/1) ... [2018-09-15 20:37:30,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 20:37:30,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 20:37:30,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 20:37:30,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 20:37:30,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (1/1) ... [2018-09-15 20:37:30,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (1/1) ... [2018-09-15 20:37:30,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (1/1) ... [2018-09-15 20:37:30,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (1/1) ... [2018-09-15 20:37:30,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (1/1) ... [2018-09-15 20:37:30,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (1/1) ... [2018-09-15 20:37:30,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (1/1) ... [2018-09-15 20:37:30,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 20:37:30,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 20:37:30,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 20:37:30,692 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 20:37:30,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (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 20:37:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 20:37:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 20:37:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-15 20:37:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-15 20:37:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 20:37:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 20:37:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 20:37:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 20:37:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 20:37:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 20:37:42,089 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 20:37:42,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:37:42 BoogieIcfgContainer [2018-09-15 20:37:42,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 20:37:42,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 20:37:42,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 20:37:42,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 20:37:42,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:37:27" (1/3) ... [2018-09-15 20:37:42,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dccf241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:37:42, skipping insertion in model container [2018-09-15 20:37:42,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:37:29" (2/3) ... [2018-09-15 20:37:42,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dccf241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:37:42, skipping insertion in model container [2018-09-15 20:37:42,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:37:42" (3/3) ... [2018-09-15 20:37:42,098 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label41_true-unreach-call.c [2018-09-15 20:37:42,106 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 20:37:42,114 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 20:37:42,168 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 20:37:42,168 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 20:37:42,168 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 20:37:42,168 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 20:37:42,169 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 20:37:42,169 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 20:37:42,169 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 20:37:42,169 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 20:37:42,169 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 20:37:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-09-15 20:37:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-15 20:37:42,209 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:37:42,211 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] [2018-09-15 20:37:42,212 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:37:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash -131983554, now seen corresponding path program 1 times [2018-09-15 20:37:42,219 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:37:42,220 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-09-15 20:37:42,222 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [938], [940], [2283], [2287], [2293], [2297], [2306], [2307], [2308], [2310] [2018-09-15 20:37:42,277 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:37:42,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:37:44,103 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:37:44,105 INFO L272 AbstractInterpreter]: Visited 40 different actions 40 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-15 20:37:44,137 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:37:44,851 INFO L232 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.36% of their original sizes. [2018-09-15 20:37:44,851 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:37:45,210 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:37:45,212 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:37:45,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 20:37:45,213 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:37:45,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 20:37:45,225 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 20:37:45,226 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 20:37:45,229 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 6 states. [2018-09-15 20:37:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:37:57,730 INFO L93 Difference]: Finished difference Result 1642 states and 3016 transitions. [2018-09-15 20:37:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 20:37:57,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-09-15 20:37:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:37:57,760 INFO L225 Difference]: With dead ends: 1642 [2018-09-15 20:37:57,761 INFO L226 Difference]: Without dead ends: 1036 [2018-09-15 20:37:57,772 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 20:37:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-09-15 20:37:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-09-15 20:37:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-09-15 20:37:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1511 transitions. [2018-09-15 20:37:57,903 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1511 transitions. Word has length 41 [2018-09-15 20:37:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:37:57,904 INFO L480 AbstractCegarLoop]: Abstraction has 1034 states and 1511 transitions. [2018-09-15 20:37:57,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 20:37:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1511 transitions. [2018-09-15 20:37:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-15 20:37:57,913 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:37:57,913 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:37:57,914 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:37:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash 360338025, now seen corresponding path program 1 times [2018-09-15 20:37:57,918 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:37:57,918 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2018-09-15 20:37:57,918 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [938], [940], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-15 20:37:57,928 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:37:57,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:38:02,222 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 20:38:11,853 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:38:11,854 INFO L272 AbstractInterpreter]: Visited 82 different actions 233 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-15 20:38:11,895 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:38:13,905 INFO L232 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 75.88% of their original sizes. [2018-09-15 20:38:13,905 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:38:15,173 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:38:15,174 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:38:15,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-15 20:38:15,175 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:38:15,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-15 20:38:15,176 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-15 20:38:15,177 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-15 20:38:15,177 INFO L87 Difference]: Start difference. First operand 1034 states and 1511 transitions. Second operand 13 states. [2018-09-15 20:38:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:38:53,043 INFO L93 Difference]: Finished difference Result 2814 states and 4895 transitions. [2018-09-15 20:38:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-15 20:38:53,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-09-15 20:38:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:38:53,056 INFO L225 Difference]: With dead ends: 2814 [2018-09-15 20:38:53,057 INFO L226 Difference]: Without dead ends: 2220 [2018-09-15 20:38:53,061 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2018-09-15 20:38:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2018-09-15 20:38:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1497. [2018-09-15 20:38:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2018-09-15 20:38:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2009 transitions. [2018-09-15 20:38:53,127 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2009 transitions. Word has length 116 [2018-09-15 20:38:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:38:53,128 INFO L480 AbstractCegarLoop]: Abstraction has 1497 states and 2009 transitions. [2018-09-15 20:38:53,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-15 20:38:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2009 transitions. [2018-09-15 20:38:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-15 20:38:53,132 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:38:53,132 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:38:53,133 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:38:53,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1732233903, now seen corresponding path program 1 times [2018-09-15 20:38:53,133 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:38:53,134 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-09-15 20:38:53,134 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [938], [940], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-15 20:38:53,139 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:38:53,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:38:57,730 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 20:39:14,007 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:39:14,007 INFO L272 AbstractInterpreter]: Visited 95 different actions 272 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-15 20:39:14,015 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:39:16,282 INFO L232 lantSequenceWeakener]: Weakened 127 states. On average, predicates are now at 75.79% of their original sizes. [2018-09-15 20:39:16,282 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:39:22,141 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:39:22,141 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:39:22,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-15 20:39:22,142 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:39:22,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-15 20:39:22,143 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-15 20:39:22,143 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-09-15 20:39:22,143 INFO L87 Difference]: Start difference. First operand 1497 states and 2009 transitions. Second operand 13 states. [2018-09-15 20:39:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:39:57,776 INFO L93 Difference]: Finished difference Result 2646 states and 4140 transitions. [2018-09-15 20:39:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-15 20:39:57,779 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2018-09-15 20:39:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:39:57,793 INFO L225 Difference]: With dead ends: 2646 [2018-09-15 20:39:57,794 INFO L226 Difference]: Without dead ends: 2052 [2018-09-15 20:39:57,797 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 140 GetRequests, 68 SyntacticMatches, 49 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-09-15 20:39:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2018-09-15 20:39:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1962. [2018-09-15 20:39:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2018-09-15 20:39:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2620 transitions. [2018-09-15 20:39:57,879 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2620 transitions. Word has length 129 [2018-09-15 20:39:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:39:57,880 INFO L480 AbstractCegarLoop]: Abstraction has 1962 states and 2620 transitions. [2018-09-15 20:39:57,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-15 20:39:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2620 transitions. [2018-09-15 20:39:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-15 20:39:57,891 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:39:57,892 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 20:39:57,892 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:39:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash 726473946, now seen corresponding path program 1 times [2018-09-15 20:39:57,893 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:39:57,893 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-09-15 20:39:57,894 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [938], [940], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-15 20:39:57,903 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:39:57,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:40:01,159 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 20:40:43,392 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:40:43,392 INFO L272 AbstractInterpreter]: Visited 96 different actions 650 times. Merged at 7 different actions 44 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-15 20:40:43,399 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:40:46,858 INFO L232 lantSequenceWeakener]: Weakened 202 states. On average, predicates are now at 75.54% of their original sizes. [2018-09-15 20:40:46,858 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:40:53,844 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:40:53,844 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:40:53,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 20:40:53,845 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:40:53,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 20:40:53,846 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 20:40:53,846 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-15 20:40:53,846 INFO L87 Difference]: Start difference. First operand 1962 states and 2620 transitions. Second operand 14 states. [2018-09-15 20:41:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:41:36,020 INFO L93 Difference]: Finished difference Result 3980 states and 6005 transitions. [2018-09-15 20:41:36,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-15 20:41:36,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 204 [2018-09-15 20:41:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:41:36,044 INFO L225 Difference]: With dead ends: 3980 [2018-09-15 20:41:36,045 INFO L226 Difference]: Without dead ends: 3386 [2018-09-15 20:41:36,049 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 215 GetRequests, 144 SyntacticMatches, 47 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-09-15 20:41:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-09-15 20:41:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2433. [2018-09-15 20:41:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2018-09-15 20:41:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3280 transitions. [2018-09-15 20:41:36,163 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3280 transitions. Word has length 204 [2018-09-15 20:41:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:41:36,164 INFO L480 AbstractCegarLoop]: Abstraction has 2433 states and 3280 transitions. [2018-09-15 20:41:36,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 20:41:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3280 transitions. [2018-09-15 20:41:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-15 20:41:36,167 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:41:36,168 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 20:41:36,168 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:41:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash 204309128, now seen corresponding path program 1 times [2018-09-15 20:41:36,169 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:41:36,169 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-09-15 20:41:36,169 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [938], [940], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-15 20:41:36,175 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:41:36,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:41:40,711 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-15 20:41:45,203 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 20:41:45,204 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 20:41:45,205 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 20:41:45,233 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 20:41:45,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:41:45 BoogieIcfgContainer [2018-09-15 20:41:45,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 20:41:45,234 INFO L168 Benchmark]: Toolchain (without parser) took 257464.30 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -486.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-15 20:41:45,236 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 20:41:45,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1846.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-09-15 20:41:45,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 744.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.2 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. [2018-09-15 20:41:45,238 INFO L168 Benchmark]: Boogie Preprocessor took 325.13 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-09-15 20:41:45,239 INFO L168 Benchmark]: RCFGBuilder took 11398.44 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 461.7 MB). Peak memory consumption was 461.7 MB. Max. memory is 7.1 GB. [2018-09-15 20:41:45,240 INFO L168 Benchmark]: TraceAbstraction took 243142.27 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: -104.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-15 20:41:45,245 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1846.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 744.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.2 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 325.13 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11398.44 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 461.7 MB). Peak memory consumption was 461.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243142.27 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: -104.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 110]: 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: [L8] int inputA = 1; [L9] int inputB = 2; [L10] int inputC = 3; [L11] int inputE = 5; [L12] int inputD = 4; [L13] int inputF = 6; [L16] int a24 = 1; [L17] int a21 = 124; [L18] int a26 = 222; [L19] int a14 = -79; [L20] int a28 = 111; [L2577] int output = -1; [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL, EXPR calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L130] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L133] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L136] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L139] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L142] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L145] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L148] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L151] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L154] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L157] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L160] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L163] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L166] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L169] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L172] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L175] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L178] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L181] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L184] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L187] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L190] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L193] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L196] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L199] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L202] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L205] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L209] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) [L215] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) [L222] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) [L228] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) [L231] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) [L238] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) [L243] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) [L249] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) [L256] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) [L262] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) [L266] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) [L273] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) [L287] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) [L294] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) [L301] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) [L306] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) [L313] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) [L319] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) [L323] COND TRUE ( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 )) [L324] a14 = ((((a14 % 299909)- 300090) + 0) + -1) [L325] a26 = ((((a26 * 9)/ 10) - 554854) * 1) [L326] a28 = ((((a28 * 9)/ 10) * 1) - 589002) [L327] a24 = 2 [L329] RET return 25; [L2588] EXPR calculate_output(input) [L2588] output = calculate_output(input) [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL, EXPR calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L130] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L133] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L136] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L139] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L142] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L145] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L148] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L151] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L154] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L157] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L160] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L163] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L166] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L169] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L172] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L175] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L178] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L181] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L184] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L187] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L190] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L193] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L196] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L199] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L202] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L205] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L209] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) [L215] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) [L222] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) [L228] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) [L231] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) [L238] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) [L243] COND TRUE ( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2))) [L244] a14 = (((((((a14 * 9)/ 10) % 33)- 138) * 5) % 33)+ -139) [L245] a28 = ((((((a28 * 9)/ 10) * 1) - -10862) % 82)- -216) [L246] a24 = 1 [L248] RET return -1; [L2588] EXPR calculate_output(input) [L2588] output = calculate_output(input) [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND TRUE (((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 ) [L110] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. UNKNOWN Result, 243.0s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 128.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2267 SDtfs, 14773 SDslu, 1432 SDs, 0 SdLazy, 17463 SolverSat, 2588 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 118.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 524 GetRequests, 352 SyntacticMatches, 96 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2433occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 91.3s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9926556399704541 AbsIntWeakeningRatio, 0.1728395061728395 AbsIntAvgWeakeningVarsNumRemoved, 61.54320987654321 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 1768 StatesRemovedByMinimization, 4 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/Problem17_label41_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_20-41-45-260.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label41_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_20-41-45-260.csv Completed graceful shutdown