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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label38_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 12:08:29,984 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 12:08:29,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 12:08:30,005 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 12:08:30,006 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 12:08:30,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 12:08:30,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 12:08:30,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 12:08:30,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 12:08:30,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 12:08:30,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 12:08:30,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 12:08:30,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 12:08:30,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 12:08:30,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 12:08:30,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 12:08:30,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 12:08:30,026 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 12:08:30,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 12:08:30,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 12:08:30,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 12:08:30,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 12:08:30,044 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 12:08:30,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 12:08:30,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 12:08:30,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 12:08:30,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 12:08:30,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 12:08:30,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 12:08:30,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 12:08:30,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 12:08:30,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 12:08:30,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 12:08:30,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 12:08:30,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 12:08:30,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 12:08:30,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-15 12:08:30,091 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 12:08:30,091 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 12:08:30,093 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 12:08:30,093 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 12:08:30,093 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 12:08:30,094 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 12:08:30,094 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 12:08:30,094 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 12:08:30,094 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 12:08:30,095 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 12:08:30,095 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 12:08:30,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 12:08:30,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 12:08:30,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 12:08:30,097 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 12:08:30,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 12:08:30,097 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 12:08:30,097 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 12:08:30,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 12:08:30,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 12:08:30,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 12:08:30,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 12:08:30,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 12:08:30,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 12:08:30,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 12:08:30,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 12:08:30,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 12:08:30,101 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 12:08:30,101 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 12:08:30,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 12:08:30,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 12:08:30,102 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 12:08:30,102 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 12:08:30,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 12:08:30,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 12:08:30,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 12:08:30,208 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 12:08:30,208 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 12:08:30,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label38_true-unreach-call_false-termination.c [2018-09-15 12:08:30,611 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adae83f28/fd075940dcfc41d2b0fb5aa04e0a5066/FLAG125e9afbb [2018-09-15 12:08:30,924 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 12:08:30,925 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label38_true-unreach-call_false-termination.c [2018-09-15 12:08:30,939 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adae83f28/fd075940dcfc41d2b0fb5aa04e0a5066/FLAG125e9afbb [2018-09-15 12:08:30,956 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adae83f28/fd075940dcfc41d2b0fb5aa04e0a5066 [2018-09-15 12:08:30,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 12:08:30,972 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 12:08:30,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 12:08:30,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 12:08:30,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 12:08:30,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:08:30" (1/1) ... [2018-09-15 12:08:30,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f1297b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:30, skipping insertion in model container [2018-09-15 12:08:30,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:08:30" (1/1) ... [2018-09-15 12:08:30,997 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 12:08:31,567 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 12:08:31,593 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 12:08:31,774 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 12:08:31,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31 WrapperNode [2018-09-15 12:08:31,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 12:08:31,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 12:08:31,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 12:08:31,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 12:08:31,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (1/1) ... [2018-09-15 12:08:31,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (1/1) ... [2018-09-15 12:08:31,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 12:08:31,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 12:08:31,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 12:08:31,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 12:08:32,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (1/1) ... [2018-09-15 12:08:32,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (1/1) ... [2018-09-15 12:08:32,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (1/1) ... [2018-09-15 12:08:32,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (1/1) ... [2018-09-15 12:08:32,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (1/1) ... [2018-09-15 12:08:32,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (1/1) ... [2018-09-15 12:08:32,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (1/1) ... [2018-09-15 12:08:32,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 12:08:32,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 12:08:32,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 12:08:32,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 12:08:32,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (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 12:08:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 12:08:32,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 12:08:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 12:08:32,368 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 12:08:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 12:08:32,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 12:08:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 12:08:32,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 12:08:36,268 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 12:08:36,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:08:36 BoogieIcfgContainer [2018-09-15 12:08:36,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 12:08:36,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 12:08:36,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 12:08:36,276 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 12:08:36,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 12:08:30" (1/3) ... [2018-09-15 12:08:36,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f316753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:08:36, skipping insertion in model container [2018-09-15 12:08:36,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:08:31" (2/3) ... [2018-09-15 12:08:36,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f316753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:08:36, skipping insertion in model container [2018-09-15 12:08:36,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:08:36" (3/3) ... [2018-09-15 12:08:36,280 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label38_true-unreach-call_false-termination.c [2018-09-15 12:08:36,291 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 12:08:36,302 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 12:08:36,360 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 12:08:36,361 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 12:08:36,362 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 12:08:36,362 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 12:08:36,362 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 12:08:36,362 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 12:08:36,362 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 12:08:36,363 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 12:08:36,363 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 12:08:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-15 12:08:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-15 12:08:36,400 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:08:36,402 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] [2018-09-15 12:08:36,403 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:08:36,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1456283993, now seen corresponding path program 1 times [2018-09-15 12:08:36,411 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:08:36,412 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-09-15 12:08:36,415 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [357], [359], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-15 12:08:36,478 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:08:36,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:08:37,892 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:08:37,894 INFO L272 AbstractInterpreter]: Visited 56 different actions 56 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 12:08:37,917 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:08:38,753 INFO L232 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 80.63% of their original sizes. [2018-09-15 12:08:38,753 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:08:39,031 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:08:39,033 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:08:39,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 12:08:39,033 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:08:39,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 12:08:39,047 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 12:08:39,047 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 12:08:39,050 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-15 12:08:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:08:43,534 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-15 12:08:43,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 12:08:43,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-09-15 12:08:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:08:43,563 INFO L225 Difference]: With dead ends: 693 [2018-09-15 12:08:43,564 INFO L226 Difference]: Without dead ends: 436 [2018-09-15 12:08:43,571 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 12:08:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-15 12:08:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-15 12:08:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-15 12:08:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-15 12:08:43,666 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 57 [2018-09-15 12:08:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:08:43,667 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-15 12:08:43,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 12:08:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-15 12:08:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-15 12:08:43,677 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:08:43,678 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, 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] [2018-09-15 12:08:43,678 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:08:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash -402452437, now seen corresponding path program 1 times [2018-09-15 12:08:43,679 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:08:43,679 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-09-15 12:08:43,680 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [357], [359], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:08:43,686 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:08:43,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:08:50,419 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:08:50,419 INFO L272 AbstractInterpreter]: Visited 92 different actions 177 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 12:08:50,426 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:08:53,284 INFO L232 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 78.68% of their original sizes. [2018-09-15 12:08:53,285 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:08:55,064 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:08:55,065 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:08:55,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:08:55,065 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:08:55,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:08:55,067 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:08:55,068 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:08:55,068 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 11 states. [2018-09-15 12:09:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:09:03,493 INFO L93 Difference]: Finished difference Result 1051 states and 1763 transitions. [2018-09-15 12:09:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 12:09:03,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2018-09-15 12:09:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:09:03,501 INFO L225 Difference]: With dead ends: 1051 [2018-09-15 12:09:03,502 INFO L226 Difference]: Without dead ends: 806 [2018-09-15 12:09:03,505 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 87 SyntacticMatches, 45 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:09:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-09-15 12:09:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 803. [2018-09-15 12:09:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-09-15 12:09:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1002 transitions. [2018-09-15 12:09:03,560 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1002 transitions. Word has length 142 [2018-09-15 12:09:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:09:03,561 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1002 transitions. [2018-09-15 12:09:03,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:09:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1002 transitions. [2018-09-15 12:09:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-15 12:09:03,566 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:09:03,568 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 12:09:03,568 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:09:03,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1353933825, now seen corresponding path program 1 times [2018-09-15 12:09:03,569 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:09:03,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2018-09-15 12:09:03,570 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [357], [359], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:09:03,579 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:09:03,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:09:15,335 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:09:15,336 INFO L272 AbstractInterpreter]: Visited 118 different actions 230 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 12:09:15,353 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:09:19,261 INFO L232 lantSequenceWeakener]: Weakened 166 states. On average, predicates are now at 78.46% of their original sizes. [2018-09-15 12:09:19,262 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:09:20,756 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:09:20,757 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:09:20,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:09:20,758 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:09:20,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:09:20,759 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:09:20,760 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:09:20,760 INFO L87 Difference]: Start difference. First operand 803 states and 1002 transitions. Second operand 11 states. [2018-09-15 12:09:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:09:27,523 INFO L93 Difference]: Finished difference Result 1236 states and 1786 transitions. [2018-09-15 12:09:27,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 12:09:27,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 168 [2018-09-15 12:09:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:09:27,540 INFO L225 Difference]: With dead ends: 1236 [2018-09-15 12:09:27,540 INFO L226 Difference]: Without dead ends: 991 [2018-09-15 12:09:27,543 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 175 GetRequests, 113 SyntacticMatches, 45 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-15 12:09:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-09-15 12:09:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2018-09-15 12:09:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-09-15 12:09:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1200 transitions. [2018-09-15 12:09:27,609 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1200 transitions. Word has length 168 [2018-09-15 12:09:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:09:27,610 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1200 transitions. [2018-09-15 12:09:27,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:09:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1200 transitions. [2018-09-15 12:09:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-15 12:09:27,617 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:09:27,617 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:27,618 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:09:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2120173293, now seen corresponding path program 1 times [2018-09-15 12:09:27,618 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:09:27,618 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-09-15 12:09:27,619 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [357], [359], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:09:27,623 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:09:27,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:09:36,665 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:09:36,666 INFO L272 AbstractInterpreter]: Visited 119 different actions 352 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 12:09:36,670 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:09:38,004 INFO L232 lantSequenceWeakener]: Weakened 251 states. On average, predicates are now at 78.08% of their original sizes. [2018-09-15 12:09:38,004 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:09:38,543 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:09:38,543 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:09:38,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 12:09:38,544 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:09:38,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 12:09:38,545 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 12:09:38,545 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-15 12:09:38,545 INFO L87 Difference]: Start difference. First operand 988 states and 1200 transitions. Second operand 15 states. [2018-09-15 12:09:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:09:51,614 INFO L93 Difference]: Finished difference Result 1967 states and 3058 transitions. [2018-09-15 12:09:51,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-15 12:09:51,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 253 [2018-09-15 12:09:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:09:51,642 INFO L225 Difference]: With dead ends: 1967 [2018-09-15 12:09:51,643 INFO L226 Difference]: Without dead ends: 1722 [2018-09-15 12:09:51,646 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 268 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2018-09-15 12:09:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2018-09-15 12:09:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1422. [2018-09-15 12:09:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2018-09-15 12:09:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1686 transitions. [2018-09-15 12:09:51,705 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1686 transitions. Word has length 253 [2018-09-15 12:09:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:09:51,706 INFO L480 AbstractCegarLoop]: Abstraction has 1422 states and 1686 transitions. [2018-09-15 12:09:51,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 12:09:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1686 transitions. [2018-09-15 12:09:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-15 12:09:51,713 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:09:51,714 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, 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, 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] [2018-09-15 12:09:51,714 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:09:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1543135638, now seen corresponding path program 1 times [2018-09-15 12:09:51,714 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:09:51,715 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-09-15 12:09:51,715 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [357], [359], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:09:51,722 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:09:51,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:10:05,193 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:10:20,032 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:10:20,032 INFO L272 AbstractInterpreter]: Visited 119 different actions 465 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 12:10:20,053 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:10:23,750 INFO L232 lantSequenceWeakener]: Weakened 276 states. On average, predicates are now at 78.03% of their original sizes. [2018-09-15 12:10:23,751 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:10:24,877 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:10:24,877 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:10:24,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:10:24,878 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:10:24,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:10:24,878 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:10:24,879 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:10:24,879 INFO L87 Difference]: Start difference. First operand 1422 states and 1686 transitions. Second operand 11 states. [2018-09-15 12:10:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:10:34,058 INFO L93 Difference]: Finished difference Result 1861 states and 2476 transitions. [2018-09-15 12:10:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 12:10:34,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 278 [2018-09-15 12:10:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:10:34,067 INFO L225 Difference]: With dead ends: 1861 [2018-09-15 12:10:34,068 INFO L226 Difference]: Without dead ends: 1616 [2018-09-15 12:10:34,070 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 286 GetRequests, 223 SyntacticMatches, 45 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-15 12:10:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2018-09-15 12:10:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1609. [2018-09-15 12:10:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-09-15 12:10:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 1904 transitions. [2018-09-15 12:10:34,125 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 1904 transitions. Word has length 278 [2018-09-15 12:10:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:10:34,126 INFO L480 AbstractCegarLoop]: Abstraction has 1609 states and 1904 transitions. [2018-09-15 12:10:34,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:10:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1904 transitions. [2018-09-15 12:10:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-09-15 12:10:34,135 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:10:34,135 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 12:10:34,136 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:10:34,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1444101291, now seen corresponding path program 1 times [2018-09-15 12:10:34,136 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:10:34,136 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 357 with the following transitions: [2018-09-15 12:10:34,137 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [357], [359], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:10:34,141 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:10:34,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:10:45,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:11:01,663 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:11:01,664 INFO L272 AbstractInterpreter]: Visited 120 different actions 710 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 12:11:01,685 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:11:03,653 INFO L232 lantSequenceWeakener]: Weakened 354 states. On average, predicates are now at 77.87% of their original sizes. [2018-09-15 12:11:03,653 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:11:03,933 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:11:03,934 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:11:03,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 12:11:03,934 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:11:03,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 12:11:03,935 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 12:11:03,935 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 12:11:03,935 INFO L87 Difference]: Start difference. First operand 1609 states and 1904 transitions. Second operand 10 states. [2018-09-15 12:11:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:11:09,943 INFO L93 Difference]: Finished difference Result 2266 states and 2945 transitions. [2018-09-15 12:11:09,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 12:11:09,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 356 [2018-09-15 12:11:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:11:09,955 INFO L225 Difference]: With dead ends: 2266 [2018-09-15 12:11:09,955 INFO L226 Difference]: Without dead ends: 1834 [2018-09-15 12:11:09,958 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 363 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:11:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2018-09-15 12:11:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1816. [2018-09-15 12:11:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2018-09-15 12:11:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2160 transitions. [2018-09-15 12:11:10,020 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2160 transitions. Word has length 356 [2018-09-15 12:11:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:11:10,021 INFO L480 AbstractCegarLoop]: Abstraction has 1816 states and 2160 transitions. [2018-09-15 12:11:10,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 12:11:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2160 transitions. [2018-09-15 12:11:10,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-09-15 12:11:10,031 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:11:10,031 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 12:11:10,031 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:11:10,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1516077981, now seen corresponding path program 1 times [2018-09-15 12:11:10,032 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:11:10,032 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 361 with the following transitions: [2018-09-15 12:11:10,033 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [357], [359], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:11:10,036 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:11:10,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:11:20,325 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:11:46,236 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:11:46,236 INFO L272 AbstractInterpreter]: Visited 120 different actions 948 times. Merged at 8 different actions 65 times. Widened at 1 different actions 3 times. Found 14 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 12:11:46,244 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:11:48,194 INFO L232 lantSequenceWeakener]: Weakened 358 states. On average, predicates are now at 77.87% of their original sizes. [2018-09-15 12:11:48,194 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:11:48,483 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:11:48,483 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:11:48,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 12:11:48,483 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:11:48,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 12:11:48,484 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 12:11:48,484 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 12:11:48,485 INFO L87 Difference]: Start difference. First operand 1816 states and 2160 transitions. Second operand 10 states. [2018-09-15 12:11:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:11:53,122 INFO L93 Difference]: Finished difference Result 2648 states and 3429 transitions. [2018-09-15 12:11:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-15 12:11:53,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 360 [2018-09-15 12:11:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:11:53,139 INFO L225 Difference]: With dead ends: 2648 [2018-09-15 12:11:53,139 INFO L226 Difference]: Without dead ends: 2011 [2018-09-15 12:11:53,142 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 367 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:11:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2018-09-15 12:11:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 2001. [2018-09-15 12:11:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2018-09-15 12:11:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2378 transitions. [2018-09-15 12:11:53,202 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2378 transitions. Word has length 360 [2018-09-15 12:11:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:11:53,203 INFO L480 AbstractCegarLoop]: Abstraction has 2001 states and 2378 transitions. [2018-09-15 12:11:53,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 12:11:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2378 transitions. [2018-09-15 12:11:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-09-15 12:11:53,210 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:11:53,210 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 12:11:53,211 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:11:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1419727554, now seen corresponding path program 1 times [2018-09-15 12:11:53,211 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:11:53,211 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 382 with the following transitions: [2018-09-15 12:11:53,212 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [357], [359], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:11:53,215 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:11:53,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:12:04,382 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:12:20,424 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:12:20,424 INFO L272 AbstractInterpreter]: Visited 120 different actions 710 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 12:12:20,431 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:12:22,448 INFO L232 lantSequenceWeakener]: Weakened 379 states. On average, predicates are now at 77.83% of their original sizes. [2018-09-15 12:12:22,448 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:12:22,754 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:12:22,754 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:12:22,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 12:12:22,754 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:12:22,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 12:12:22,755 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 12:12:22,755 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 12:12:22,755 INFO L87 Difference]: Start difference. First operand 2001 states and 2378 transitions. Second operand 10 states. [2018-09-15 12:12:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:12:28,713 INFO L93 Difference]: Finished difference Result 3057 states and 3905 transitions. [2018-09-15 12:12:28,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 12:12:28,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 381 [2018-09-15 12:12:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:12:28,727 INFO L225 Difference]: With dead ends: 3057 [2018-09-15 12:12:28,727 INFO L226 Difference]: Without dead ends: 2235 [2018-09-15 12:12:28,731 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 388 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:12:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2018-09-15 12:12:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2214. [2018-09-15 12:12:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2018-09-15 12:12:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2643 transitions. [2018-09-15 12:12:28,806 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2643 transitions. Word has length 381 [2018-09-15 12:12:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:12:28,807 INFO L480 AbstractCegarLoop]: Abstraction has 2214 states and 2643 transitions. [2018-09-15 12:12:28,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 12:12:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2643 transitions. [2018-09-15 12:12:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-09-15 12:12:28,815 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:12:28,815 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 12:12:28,816 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:12:28,816 INFO L82 PathProgramCache]: Analyzing trace with hash -975926328, now seen corresponding path program 1 times [2018-09-15 12:12:28,816 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:12:28,816 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 439 with the following transitions: [2018-09-15 12:12:28,817 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [357], [359], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:12:28,820 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:12:28,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-09-15 12:12:35,385 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 12:12:35,386 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 12:12:35,386 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 12:12:35,446 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 12:12:35,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 12:12:35 BoogieIcfgContainer [2018-09-15 12:12:35,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 12:12:35,448 INFO L168 Benchmark]: Toolchain (without parser) took 244478.16 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 3.5 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-15 12:12:35,450 INFO L168 Benchmark]: CDTParser took 0.26 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 12:12:35,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.98 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2018-09-15 12:12:35,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.65 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 12:12:35,452 INFO L168 Benchmark]: Boogie Preprocessor took 324.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -881.4 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2018-09-15 12:12:35,453 INFO L168 Benchmark]: RCFGBuilder took 3978.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 123.7 MB). Peak memory consumption was 123.7 MB. Max. memory is 7.1 GB. [2018-09-15 12:12:35,453 INFO L168 Benchmark]: TraceAbstraction took 239174.21 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 12:12:35,460 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.26 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 866.98 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 126.65 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 324.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -881.4 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3978.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 123.7 MB). Peak memory consumption was 123.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239174.21 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 154]: 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 inputD = 4; [L8] int inputB = 2; [L9] int inputC = 3; [L10] int inputF = 6; [L11] int inputE = 5; [L12] int inputA = 1; [L15] int a21 = 7; [L16] int a15 = 8; [L17] int a12 = -49; [L18] int a24 = 1; [L877] int output = -1; [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L451] a21 = 10 [L453] RET return 22; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L445] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L446] a21 = 7 [L448] RET return 25; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND TRUE ((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8)) [L253] a12 = ((((a12 - 438298) * 1) + 564710) - 684902) [L254] a15 = 5 [L255] a21 = 6 [L257] RET return -1; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND TRUE (((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1)) [L277] a21 = 10 [L279] RET return 24; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND TRUE ((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10)) [L154] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 239.0s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 58.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1842 SDtfs, 8481 SDslu, 1923 SDs, 0 SdLazy, 14973 SolverSat, 2511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.1s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 2051 GetRequests, 1784 SyntacticMatches, 135 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2214occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 154.9s AbstIntTime, 9 AbstIntIterations, 8 AbstIntStrong, 0.9953765682469644 AbsIntWeakeningRatio, 0.10166079516859587 AbsIntAvgWeakeningVarsNumRemoved, 640.3477604428787 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 364 StatesRemovedByMinimization, 8 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/Problem14_label38_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_12-12-35-475.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label38_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_12-12-35-475.csv Completed graceful shutdown