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_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label30_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:59:00,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:59:00,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:59:00,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:59:00,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:59:00,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:59:00,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:59:00,198 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:59:00,202 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:59:00,203 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:59:00,204 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:59:00,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:59:00,206 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:59:00,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:59:00,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:59:00,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:59:00,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:59:00,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:59:00,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:59:00,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:59:00,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:59:00,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:59:00,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:59:00,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:59:00,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:59:00,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:59:00,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:59:00,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:59:00,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:59:00,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:59:00,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:59:00,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:59:00,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:59:00,227 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:59:00,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:59:00,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:59:00,229 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:59:00,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:59:00,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:59:00,246 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:59:00,246 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:59:00,246 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:59:00,246 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:59:00,247 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:59:00,247 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:59:00,247 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:59:00,247 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:59:00,247 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:59:00,248 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:59:00,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:59:00,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:59:00,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:59:00,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:59:00,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:59:00,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:59:00,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:59:00,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:59:00,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:59:00,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:59:00,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:59:00,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:59:00,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:59:00,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:59:00,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:59:00,251 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:59:00,252 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:59:00,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:59:00,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:59:00,252 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:59:00,252 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:59:00,253 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:59:00,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:59:00,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:59:00,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:59:00,340 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:59:00,341 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:59:00,342 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label30_true-unreach-call_false-termination.c [2018-09-19 12:59:00,700 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02ace9fa/0e6e5efa1a414378b1d3acb98fc85952/FLAGa0ddb36cc [2018-09-19 12:59:01,026 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:59:01,032 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label30_true-unreach-call_false-termination.c [2018-09-19 12:59:01,055 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02ace9fa/0e6e5efa1a414378b1d3acb98fc85952/FLAGa0ddb36cc [2018-09-19 12:59:01,077 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02ace9fa/0e6e5efa1a414378b1d3acb98fc85952 [2018-09-19 12:59:01,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:59:01,091 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:59:01,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:59:01,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:59:01,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:59:01,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:01,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181c80c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01, skipping insertion in model container [2018-09-19 12:59:01,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:01,119 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:59:01,661 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:59:01,679 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:59:01,815 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:59:01,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01 WrapperNode [2018-09-19 12:59:01,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:59:01,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:59:01,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:59:01,881 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:59:01,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:01,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:02,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:59:02,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:59:02,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:59:02,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:59:02,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:02,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:02,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:02,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:02,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:02,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:02,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (1/1) ... [2018-09-19 12:59:02,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:59:02,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:59:02,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:59:02,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:59:02,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (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-19 12:59:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:59:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:59:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:59:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:59:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:59:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:59:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:59:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:59:06,233 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:59:06,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:59:06 BoogieIcfgContainer [2018-09-19 12:59:06,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:59:06,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:59:06,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:59:06,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:59:06,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:59:01" (1/3) ... [2018-09-19 12:59:06,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415d67ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:59:06, skipping insertion in model container [2018-09-19 12:59:06,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:59:01" (2/3) ... [2018-09-19 12:59:06,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415d67ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:59:06, skipping insertion in model container [2018-09-19 12:59:06,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:59:06" (3/3) ... [2018-09-19 12:59:06,245 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label30_true-unreach-call_false-termination.c [2018-09-19 12:59:06,255 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:59:06,264 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:59:06,323 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:59:06,324 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:59:06,324 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:59:06,324 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:59:06,324 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:59:06,325 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:59:06,325 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:59:06,325 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:59:06,325 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:59:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-19 12:59:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-19 12:59:06,369 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:06,370 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] [2018-09-19 12:59:06,371 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2034525268, now seen corresponding path program 1 times [2018-09-19 12:59:06,379 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:06,380 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-09-19 12:59:06,382 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], [301], [303], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-19 12:59:06,422 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:06,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:06,714 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:59:06,716 INFO L272 AbstractInterpreter]: Visited 49 different actions 49 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:59:06,761 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:59:07,006 INFO L232 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 80.04% of their original sizes. [2018-09-19 12:59:07,007 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:59:07,266 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:59:07,268 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:59:07,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:59:07,268 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:59:07,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:59:07,286 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:59:07,287 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:59:07,290 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-19 12:59:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:59:10,428 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-19 12:59:10,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:59:10,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-09-19 12:59:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:59:10,455 INFO L225 Difference]: With dead ends: 693 [2018-09-19 12:59:10,455 INFO L226 Difference]: Without dead ends: 436 [2018-09-19 12:59:10,465 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 45 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-19 12:59:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-19 12:59:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-19 12:59:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-19 12:59:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-19 12:59:10,551 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 50 [2018-09-19 12:59:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:59:10,552 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-19 12:59:10,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:59:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-19 12:59:10,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-19 12:59:10,560 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:10,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:59:10,561 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:10,561 INFO L82 PathProgramCache]: Analyzing trace with hash 6838115, now seen corresponding path program 1 times [2018-09-19 12:59:10,561 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:10,562 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2018-09-19 12:59:10,562 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [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-19 12:59:10,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:10,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:10,791 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:59:10,795 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-19 12:59:10,834 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:59:11,107 INFO L232 lantSequenceWeakener]: Weakened 132 states. On average, predicates are now at 78.33% of their original sizes. [2018-09-19 12:59:11,107 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:59:11,837 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:59:11,838 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:59:11,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:59:11,838 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:59:11,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:59:11,840 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:59:11,840 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:59:11,841 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 10 states. [2018-09-19 12:59:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:59:17,119 INFO L93 Difference]: Finished difference Result 874 states and 1407 transitions. [2018-09-19 12:59:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:59:17,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2018-09-19 12:59:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:59:17,127 INFO L225 Difference]: With dead ends: 874 [2018-09-19 12:59:17,127 INFO L226 Difference]: Without dead ends: 629 [2018-09-19 12:59:17,130 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:59:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-19 12:59:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2018-09-19 12:59:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-19 12:59:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 822 transitions. [2018-09-19 12:59:17,166 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 822 transitions. Word has length 135 [2018-09-19 12:59:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:59:17,167 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 822 transitions. [2018-09-19 12:59:17,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:59:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 822 transitions. [2018-09-19 12:59:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-19 12:59:17,171 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:17,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:59:17,172 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:17,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1729758513, now seen corresponding path program 1 times [2018-09-19 12:59:17,173 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:17,173 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-09-19 12:59:17,173 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [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-19 12:59:17,178 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:17,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:17,367 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:59:17,367 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-19 12:59:17,407 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:59:17,656 INFO L232 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 78.15% of their original sizes. [2018-09-19 12:59:17,656 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:59:18,420 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:59:18,420 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:59:18,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:59:18,421 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:59:18,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:59:18,421 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:59:18,422 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:59:18,422 INFO L87 Difference]: Start difference. First operand 626 states and 822 transitions. Second operand 10 states. [2018-09-19 12:59:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:59:20,766 INFO L93 Difference]: Finished difference Result 1059 states and 1606 transitions. [2018-09-19 12:59:20,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:59:20,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-09-19 12:59:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:59:20,773 INFO L225 Difference]: With dead ends: 1059 [2018-09-19 12:59:20,774 INFO L226 Difference]: Without dead ends: 814 [2018-09-19 12:59:20,776 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:59:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2018-09-19 12:59:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 811. [2018-09-19 12:59:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-09-19 12:59:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1020 transitions. [2018-09-19 12:59:20,807 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1020 transitions. Word has length 161 [2018-09-19 12:59:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:59:20,808 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1020 transitions. [2018-09-19 12:59:20,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:59:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1020 transitions. [2018-09-19 12:59:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-19 12:59:20,816 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:20,817 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, 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] [2018-09-19 12:59:20,817 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1238899680, now seen corresponding path program 1 times [2018-09-19 12:59:20,818 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:20,818 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-09-19 12:59:20,819 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [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-19 12:59:20,823 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:20,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:21,043 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:59:21,043 INFO L272 AbstractInterpreter]: Visited 119 different actions 351 times. Merged at 7 different actions 16 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:59:21,083 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:59:21,467 INFO L232 lantSequenceWeakener]: Weakened 243 states. On average, predicates are now at 77.88% of their original sizes. [2018-09-19 12:59:21,467 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:59:22,042 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:59:22,042 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:59:22,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:59:22,043 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:59:22,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:59:22,044 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:59:22,044 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:59:22,044 INFO L87 Difference]: Start difference. First operand 811 states and 1020 transitions. Second operand 10 states. [2018-09-19 12:59:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:59:25,622 INFO L93 Difference]: Finished difference Result 1262 states and 1823 transitions. [2018-09-19 12:59:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:59:25,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 246 [2018-09-19 12:59:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:59:25,630 INFO L225 Difference]: With dead ends: 1262 [2018-09-19 12:59:25,630 INFO L226 Difference]: Without dead ends: 1017 [2018-09-19 12:59:25,632 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:59:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-09-19 12:59:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1012. [2018-09-19 12:59:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-09-19 12:59:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1251 transitions. [2018-09-19 12:59:25,661 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1251 transitions. Word has length 246 [2018-09-19 12:59:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:59:25,662 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1251 transitions. [2018-09-19 12:59:25,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:59:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1251 transitions. [2018-09-19 12:59:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-19 12:59:25,667 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:25,667 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:59:25,668 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1278071165, now seen corresponding path program 1 times [2018-09-19 12:59:25,668 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:25,669 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-09-19 12:59:25,669 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [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-19 12:59:25,673 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:25,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:25,989 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:59:28,178 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:59:28,178 INFO L272 AbstractInterpreter]: Visited 119 different actions 463 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:59:28,185 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:59:28,908 INFO L232 lantSequenceWeakener]: Weakened 268 states. On average, predicates are now at 77.83% of their original sizes. [2018-09-19 12:59:28,909 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:59:29,047 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:59:29,048 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:59:29,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:59:29,048 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:59:29,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:59:29,049 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:59:29,049 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:59:29,049 INFO L87 Difference]: Start difference. First operand 1012 states and 1251 transitions. Second operand 10 states. [2018-09-19 12:59:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:59:32,610 INFO L93 Difference]: Finished difference Result 1451 states and 2041 transitions. [2018-09-19 12:59:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:59:32,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 271 [2018-09-19 12:59:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:59:32,623 INFO L225 Difference]: With dead ends: 1451 [2018-09-19 12:59:32,623 INFO L226 Difference]: Without dead ends: 1206 [2018-09-19 12:59:32,625 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 278 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:59:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-09-19 12:59:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1199. [2018-09-19 12:59:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-09-19 12:59:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1469 transitions. [2018-09-19 12:59:32,658 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1469 transitions. Word has length 271 [2018-09-19 12:59:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:59:32,659 INFO L480 AbstractCegarLoop]: Abstraction has 1199 states and 1469 transitions. [2018-09-19 12:59:32,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:59:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1469 transitions. [2018-09-19 12:59:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-09-19 12:59:32,665 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:32,666 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:59:32,666 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:32,666 INFO L82 PathProgramCache]: Analyzing trace with hash 430579063, now seen corresponding path program 1 times [2018-09-19 12:59:32,666 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:32,667 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 350 with the following transitions: [2018-09-19 12:59:32,667 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [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-19 12:59:32,677 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:32,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:32,854 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:59:34,369 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:59:34,369 INFO L272 AbstractInterpreter]: Visited 120 different actions 589 times. Merged at 8 different actions 33 times. Never widened. Found 8 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:59:34,379 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:59:35,043 INFO L232 lantSequenceWeakener]: Weakened 346 states. On average, predicates are now at 77.73% of their original sizes. [2018-09-19 12:59:35,043 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:59:35,200 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:59:35,201 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:59:35,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:59:35,201 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:59:35,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:59:35,202 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:59:35,202 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:59:35,202 INFO L87 Difference]: Start difference. First operand 1199 states and 1469 transitions. Second operand 10 states. [2018-09-19 12:59:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:59:37,666 INFO L93 Difference]: Finished difference Result 1866 states and 2520 transitions. [2018-09-19 12:59:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:59:37,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 349 [2018-09-19 12:59:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:59:37,681 INFO L225 Difference]: With dead ends: 1866 [2018-09-19 12:59:37,681 INFO L226 Difference]: Without dead ends: 1434 [2018-09-19 12:59:37,683 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 356 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:59:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2018-09-19 12:59:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1419. [2018-09-19 12:59:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2018-09-19 12:59:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1752 transitions. [2018-09-19 12:59:37,733 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1752 transitions. Word has length 349 [2018-09-19 12:59:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:59:37,735 INFO L480 AbstractCegarLoop]: Abstraction has 1419 states and 1752 transitions. [2018-09-19 12:59:37,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:59:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1752 transitions. [2018-09-19 12:59:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-09-19 12:59:37,743 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:37,743 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, 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, 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-19 12:59:37,744 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1839294800, now seen corresponding path program 1 times [2018-09-19 12:59:37,744 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:37,744 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 375 with the following transitions: [2018-09-19 12:59:37,745 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [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-19 12:59:37,747 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:37,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:37,952 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:59:39,537 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:59:39,537 INFO L272 AbstractInterpreter]: Visited 120 different actions 589 times. Merged at 8 different actions 33 times. Never widened. Found 8 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:59:39,541 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:59:40,186 INFO L232 lantSequenceWeakener]: Weakened 371 states. On average, predicates are now at 77.7% of their original sizes. [2018-09-19 12:59:40,187 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:59:40,361 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:59:40,362 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:59:40,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:59:40,362 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:59:40,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:59:40,363 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:59:40,363 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:59:40,363 INFO L87 Difference]: Start difference. First operand 1419 states and 1752 transitions. Second operand 10 states. [2018-09-19 12:59:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:59:43,077 INFO L93 Difference]: Finished difference Result 2312 states and 3094 transitions. [2018-09-19 12:59:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:59:43,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 374 [2018-09-19 12:59:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:59:43,089 INFO L225 Difference]: With dead ends: 2312 [2018-09-19 12:59:43,089 INFO L226 Difference]: Without dead ends: 1660 [2018-09-19 12:59:43,092 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 381 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:59:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2018-09-19 12:59:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1641. [2018-09-19 12:59:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2018-09-19 12:59:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2038 transitions. [2018-09-19 12:59:43,137 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2038 transitions. Word has length 374 [2018-09-19 12:59:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:59:43,137 INFO L480 AbstractCegarLoop]: Abstraction has 1641 states and 2038 transitions. [2018-09-19 12:59:43,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:59:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2038 transitions. [2018-09-19 12:59:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-09-19 12:59:43,146 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:43,147 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:59:43,147 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:43,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1935298163, now seen corresponding path program 1 times [2018-09-19 12:59:43,148 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:43,148 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 432 with the following transitions: [2018-09-19 12:59:43,148 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [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], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [854], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 12:59:43,151 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:43,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:43,336 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:59:45,210 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:59:45,211 INFO L272 AbstractInterpreter]: Visited 169 different actions 1003 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:59:45,221 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:59:45,896 INFO L232 lantSequenceWeakener]: Weakened 428 states. On average, predicates are now at 77.64% of their original sizes. [2018-09-19 12:59:45,897 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:59:46,007 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:59:46,007 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:59:46,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:59:46,007 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:59:46,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:59:46,008 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:59:46,008 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:59:46,009 INFO L87 Difference]: Start difference. First operand 1641 states and 2038 transitions. Second operand 10 states. [2018-09-19 12:59:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:59:48,377 INFO L93 Difference]: Finished difference Result 3114 states and 4163 transitions. [2018-09-19 12:59:48,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:59:48,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 431 [2018-09-19 12:59:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:59:48,394 INFO L225 Difference]: With dead ends: 3114 [2018-09-19 12:59:48,394 INFO L226 Difference]: Without dead ends: 2240 [2018-09-19 12:59:48,398 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 438 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:59:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2018-09-19 12:59:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2206. [2018-09-19 12:59:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2018-09-19 12:59:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2720 transitions. [2018-09-19 12:59:48,467 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2720 transitions. Word has length 431 [2018-09-19 12:59:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:59:48,468 INFO L480 AbstractCegarLoop]: Abstraction has 2206 states and 2720 transitions. [2018-09-19 12:59:48,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:59:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2720 transitions. [2018-09-19 12:59:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-09-19 12:59:48,476 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:48,476 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, 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, 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] [2018-09-19 12:59:48,476 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:48,477 INFO L82 PathProgramCache]: Analyzing trace with hash 584677172, now seen corresponding path program 1 times [2018-09-19 12:59:48,477 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:48,477 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 509 with the following transitions: [2018-09-19 12:59:48,477 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [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], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [854], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 12:59:48,480 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:48,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:48,670 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:59:50,850 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:59:50,850 INFO L272 AbstractInterpreter]: Visited 170 different actions 1012 times. Merged at 9 different actions 47 times. Widened at 1 different actions 1 times. Found 12 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:59:50,859 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:59:51,565 INFO L232 lantSequenceWeakener]: Weakened 505 states. On average, predicates are now at 77.6% of their original sizes. [2018-09-19 12:59:51,566 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:59:51,678 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:59:51,678 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:59:51,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:59:51,678 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:59:51,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:59:51,679 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:59:51,679 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:59:51,680 INFO L87 Difference]: Start difference. First operand 2206 states and 2720 transitions. Second operand 10 states. [2018-09-19 12:59:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:59:53,719 INFO L93 Difference]: Finished difference Result 3875 states and 5024 transitions. [2018-09-19 12:59:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:59:53,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 508 [2018-09-19 12:59:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:59:53,734 INFO L225 Difference]: With dead ends: 3875 [2018-09-19 12:59:53,734 INFO L226 Difference]: Without dead ends: 2436 [2018-09-19 12:59:53,738 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 515 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:59:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2018-09-19 12:59:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2395. [2018-09-19 12:59:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2018-09-19 12:59:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2973 transitions. [2018-09-19 12:59:53,801 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2973 transitions. Word has length 508 [2018-09-19 12:59:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:59:53,803 INFO L480 AbstractCegarLoop]: Abstraction has 2395 states and 2973 transitions. [2018-09-19 12:59:53,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:59:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2973 transitions. [2018-09-19 12:59:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-09-19 12:59:53,810 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:59:53,811 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, 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, 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] [2018-09-19 12:59:53,811 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:59:53,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1830830428, now seen corresponding path program 1 times [2018-09-19 12:59:53,812 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:59:53,812 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 517 with the following transitions: [2018-09-19 12:59:53,812 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [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], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [854], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 12:59:53,815 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:59:53,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:59:54,083 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:59:55,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:59:55,480 INFO L272 AbstractInterpreter]: Visited 171 different actions 1021 times. Merged at 9 different actions 55 times. Widened at 1 different actions 1 times. Found 14 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:59:55,487 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:59:55,548 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:59:55,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:59:55 BoogieIcfgContainer [2018-09-19 12:59:55,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:59:55,549 INFO L168 Benchmark]: Toolchain (without parser) took 54460.53 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -999.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-09-19 12:59:55,555 INFO L168 Benchmark]: CDTParser took 0.24 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-19 12:59:55,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.32 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-19 12:59:55,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.29 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-19 12:59:55,557 INFO L168 Benchmark]: Boogie Preprocessor took 290.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -895.4 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2018-09-19 12:59:55,558 INFO L168 Benchmark]: RCFGBuilder took 3915.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 121.3 MB). Peak memory consumption was 121.3 MB. Max. memory is 7.1 GB. [2018-09-19 12:59:55,560 INFO L168 Benchmark]: TraceAbstraction took 49313.11 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -302.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-19 12:59:55,570 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.24 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 787.32 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 147.29 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 290.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -895.4 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3915.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 121.3 MB). Peak memory consumption was 121.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49313.11 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -302.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 133]: 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 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 FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) [L454] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) [L460] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) [L467] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) [L472] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) [L478] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) [L484] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) [L490] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) [L495] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) [L500] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) [L506] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) [L512] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) [L518] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) [L524] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) [L530] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) [L536] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) [L541] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) [L547] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L552] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) [L555] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) [L561] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) [L568] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) [L573] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) [L579] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) [L585] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) [L591] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) [L597] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) [L603] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) [L609] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L615] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) [L621] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) [L626] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) [L632] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) [L638] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) [L644] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) [L650] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) [L656] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) [L662] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) [L668] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) [L674] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) [L677] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) [L683] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) [L688] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) [L694] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) [L700] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) [L706] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) [L712] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) [L718] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) [L724] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) [L730] COND TRUE ((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8))) [L731] a12 = (((a12 - -61) - -3) - -1) [L732] a21 = 8 [L734] RET return 26; [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 TRUE ((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8)) [L295] a15 = 5 [L296] a21 = 6 [L298] 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 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 TRUE ((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7)) [L133] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 49.2s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1980 SDtfs, 7438 SDslu, 2333 SDs, 0 SdLazy, 16310 SolverSat, 2054 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.7s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 2577 GetRequests, 2448 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2395occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 13.3s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9972554832209567 AbsIntWeakeningRatio, 0.09538950715421304 AbsIntAvgWeakeningVarsNumRemoved, 22.488076311605724 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 129 StatesRemovedByMinimization, 9 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_label30_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-59-55-605.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label30_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-59-55-605.csv Received shutdown request...